Theorem fineqvlem 9264

Description: Lemma for fineqv 9265. (Contributed by Mario Carneiro, 20-Jan-2013.) (Proof shortened by Stefan O'Rear, 3-Nov-2014.) (Revised by Mario Carneiro, 17-May-2015.)

Assertion

Ref	Expression
fineqvlem	⊢ ((𝐴 ∈ 𝑉 ∧ ¬ 𝐴 ∈ Fin) → ω ≼ 𝒫 𝒫 𝐴)

Proof of Theorem fineqvlem

Dummy variables 𝑏 𝑐 𝑑 𝑒 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		pwexg 5376	. . . 4 ⊢ (𝐴 ∈ 𝑉 → 𝒫 𝐴 ∈ V)
2	1	adantr 481	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ ¬ 𝐴 ∈ Fin) → 𝒫 𝐴 ∈ V)
3	2	pwexd 5377	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ ¬ 𝐴 ∈ Fin) → 𝒫 𝒫 𝐴 ∈ V)
4		ssrab2 4077	. . . . 5 ⊢ {𝑑 ∈ 𝒫 𝐴 ∣ 𝑑 ≈ 𝑏} ⊆ 𝒫 𝐴
5		elpw2g 5344	. . . . . 6 ⊢ (𝒫 𝐴 ∈ V → ({𝑑 ∈ 𝒫 𝐴 ∣ 𝑑 ≈ 𝑏} ∈ 𝒫 𝒫 𝐴 ↔ {𝑑 ∈ 𝒫 𝐴 ∣ 𝑑 ≈ 𝑏} ⊆ 𝒫 𝐴))
6	2, 5	syl 17	. . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ ¬ 𝐴 ∈ Fin) → ({𝑑 ∈ 𝒫 𝐴 ∣ 𝑑 ≈ 𝑏} ∈ 𝒫 𝒫 𝐴 ↔ {𝑑 ∈ 𝒫 𝐴 ∣ 𝑑 ≈ 𝑏} ⊆ 𝒫 𝐴))
7	4, 6	mpbiri 257	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ ¬ 𝐴 ∈ Fin) → {𝑑 ∈ 𝒫 𝐴 ∣ 𝑑 ≈ 𝑏} ∈ 𝒫 𝒫 𝐴)
8	7	a1d 25	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ ¬ 𝐴 ∈ Fin) → (𝑏 ∈ ω → {𝑑 ∈ 𝒫 𝐴 ∣ 𝑑 ≈ 𝑏} ∈ 𝒫 𝒫 𝐴))
9		isinf 9262	. . . . . . . . 9 ⊢ (¬ 𝐴 ∈ Fin → ∀𝑏 ∈ ω ∃𝑒(𝑒 ⊆ 𝐴 ∧ 𝑒 ≈ 𝑏))
10	9	r19.21bi 3248	. . . . . . . 8 ⊢ ((¬ 𝐴 ∈ Fin ∧ 𝑏 ∈ ω) → ∃𝑒(𝑒 ⊆ 𝐴 ∧ 𝑒 ≈ 𝑏))
11	10	ad2ant2lr 746	. . . . . . 7 ⊢ (((𝐴 ∈ 𝑉 ∧ ¬ 𝐴 ∈ Fin) ∧ (𝑏 ∈ ω ∧ 𝑐 ∈ ω)) → ∃𝑒(𝑒 ⊆ 𝐴 ∧ 𝑒 ≈ 𝑏))
12		velpw 4607	. . . . . . . . . . 11 ⊢ (𝑒 ∈ 𝒫 𝐴 ↔ 𝑒 ⊆ 𝐴)
13	12	biimpri 227	. . . . . . . . . 10 ⊢ (𝑒 ⊆ 𝐴 → 𝑒 ∈ 𝒫 𝐴)
14	13	anim1i 615	. . . . . . . . 9 ⊢ ((𝑒 ⊆ 𝐴 ∧ 𝑒 ≈ 𝑏) → (𝑒 ∈ 𝒫 𝐴 ∧ 𝑒 ≈ 𝑏))
15		breq1 5151	. . . . . . . . . 10 ⊢ (𝑑 = 𝑒 → (𝑑 ≈ 𝑏 ↔ 𝑒 ≈ 𝑏))
16	15	elrab 3683	. . . . . . . . 9 ⊢ (𝑒 ∈ {𝑑 ∈ 𝒫 𝐴 ∣ 𝑑 ≈ 𝑏} ↔ (𝑒 ∈ 𝒫 𝐴 ∧ 𝑒 ≈ 𝑏))
17	14, 16	sylibr 233	. . . . . . . 8 ⊢ ((𝑒 ⊆ 𝐴 ∧ 𝑒 ≈ 𝑏) → 𝑒 ∈ {𝑑 ∈ 𝒫 𝐴 ∣ 𝑑 ≈ 𝑏})
18	17	eximi 1837	. . . . . . 7 ⊢ (∃𝑒(𝑒 ⊆ 𝐴 ∧ 𝑒 ≈ 𝑏) → ∃𝑒 𝑒 ∈ {𝑑 ∈ 𝒫 𝐴 ∣ 𝑑 ≈ 𝑏})
19	11, 18	syl 17	. . . . . 6 ⊢ (((𝐴 ∈ 𝑉 ∧ ¬ 𝐴 ∈ Fin) ∧ (𝑏 ∈ ω ∧ 𝑐 ∈ ω)) → ∃𝑒 𝑒 ∈ {𝑑 ∈ 𝒫 𝐴 ∣ 𝑑 ≈ 𝑏})
20		eleq2 2822	. . . . . . . . 9 ⊢ ({𝑑 ∈ 𝒫 𝐴 ∣ 𝑑 ≈ 𝑏} = {𝑑 ∈ 𝒫 𝐴 ∣ 𝑑 ≈ 𝑐} → (𝑒 ∈ {𝑑 ∈ 𝒫 𝐴 ∣ 𝑑 ≈ 𝑏} ↔ 𝑒 ∈ {𝑑 ∈ 𝒫 𝐴 ∣ 𝑑 ≈ 𝑐}))
21	20	biimpcd 248	. . . . . . . 8 ⊢ (𝑒 ∈ {𝑑 ∈ 𝒫 𝐴 ∣ 𝑑 ≈ 𝑏} → ({𝑑 ∈ 𝒫 𝐴 ∣ 𝑑 ≈ 𝑏} = {𝑑 ∈ 𝒫 𝐴 ∣ 𝑑 ≈ 𝑐} → 𝑒 ∈ {𝑑 ∈ 𝒫 𝐴 ∣ 𝑑 ≈ 𝑐}))
22	21	adantl 482	. . . . . . 7 ⊢ ((((𝐴 ∈ 𝑉 ∧ ¬ 𝐴 ∈ Fin) ∧ (𝑏 ∈ ω ∧ 𝑐 ∈ ω)) ∧ 𝑒 ∈ {𝑑 ∈ 𝒫 𝐴 ∣ 𝑑 ≈ 𝑏}) → ({𝑑 ∈ 𝒫 𝐴 ∣ 𝑑 ≈ 𝑏} = {𝑑 ∈ 𝒫 𝐴 ∣ 𝑑 ≈ 𝑐} → 𝑒 ∈ {𝑑 ∈ 𝒫 𝐴 ∣ 𝑑 ≈ 𝑐}))
23	16	simprbi 497	. . . . . . . . . 10 ⊢ (𝑒 ∈ {𝑑 ∈ 𝒫 𝐴 ∣ 𝑑 ≈ 𝑏} → 𝑒 ≈ 𝑏)
24		breq1 5151	. . . . . . . . . . . 12 ⊢ (𝑑 = 𝑒 → (𝑑 ≈ 𝑐 ↔ 𝑒 ≈ 𝑐))
25	24	elrab 3683	. . . . . . . . . . 11 ⊢ (𝑒 ∈ {𝑑 ∈ 𝒫 𝐴 ∣ 𝑑 ≈ 𝑐} ↔ (𝑒 ∈ 𝒫 𝐴 ∧ 𝑒 ≈ 𝑐))
26	25	simprbi 497	. . . . . . . . . 10 ⊢ (𝑒 ∈ {𝑑 ∈ 𝒫 𝐴 ∣ 𝑑 ≈ 𝑐} → 𝑒 ≈ 𝑐)
27		ensym 9001	. . . . . . . . . . 11 ⊢ (𝑒 ≈ 𝑏 → 𝑏 ≈ 𝑒)
28		entr 9004	. . . . . . . . . . 11 ⊢ ((𝑏 ≈ 𝑒 ∧ 𝑒 ≈ 𝑐) → 𝑏 ≈ 𝑐)
29	27, 28	sylan 580	. . . . . . . . . 10 ⊢ ((𝑒 ≈ 𝑏 ∧ 𝑒 ≈ 𝑐) → 𝑏 ≈ 𝑐)
30	23, 26, 29	syl2an 596	. . . . . . . . 9 ⊢ ((𝑒 ∈ {𝑑 ∈ 𝒫 𝐴 ∣ 𝑑 ≈ 𝑏} ∧ 𝑒 ∈ {𝑑 ∈ 𝒫 𝐴 ∣ 𝑑 ≈ 𝑐}) → 𝑏 ≈ 𝑐)
31	30	ex 413	. . . . . . . 8 ⊢ (𝑒 ∈ {𝑑 ∈ 𝒫 𝐴 ∣ 𝑑 ≈ 𝑏} → (𝑒 ∈ {𝑑 ∈ 𝒫 𝐴 ∣ 𝑑 ≈ 𝑐} → 𝑏 ≈ 𝑐))
32	31	adantl 482	. . . . . . 7 ⊢ ((((𝐴 ∈ 𝑉 ∧ ¬ 𝐴 ∈ Fin) ∧ (𝑏 ∈ ω ∧ 𝑐 ∈ ω)) ∧ 𝑒 ∈ {𝑑 ∈ 𝒫 𝐴 ∣ 𝑑 ≈ 𝑏}) → (𝑒 ∈ {𝑑 ∈ 𝒫 𝐴 ∣ 𝑑 ≈ 𝑐} → 𝑏 ≈ 𝑐))
33		nneneq 9211	. . . . . . . . 9 ⊢ ((𝑏 ∈ ω ∧ 𝑐 ∈ ω) → (𝑏 ≈ 𝑐 ↔ 𝑏 = 𝑐))
34	33	biimpd 228	. . . . . . . 8 ⊢ ((𝑏 ∈ ω ∧ 𝑐 ∈ ω) → (𝑏 ≈ 𝑐 → 𝑏 = 𝑐))
35	34	ad2antlr 725	. . . . . . 7 ⊢ ((((𝐴 ∈ 𝑉 ∧ ¬ 𝐴 ∈ Fin) ∧ (𝑏 ∈ ω ∧ 𝑐 ∈ ω)) ∧ 𝑒 ∈ {𝑑 ∈ 𝒫 𝐴 ∣ 𝑑 ≈ 𝑏}) → (𝑏 ≈ 𝑐 → 𝑏 = 𝑐))
36	22, 32, 35	3syld 60	. . . . . 6 ⊢ ((((𝐴 ∈ 𝑉 ∧ ¬ 𝐴 ∈ Fin) ∧ (𝑏 ∈ ω ∧ 𝑐 ∈ ω)) ∧ 𝑒 ∈ {𝑑 ∈ 𝒫 𝐴 ∣ 𝑑 ≈ 𝑏}) → ({𝑑 ∈ 𝒫 𝐴 ∣ 𝑑 ≈ 𝑏} = {𝑑 ∈ 𝒫 𝐴 ∣ 𝑑 ≈ 𝑐} → 𝑏 = 𝑐))
37	19, 36	exlimddv 1938	. . . . 5 ⊢ (((𝐴 ∈ 𝑉 ∧ ¬ 𝐴 ∈ Fin) ∧ (𝑏 ∈ ω ∧ 𝑐 ∈ ω)) → ({𝑑 ∈ 𝒫 𝐴 ∣ 𝑑 ≈ 𝑏} = {𝑑 ∈ 𝒫 𝐴 ∣ 𝑑 ≈ 𝑐} → 𝑏 = 𝑐))
38		breq2 5152	. . . . . 6 ⊢ (𝑏 = 𝑐 → (𝑑 ≈ 𝑏 ↔ 𝑑 ≈ 𝑐))
39	38	rabbidv 3440	. . . . 5 ⊢ (𝑏 = 𝑐 → {𝑑 ∈ 𝒫 𝐴 ∣ 𝑑 ≈ 𝑏} = {𝑑 ∈ 𝒫 𝐴 ∣ 𝑑 ≈ 𝑐})
40	37, 39	impbid1 224	. . . 4 ⊢ (((𝐴 ∈ 𝑉 ∧ ¬ 𝐴 ∈ Fin) ∧ (𝑏 ∈ ω ∧ 𝑐 ∈ ω)) → ({𝑑 ∈ 𝒫 𝐴 ∣ 𝑑 ≈ 𝑏} = {𝑑 ∈ 𝒫 𝐴 ∣ 𝑑 ≈ 𝑐} ↔ 𝑏 = 𝑐))
41	40	ex 413	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ ¬ 𝐴 ∈ Fin) → ((𝑏 ∈ ω ∧ 𝑐 ∈ ω) → ({𝑑 ∈ 𝒫 𝐴 ∣ 𝑑 ≈ 𝑏} = {𝑑 ∈ 𝒫 𝐴 ∣ 𝑑 ≈ 𝑐} ↔ 𝑏 = 𝑐)))
42	8, 41	dom2d 8991	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ ¬ 𝐴 ∈ Fin) → (𝒫 𝒫 𝐴 ∈ V → ω ≼ 𝒫 𝒫 𝐴))
43	3, 42	mpd 15	1 ⊢ ((𝐴 ∈ 𝑉 ∧ ¬ 𝐴 ∈ Fin) → ω ≼ 𝒫 𝒫 𝐴)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 396   = wceq 1541  ∃wex 1781   ∈ wcel 2106  {crab 3432  Vcvv 3474   ⊆ wss 3948  𝒫 cpw 4602   class class class wbr 5148  ωcom 7857   ≈ cen 8938   ≼ cdom 8939  Fincfn 8941

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2703  ax-rep 5285  ax-sep 5299  ax-nul 5306  ax-pow 5363  ax-pr 5427  ax-un 7727

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2534  df-eu 2563  df-clab 2710  df-cleq 2724  df-clel 2810  df-nfc 2885  df-ne 2941  df-ral 3062  df-rex 3071  df-reu 3377  df-rab 3433  df-v 3476  df-sbc 3778  df-csb 3894  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-pss 3967  df-nul 4323  df-if 4529  df-pw 4604  df-sn 4629  df-pr 4631  df-op 4635  df-uni 4909  df-iun 4999  df-br 5149  df-opab 5211  df-mpt 5232  df-tr 5266  df-id 5574  df-eprel 5580  df-po 5588  df-so 5589  df-fr 5631  df-we 5633  df-xp 5682  df-rel 5683  df-cnv 5684  df-co 5685  df-dm 5686  df-rn 5687  df-res 5688  df-ima 5689  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6495  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-om 7858  df-1o 8468  df-er 8705  df-en 8942  df-dom 8943  df-fin 8945

This theorem is referenced by:  fineqv  9265  isfin1-2  10382