Theorem f1opw2 6296

Description: A one-to-one mapping induces a one-to-one mapping on power sets. This version of f1opw 6297 avoids the Axiom of Replacement. (Contributed by Mario Carneiro, 26-Jun-2015.)

Hypotheses

Ref	Expression
f1opw2.1	|- ( ph -> F : A -1-1-onto-> B )
f1opw2.2	|- ( ph -> ( `' F " a ) e. _V )
f1opw2.3	|- ( ph -> ( F " b ) e. _V )

Assertion

Ref	Expression
f1opw2	|- ( ph -> ( b e. ~P A |-> ( F " b ) ) : ~P A -1-1-onto-> ~P B )

Distinct variable groups:   a, b, A   B, a, b   F, a, b   ph, a, b

Proof of Theorem f1opw2

Step	Hyp	Ref	Expression
1		eqid 2238	. 2 |- ( b e. ~P A |-> ( F " b ) ) = ( b e. ~P A |-> ( F " b ) )
2		imassrn 5137	. . . . 5 |- ( F " b ) C_ ran F
3		f1opw2.1	. . . . . . 7 |- ( ph -> F : A -1-1-onto-> B )
4		f1ofo 5646	. . . . . . 7 |- ( F : A -1-1-onto-> B -> F : A -onto-> B )
5	3, 4	syl 14	. . . . . 6 |- ( ph -> F : A -onto-> B )
6		forn 5618	. . . . . 6 |- ( F : A -onto-> B -> ran F = B )
7	5, 6	syl 14	. . . . 5 |- ( ph -> ran F = B )
8	2, 7	sseqtrid 3298	. . . 4 |- ( ph -> ( F " b ) C_ B )
9		f1opw2.3	. . . . 5 |- ( ph -> ( F " b ) e. _V )
10		elpwg 3696	. . . . 5 |- ( ( F " b ) e. _V -> ( ( F " b ) e. ~P B <-> ( F " b ) C_ B ) )
11	9, 10	syl 14	. . . 4 |- ( ph -> ( ( F " b ) e. ~P B <-> ( F " b ) C_ B ) )
12	8, 11	mpbird 167	. . 3 |- ( ph -> ( F " b ) e. ~P B )
13	12	adantr 276	. 2 |- ( ( ph /\ b e. ~P A ) -> ( F " b ) e. ~P B )
14		imassrn 5137	. . . . 5 |- ( `' F " a ) C_ ran `' F
15		dfdm4 4973	. . . . . 6 |- dom F = ran `' F
16		f1odm 5643	. . . . . . 7 |- ( F : A -1-1-onto-> B -> dom F = A )
17	3, 16	syl 14	. . . . . 6 |- ( ph -> dom F = A )
18	15, 17	eqtr3id 2285	. . . . 5 |- ( ph -> ran `' F = A )
19	14, 18	sseqtrid 3298	. . . 4 |- ( ph -> ( `' F " a ) C_ A )
20		f1opw2.2	. . . . 5 |- ( ph -> ( `' F " a ) e. _V )
21		elpwg 3696	. . . . 5 |- ( ( `' F " a ) e. _V -> ( ( `' F " a ) e. ~P A <-> ( `' F " a ) C_ A ) )
22	20, 21	syl 14	. . . 4 |- ( ph -> ( ( `' F " a ) e. ~P A <-> ( `' F " a ) C_ A ) )
23	19, 22	mpbird 167	. . 3 |- ( ph -> ( `' F " a ) e. ~P A )
24	23	adantr 276	. 2 |- ( ( ph /\ a e. ~P B ) -> ( `' F " a ) e. ~P A )
25		elpwi 3698	. . . . . . 7 |- ( a e. ~P B -> a C_ B )
26	25	adantl 277	. . . . . 6 |- ( ( b e. ~P A /\ a e. ~P B ) -> a C_ B )
27		foimacnv 5657	. . . . . 6 |- ( ( F : A -onto-> B /\ a C_ B ) -> ( F " ( `' F " a ) ) = a )
28	5, 26, 27	syl2an 289	. . . . 5 |- ( ( ph /\ ( b e. ~P A /\ a e. ~P B ) ) -> ( F " ( `' F " a ) ) = a )
29	28	eqcomd 2244	. . . 4 |- ( ( ph /\ ( b e. ~P A /\ a e. ~P B ) ) -> a = ( F " ( `' F " a ) ) )
30		imaeq2 5122	. . . . 5 |- ( b = ( `' F " a ) -> ( F " b ) = ( F " ( `' F " a ) ) )
31	30	eqeq2d 2250	. . . 4 |- ( b = ( `' F " a ) -> ( a = ( F " b ) <-> a = ( F " ( `' F " a ) ) ) )
32	29, 31	syl5ibrcom 157	. . 3 |- ( ( ph /\ ( b e. ~P A /\ a e. ~P B ) ) -> ( b = ( `' F " a ) -> a = ( F " b ) ) )
33		f1of1 5638	. . . . . . 7 |- ( F : A -1-1-onto-> B -> F : A -1-1-> B )
34	3, 33	syl 14	. . . . . 6 |- ( ph -> F : A -1-1-> B )
35		elpwi 3698	. . . . . . 7 |- ( b e. ~P A -> b C_ A )
36	35	adantr 276	. . . . . 6 |- ( ( b e. ~P A /\ a e. ~P B ) -> b C_ A )
37		f1imacnv 5656	. . . . . 6 |- ( ( F : A -1-1-> B /\ b C_ A ) -> ( `' F " ( F " b ) ) = b )
38	34, 36, 37	syl2an 289	. . . . 5 |- ( ( ph /\ ( b e. ~P A /\ a e. ~P B ) ) -> ( `' F " ( F " b ) ) = b )
39	38	eqcomd 2244	. . . 4 |- ( ( ph /\ ( b e. ~P A /\ a e. ~P B ) ) -> b = ( `' F " ( F " b ) ) )
40		imaeq2 5122	. . . . 5 |- ( a = ( F " b ) -> ( `' F " a ) = ( `' F " ( F " b ) ) )
41	40	eqeq2d 2250	. . . 4 |- ( a = ( F " b ) -> ( b = ( `' F " a ) <-> b = ( `' F " ( F " b ) ) ) )
42	39, 41	syl5ibrcom 157	. . 3 |- ( ( ph /\ ( b e. ~P A /\ a e. ~P B ) ) -> ( a = ( F " b ) -> b = ( `' F " a ) ) )
43	32, 42	impbid 129	. 2 |- ( ( ph /\ ( b e. ~P A /\ a e. ~P B ) ) -> ( b = ( `' F " a ) <-> a = ( F " b ) ) )
44	1, 13, 24, 43	f1o2d 6295	1 |- ( ph -> ( b e. ~P A |-> ( F " b ) ) : ~P A -1-1-onto-> ~P B )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1402   e. wcel 2209   _Vcvv 2821   C_ wss 3220   ~Pcpw 3688   |-> cmpt 4192   `'ccnv 4773   dom cdm 4774   ran crn 4775   "cima 4777   -1-1->wf1 5374   -onto->wfo 5375   -1-1-onto->wf1o 5376

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384

This theorem is used by:  f1opw  6297