Theorem fopwdom 9084

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

Assertion

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

Proof of Theorem fopwdom

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

Step	Hyp	Ref	Expression
1		imassrn 6067	. . . . . 6 ⊢ (◡𝐹 “ 𝑎) ⊆ ran ◡𝐹
2		dfdm4 5879	. . . . . . 7 ⊢ dom 𝐹 = ran ◡𝐹
3		fof 6790	. . . . . . . 8 ⊢ (𝐹:𝐴–onto→𝐵 → 𝐹:𝐴⟶𝐵)
4	3	fdmd 6714	. . . . . . 7 ⊢ (𝐹:𝐴–onto→𝐵 → dom 𝐹 = 𝐴)
5	2, 4	eqtr3id 2809	. . . . . 6 ⊢ (𝐹:𝐴–onto→𝐵 → ran ◡𝐹 = 𝐴)
6	1, 5	sseqtrid 3973	. . . . 5 ⊢ (𝐹:𝐴–onto→𝐵 → (◡𝐹 “ 𝑎) ⊆ 𝐴)
7	6	adantl 487	. . . 4 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝐹:𝐴–onto→𝐵) → (◡𝐹 “ 𝑎) ⊆ 𝐴)
8		cnvexg 7922	. . . . . 6 ⊢ (𝐹 ∈ 𝑉 → ◡𝐹 ∈ V)
9	8	adantr 486	. . . . 5 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝐹:𝐴–onto→𝐵) → ◡𝐹 ∈ V)
10		imaexg 7911	. . . . 5 ⊢ (◡𝐹 ∈ V → (◡𝐹 “ 𝑎) ∈ V)
11		elpwg 4560	. . . . 5 ⊢ ((◡𝐹 “ 𝑎) ∈ V → ((◡𝐹 “ 𝑎) ∈ 𝒫 𝐴 ↔ (◡𝐹 “ 𝑎) ⊆ 𝐴))
12	9, 10, 11	3syl 19	. . . 4 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝐹:𝐴–onto→𝐵) → ((◡𝐹 “ 𝑎) ∈ 𝒫 𝐴 ↔ (◡𝐹 “ 𝑎) ⊆ 𝐴))
13	7, 12	mpbird 260	. . 3 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝐹:𝐴–onto→𝐵) → (◡𝐹 “ 𝑎) ∈ 𝒫 𝐴)
14	13	a1d 26	. 2 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝐹:𝐴–onto→𝐵) → (𝑎 ∈ 𝒫 𝐵 → (◡𝐹 “ 𝑎) ∈ 𝒫 𝐴))
15		imaeq2 6052	. . . . . . 7 ⊢ ((◡𝐹 “ 𝑎) = (◡𝐹 “ 𝑏) → (𝐹 “ (◡𝐹 “ 𝑎)) = (𝐹 “ (◡𝐹 “ 𝑏)))
16	15	adantl 487	. . . . . 6 ⊢ ((((𝐹 ∈ 𝑉 ∧ 𝐹:𝐴–onto→𝐵) ∧ (𝑎 ∈ 𝒫 𝐵 ∧ 𝑏 ∈ 𝒫 𝐵)) ∧ (◡𝐹 “ 𝑎) = (◡𝐹 “ 𝑏)) → (𝐹 “ (◡𝐹 “ 𝑎)) = (𝐹 “ (◡𝐹 “ 𝑏)))
17		simpllr 788	. . . . . . 7 ⊢ ((((𝐹 ∈ 𝑉 ∧ 𝐹:𝐴–onto→𝐵) ∧ (𝑎 ∈ 𝒫 𝐵 ∧ 𝑏 ∈ 𝒫 𝐵)) ∧ (◡𝐹 “ 𝑎) = (◡𝐹 “ 𝑏)) → 𝐹:𝐴–onto→𝐵)
18		simplrl 789	. . . . . . . 8 ⊢ ((((𝐹 ∈ 𝑉 ∧ 𝐹:𝐴–onto→𝐵) ∧ (𝑎 ∈ 𝒫 𝐵 ∧ 𝑏 ∈ 𝒫 𝐵)) ∧ (◡𝐹 “ 𝑎) = (◡𝐹 “ 𝑏)) → 𝑎 ∈ 𝒫 𝐵)
19	18	elpwid 4566	. . . . . . 7 ⊢ ((((𝐹 ∈ 𝑉 ∧ 𝐹:𝐴–onto→𝐵) ∧ (𝑎 ∈ 𝒫 𝐵 ∧ 𝑏 ∈ 𝒫 𝐵)) ∧ (◡𝐹 “ 𝑎) = (◡𝐹 “ 𝑏)) → 𝑎 ⊆ 𝐵)
20		foimacnv 6836	. . . . . . 7 ⊢ ((𝐹:𝐴–onto→𝐵 ∧ 𝑎 ⊆ 𝐵) → (𝐹 “ (◡𝐹 “ 𝑎)) = 𝑎)
21	17, 19, 20	syl2anc 596	. . . . . 6 ⊢ ((((𝐹 ∈ 𝑉 ∧ 𝐹:𝐴–onto→𝐵) ∧ (𝑎 ∈ 𝒫 𝐵 ∧ 𝑏 ∈ 𝒫 𝐵)) ∧ (◡𝐹 “ 𝑎) = (◡𝐹 “ 𝑏)) → (𝐹 “ (◡𝐹 “ 𝑎)) = 𝑎)
22		simplrr 790	. . . . . . . 8 ⊢ ((((𝐹 ∈ 𝑉 ∧ 𝐹:𝐴–onto→𝐵) ∧ (𝑎 ∈ 𝒫 𝐵 ∧ 𝑏 ∈ 𝒫 𝐵)) ∧ (◡𝐹 “ 𝑎) = (◡𝐹 “ 𝑏)) → 𝑏 ∈ 𝒫 𝐵)
23	22	elpwid 4566	. . . . . . 7 ⊢ ((((𝐹 ∈ 𝑉 ∧ 𝐹:𝐴–onto→𝐵) ∧ (𝑎 ∈ 𝒫 𝐵 ∧ 𝑏 ∈ 𝒫 𝐵)) ∧ (◡𝐹 “ 𝑎) = (◡𝐹 “ 𝑏)) → 𝑏 ⊆ 𝐵)
24		foimacnv 6836	. . . . . . 7 ⊢ ((𝐹:𝐴–onto→𝐵 ∧ 𝑏 ⊆ 𝐵) → (𝐹 “ (◡𝐹 “ 𝑏)) = 𝑏)
25	17, 23, 24	syl2anc 596	. . . . . 6 ⊢ ((((𝐹 ∈ 𝑉 ∧ 𝐹:𝐴–onto→𝐵) ∧ (𝑎 ∈ 𝒫 𝐵 ∧ 𝑏 ∈ 𝒫 𝐵)) ∧ (◡𝐹 “ 𝑎) = (◡𝐹 “ 𝑏)) → (𝐹 “ (◡𝐹 “ 𝑏)) = 𝑏)
26	16, 21, 25	3eqtr3d 2803	. . . . 5 ⊢ ((((𝐹 ∈ 𝑉 ∧ 𝐹:𝐴–onto→𝐵) ∧ (𝑎 ∈ 𝒫 𝐵 ∧ 𝑏 ∈ 𝒫 𝐵)) ∧ (◡𝐹 “ 𝑎) = (◡𝐹 “ 𝑏)) → 𝑎 = 𝑏)
27	26	ex 418	. . . 4 ⊢ (((𝐹 ∈ 𝑉 ∧ 𝐹:𝐴–onto→𝐵) ∧ (𝑎 ∈ 𝒫 𝐵 ∧ 𝑏 ∈ 𝒫 𝐵)) → ((◡𝐹 “ 𝑎) = (◡𝐹 “ 𝑏) → 𝑎 = 𝑏))
28		imaeq2 6052	. . . 4 ⊢ (𝑎 = 𝑏 → (◡𝐹 “ 𝑎) = (◡𝐹 “ 𝑏))
29	27, 28	impbid1 228	. . 3 ⊢ (((𝐹 ∈ 𝑉 ∧ 𝐹:𝐴–onto→𝐵) ∧ (𝑎 ∈ 𝒫 𝐵 ∧ 𝑏 ∈ 𝒫 𝐵)) → ((◡𝐹 “ 𝑎) = (◡𝐹 “ 𝑏) ↔ 𝑎 = 𝑏))
30	29	ex 418	. 2 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝐹:𝐴–onto→𝐵) → ((𝑎 ∈ 𝒫 𝐵 ∧ 𝑏 ∈ 𝒫 𝐵) → ((◡𝐹 “ 𝑎) = (◡𝐹 “ 𝑏) ↔ 𝑎 = 𝑏)))
31		rnexg 7900	. . . . 5 ⊢ (𝐹 ∈ 𝑉 → ran 𝐹 ∈ V)
32		forn 6793	. . . . . 6 ⊢ (𝐹:𝐴–onto→𝐵 → ran 𝐹 = 𝐵)
33	32	eleq1d 2845	. . . . 5 ⊢ (𝐹:𝐴–onto→𝐵 → (ran 𝐹 ∈ V ↔ 𝐵 ∈ V))
34	31, 33	syl5ibcom 248	. . . 4 ⊢ (𝐹 ∈ 𝑉 → (𝐹:𝐴–onto→𝐵 → 𝐵 ∈ V))
35	34	imp 412	. . 3 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝐹:𝐴–onto→𝐵) → 𝐵 ∈ V)
36	35	pwexd 5344	. 2 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝐹:𝐴–onto→𝐵) → 𝒫 𝐵 ∈ V)
37		dmfex 7903	. . . 4 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝐹:𝐴⟶𝐵) → 𝐴 ∈ V)
38	3, 37	sylan2 605	. . 3 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝐹:𝐴–onto→𝐵) → 𝐴 ∈ V)
39	38	pwexd 5344	. 2 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝐹:𝐴–onto→𝐵) → 𝒫 𝐴 ∈ V)
40	14, 30, 36, 39	dom3d 9001	1 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝐹:𝐴–onto→𝐵) → 𝒫 𝐵 ≼ 𝒫 𝐴)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  Vcvv 3450   ⊆ wss 3899  𝒫 cpw 4557   class class class wbr 5103  ^◡ccnv 5654  dom cdm 5655  ran crn 5656   “ cima 5658  ⟶wf 6529  –onto→wfo 6531   ≼ cdom 8951

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7737

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-fv 6541  df-dom 8955

This theorem is used by:  pwdom  9128  wdompwdom  9551