# Bijection of complements [duplicate]

Let $E$ and $F$ be subsets of some set $S$, which may be finite or infinite. Suppose we are given a bijection $g\colon E\to F$. Is there an explicit way to construct from $g$ a bijection $h\colon S\setminus F\to S\setminus E$?
By explicit, I mean that it is not enough to show that $g$ exists (this is clear, since the cardinalities of $S\setminus F$ and $S\setminus E$ are equal).
## marked as duplicate by Asaf Karagila♦ cardinals StackExchange.ready(function() { if (StackExchange.options.isMobile) return; $('.dupe-hammer-message-hover:not(.hover-bound)').each(function() { var$hover = $(this).addClass('hover-bound'),$msg = $hover.siblings('.dupe-hammer-message');$hover.hover( function() { $hover.showInfoMessage('', { messageElement:$msg.clone().show(), transient: false, position: { my: 'bottom left', at: 'top center', offsetTop: -7 }, dismissable: false, relativeToBody: true }); }, function() { StackExchange.helpers.removeMessages(); } ); }); }); May 9 '17 at 5:54
• The cardinalities of $S\setminus F$ and $S\setminus E$ may not be equal if $S$ is infinite. – Lord Shark the Unknown May 8 '17 at 18:37