Theorem fopwdom 6958

Description: Covering implies injection on power sets. (Contributed by Stefan O'Rear, 6-Nov-2014.) (Revised by Mario Carneiro, 24-Jun-2015.)

Assertion

Ref	Expression
fopwdom	⊢ ((𝐹 ∈ V ∧ 𝐹:𝐴–onto→𝐵) → 𝒫 𝐵 ≼ 𝒫 𝐴)

Proof of Theorem fopwdom

Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		imassrn 5052	. . . . . 6 ⊢ (◡𝐹 “ 𝑎) ⊆ ran ◡𝐹
2		dfdm4 4889	. . . . . . 7 ⊢ dom 𝐹 = ran ◡𝐹
3		fof 5520	. . . . . . . 8 ⊢ (𝐹:𝐴–onto→𝐵 → 𝐹:𝐴⟶𝐵)
4		fdm 5451	. . . . . . . 8 ⊢ (𝐹:𝐴⟶𝐵 → dom 𝐹 = 𝐴)
5	3, 4	syl 14	. . . . . . 7 ⊢ (𝐹:𝐴–onto→𝐵 → dom 𝐹 = 𝐴)
6	2, 5	eqtr3id 2254	. . . . . 6 ⊢ (𝐹:𝐴–onto→𝐵 → ran ◡𝐹 = 𝐴)
7	1, 6	sseqtrid 3251	. . . . 5 ⊢ (𝐹:𝐴–onto→𝐵 → (◡𝐹 “ 𝑎) ⊆ 𝐴)
8	7	adantl 277	. . . 4 ⊢ ((𝐹 ∈ V ∧ 𝐹:𝐴–onto→𝐵) → (◡𝐹 “ 𝑎) ⊆ 𝐴)
9		cnvexg 5239	. . . . . 6 ⊢ (𝐹 ∈ V → ◡𝐹 ∈ V)
10	9	adantr 276	. . . . 5 ⊢ ((𝐹 ∈ V ∧ 𝐹:𝐴–onto→𝐵) → ◡𝐹 ∈ V)
11		imaexg 5055	. . . . 5 ⊢ (◡𝐹 ∈ V → (◡𝐹 “ 𝑎) ∈ V)
12		elpwg 3634	. . . . 5 ⊢ ((◡𝐹 “ 𝑎) ∈ V → ((◡𝐹 “ 𝑎) ∈ 𝒫 𝐴 ↔ (◡𝐹 “ 𝑎) ⊆ 𝐴))
13	10, 11, 12	3syl 17	. . . 4 ⊢ ((𝐹 ∈ V ∧ 𝐹:𝐴–onto→𝐵) → ((◡𝐹 “ 𝑎) ∈ 𝒫 𝐴 ↔ (◡𝐹 “ 𝑎) ⊆ 𝐴))
14	8, 13	mpbird 167	. . 3 ⊢ ((𝐹 ∈ V ∧ 𝐹:𝐴–onto→𝐵) → (◡𝐹 “ 𝑎) ∈ 𝒫 𝐴)
15	14	a1d 22	. 2 ⊢ ((𝐹 ∈ V ∧ 𝐹:𝐴–onto→𝐵) → (𝑎 ∈ 𝒫 𝐵 → (◡𝐹 “ 𝑎) ∈ 𝒫 𝐴))
16		imaeq2 5037	. . . . . . 7 ⊢ ((◡𝐹 “ 𝑎) = (◡𝐹 “ 𝑏) → (𝐹 “ (◡𝐹 “ 𝑎)) = (𝐹 “ (◡𝐹 “ 𝑏)))
17	16	adantl 277	. . . . . 6 ⊢ ((((𝐹 ∈ V ∧ 𝐹:𝐴–onto→𝐵) ∧ (𝑎 ∈ 𝒫 𝐵 ∧ 𝑏 ∈ 𝒫 𝐵)) ∧ (◡𝐹 “ 𝑎) = (◡𝐹 “ 𝑏)) → (𝐹 “ (◡𝐹 “ 𝑎)) = (𝐹 “ (◡𝐹 “ 𝑏)))
18		simpllr 534	. . . . . . 7 ⊢ ((((𝐹 ∈ V ∧ 𝐹:𝐴–onto→𝐵) ∧ (𝑎 ∈ 𝒫 𝐵 ∧ 𝑏 ∈ 𝒫 𝐵)) ∧ (◡𝐹 “ 𝑎) = (◡𝐹 “ 𝑏)) → 𝐹:𝐴–onto→𝐵)
19		simplrl 535	. . . . . . . 8 ⊢ ((((𝐹 ∈ V ∧ 𝐹:𝐴–onto→𝐵) ∧ (𝑎 ∈ 𝒫 𝐵 ∧ 𝑏 ∈ 𝒫 𝐵)) ∧ (◡𝐹 “ 𝑎) = (◡𝐹 “ 𝑏)) → 𝑎 ∈ 𝒫 𝐵)
20	19	elpwid 3637	. . . . . . 7 ⊢ ((((𝐹 ∈ V ∧ 𝐹:𝐴–onto→𝐵) ∧ (𝑎 ∈ 𝒫 𝐵 ∧ 𝑏 ∈ 𝒫 𝐵)) ∧ (◡𝐹 “ 𝑎) = (◡𝐹 “ 𝑏)) → 𝑎 ⊆ 𝐵)
21		foimacnv 5562	. . . . . . 7 ⊢ ((𝐹:𝐴–onto→𝐵 ∧ 𝑎 ⊆ 𝐵) → (𝐹 “ (◡𝐹 “ 𝑎)) = 𝑎)
22	18, 20, 21	syl2anc 411	. . . . . 6 ⊢ ((((𝐹 ∈ V ∧ 𝐹:𝐴–onto→𝐵) ∧ (𝑎 ∈ 𝒫 𝐵 ∧ 𝑏 ∈ 𝒫 𝐵)) ∧ (◡𝐹 “ 𝑎) = (◡𝐹 “ 𝑏)) → (𝐹 “ (◡𝐹 “ 𝑎)) = 𝑎)
23		simplrr 536	. . . . . . . 8 ⊢ ((((𝐹 ∈ V ∧ 𝐹:𝐴–onto→𝐵) ∧ (𝑎 ∈ 𝒫 𝐵 ∧ 𝑏 ∈ 𝒫 𝐵)) ∧ (◡𝐹 “ 𝑎) = (◡𝐹 “ 𝑏)) → 𝑏 ∈ 𝒫 𝐵)
24	23	elpwid 3637	. . . . . . 7 ⊢ ((((𝐹 ∈ V ∧ 𝐹:𝐴–onto→𝐵) ∧ (𝑎 ∈ 𝒫 𝐵 ∧ 𝑏 ∈ 𝒫 𝐵)) ∧ (◡𝐹 “ 𝑎) = (◡𝐹 “ 𝑏)) → 𝑏 ⊆ 𝐵)
25		foimacnv 5562	. . . . . . 7 ⊢ ((𝐹:𝐴–onto→𝐵 ∧ 𝑏 ⊆ 𝐵) → (𝐹 “ (◡𝐹 “ 𝑏)) = 𝑏)
26	18, 24, 25	syl2anc 411	. . . . . 6 ⊢ ((((𝐹 ∈ V ∧ 𝐹:𝐴–onto→𝐵) ∧ (𝑎 ∈ 𝒫 𝐵 ∧ 𝑏 ∈ 𝒫 𝐵)) ∧ (◡𝐹 “ 𝑎) = (◡𝐹 “ 𝑏)) → (𝐹 “ (◡𝐹 “ 𝑏)) = 𝑏)
27	17, 22, 26	3eqtr3d 2248	. . . . 5 ⊢ ((((𝐹 ∈ V ∧ 𝐹:𝐴–onto→𝐵) ∧ (𝑎 ∈ 𝒫 𝐵 ∧ 𝑏 ∈ 𝒫 𝐵)) ∧ (◡𝐹 “ 𝑎) = (◡𝐹 “ 𝑏)) → 𝑎 = 𝑏)
28	27	ex 115	. . . 4 ⊢ (((𝐹 ∈ V ∧ 𝐹:𝐴–onto→𝐵) ∧ (𝑎 ∈ 𝒫 𝐵 ∧ 𝑏 ∈ 𝒫 𝐵)) → ((◡𝐹 “ 𝑎) = (◡𝐹 “ 𝑏) → 𝑎 = 𝑏))
29		imaeq2 5037	. . . 4 ⊢ (𝑎 = 𝑏 → (◡𝐹 “ 𝑎) = (◡𝐹 “ 𝑏))
30	28, 29	impbid1 142	. . 3 ⊢ (((𝐹 ∈ V ∧ 𝐹:𝐴–onto→𝐵) ∧ (𝑎 ∈ 𝒫 𝐵 ∧ 𝑏 ∈ 𝒫 𝐵)) → ((◡𝐹 “ 𝑎) = (◡𝐹 “ 𝑏) ↔ 𝑎 = 𝑏))
31	30	ex 115	. 2 ⊢ ((𝐹 ∈ V ∧ 𝐹:𝐴–onto→𝐵) → ((𝑎 ∈ 𝒫 𝐵 ∧ 𝑏 ∈ 𝒫 𝐵) → ((◡𝐹 “ 𝑎) = (◡𝐹 “ 𝑏) ↔ 𝑎 = 𝑏)))
32		rnexg 4962	. . . . 5 ⊢ (𝐹 ∈ V → ran 𝐹 ∈ V)
33		forn 5523	. . . . . 6 ⊢ (𝐹:𝐴–onto→𝐵 → ran 𝐹 = 𝐵)
34	33	eleq1d 2276	. . . . 5 ⊢ (𝐹:𝐴–onto→𝐵 → (ran 𝐹 ∈ V ↔ 𝐵 ∈ V))
35	32, 34	syl5ibcom 155	. . . 4 ⊢ (𝐹 ∈ V → (𝐹:𝐴–onto→𝐵 → 𝐵 ∈ V))
36	35	imp 124	. . 3 ⊢ ((𝐹 ∈ V ∧ 𝐹:𝐴–onto→𝐵) → 𝐵 ∈ V)
37		pwexg 4240	. . 3 ⊢ (𝐵 ∈ V → 𝒫 𝐵 ∈ V)
38	36, 37	syl 14	. 2 ⊢ ((𝐹 ∈ V ∧ 𝐹:𝐴–onto→𝐵) → 𝒫 𝐵 ∈ V)
39		dmfex 5487	. . . 4 ⊢ ((𝐹 ∈ V ∧ 𝐹:𝐴⟶𝐵) → 𝐴 ∈ V)
40	3, 39	sylan2 286	. . 3 ⊢ ((𝐹 ∈ V ∧ 𝐹:𝐴–onto→𝐵) → 𝐴 ∈ V)
41		pwexg 4240	. . 3 ⊢ (𝐴 ∈ V → 𝒫 𝐴 ∈ V)
42	40, 41	syl 14	. 2 ⊢ ((𝐹 ∈ V ∧ 𝐹:𝐴–onto→𝐵) → 𝒫 𝐴 ∈ V)
43	15, 31, 38, 42	dom3d 6888	1 ⊢ ((𝐹 ∈ V ∧ 𝐹:𝐴–onto→𝐵) → 𝒫 𝐵 ≼ 𝒫 𝐴)

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1373   ∈ wcel 2178  Vcvv 2776   ⊆ wss 3174  𝒫 cpw 3626   class class class wbr 4059  ^◡ccnv 4692  dom cdm 4693  ran crn 4694   “ cima 4696  ⟶wf 5286  –onto→wfo 5288   ≼ cdom 6849

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2180  ax-14 2181  ax-ext 2189  ax-sep 4178  ax-pow 4234  ax-pr 4269  ax-un 4498

This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ral 2491  df-rex 2492  df-rab 2495  df-v 2778  df-sbc 3006  df-csb 3102  df-un 3178  df-in 3180  df-ss 3187  df-pw 3628  df-sn 3649  df-pr 3650  df-op 3652  df-uni 3865  df-br 4060  df-opab 4122  df-mpt 4123  df-id 4358  df-xp 4699  df-rel 4700  df-cnv 4701  df-co 4702  df-dm 4703  df-rn 4704  df-res 4705  df-ima 4706  df-iota 5251  df-fun 5292  df-fn 5293  df-f 5294  df-f1 5295  df-fo 5296  df-fv 5298  df-dom 6852

This theorem is referenced by: (None)