Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  dfac12k Structured version   Visualization version   GIF version

Theorem dfac12k 8929
 Description: Equivalence of dfac12 8931 and dfac12a 8930, without using Regularity. (Contributed by Mario Carneiro, 21-May-2015.)
Assertion
Ref Expression
dfac12k (∀𝑥 ∈ On 𝒫 𝑥 ∈ dom card ↔ ∀𝑦 ∈ On 𝒫 (ℵ‘𝑦) ∈ dom card)
Distinct variable group:   𝑥,𝑦

Proof of Theorem dfac12k
StepHypRef Expression
1 alephon 8852 . . . 4 (ℵ‘𝑦) ∈ On
2 pweq 4139 . . . . . 6 (𝑥 = (ℵ‘𝑦) → 𝒫 𝑥 = 𝒫 (ℵ‘𝑦))
32eleq1d 2683 . . . . 5 (𝑥 = (ℵ‘𝑦) → (𝒫 𝑥 ∈ dom card ↔ 𝒫 (ℵ‘𝑦) ∈ dom card))
43rspcv 3295 . . . 4 ((ℵ‘𝑦) ∈ On → (∀𝑥 ∈ On 𝒫 𝑥 ∈ dom card → 𝒫 (ℵ‘𝑦) ∈ dom card))
51, 4ax-mp 5 . . 3 (∀𝑥 ∈ On 𝒫 𝑥 ∈ dom card → 𝒫 (ℵ‘𝑦) ∈ dom card)
65ralrimivw 2963 . 2 (∀𝑥 ∈ On 𝒫 𝑥 ∈ dom card → ∀𝑦 ∈ On 𝒫 (ℵ‘𝑦) ∈ dom card)
7 omelon 8503 . . . . . . 7 ω ∈ On
8 cardon 8730 . . . . . . 7 (card‘𝑥) ∈ On
9 ontri1 5726 . . . . . . 7 ((ω ∈ On ∧ (card‘𝑥) ∈ On) → (ω ⊆ (card‘𝑥) ↔ ¬ (card‘𝑥) ∈ ω))
107, 8, 9mp2an 707 . . . . . 6 (ω ⊆ (card‘𝑥) ↔ ¬ (card‘𝑥) ∈ ω)
11 cardidm 8745 . . . . . . . 8 (card‘(card‘𝑥)) = (card‘𝑥)
12 cardalephex 8873 . . . . . . . 8 (ω ⊆ (card‘𝑥) → ((card‘(card‘𝑥)) = (card‘𝑥) ↔ ∃𝑦 ∈ On (card‘𝑥) = (ℵ‘𝑦)))
1311, 12mpbii 223 . . . . . . 7 (ω ⊆ (card‘𝑥) → ∃𝑦 ∈ On (card‘𝑥) = (ℵ‘𝑦))
14 r19.29 3067 . . . . . . . . 9 ((∀𝑦 ∈ On 𝒫 (ℵ‘𝑦) ∈ dom card ∧ ∃𝑦 ∈ On (card‘𝑥) = (ℵ‘𝑦)) → ∃𝑦 ∈ On (𝒫 (ℵ‘𝑦) ∈ dom card ∧ (card‘𝑥) = (ℵ‘𝑦)))
15 pweq 4139 . . . . . . . . . . . 12 ((card‘𝑥) = (ℵ‘𝑦) → 𝒫 (card‘𝑥) = 𝒫 (ℵ‘𝑦))
1615eleq1d 2683 . . . . . . . . . . 11 ((card‘𝑥) = (ℵ‘𝑦) → (𝒫 (card‘𝑥) ∈ dom card ↔ 𝒫 (ℵ‘𝑦) ∈ dom card))
1716biimparc 504 . . . . . . . . . 10 ((𝒫 (ℵ‘𝑦) ∈ dom card ∧ (card‘𝑥) = (ℵ‘𝑦)) → 𝒫 (card‘𝑥) ∈ dom card)
1817rexlimivw 3024 . . . . . . . . 9 (∃𝑦 ∈ On (𝒫 (ℵ‘𝑦) ∈ dom card ∧ (card‘𝑥) = (ℵ‘𝑦)) → 𝒫 (card‘𝑥) ∈ dom card)
1914, 18syl 17 . . . . . . . 8 ((∀𝑦 ∈ On 𝒫 (ℵ‘𝑦) ∈ dom card ∧ ∃𝑦 ∈ On (card‘𝑥) = (ℵ‘𝑦)) → 𝒫 (card‘𝑥) ∈ dom card)
2019ex 450 . . . . . . 7 (∀𝑦 ∈ On 𝒫 (ℵ‘𝑦) ∈ dom card → (∃𝑦 ∈ On (card‘𝑥) = (ℵ‘𝑦) → 𝒫 (card‘𝑥) ∈ dom card))
2113, 20syl5 34 . . . . . 6 (∀𝑦 ∈ On 𝒫 (ℵ‘𝑦) ∈ dom card → (ω ⊆ (card‘𝑥) → 𝒫 (card‘𝑥) ∈ dom card))
2210, 21syl5bir 233 . . . . 5 (∀𝑦 ∈ On 𝒫 (ℵ‘𝑦) ∈ dom card → (¬ (card‘𝑥) ∈ ω → 𝒫 (card‘𝑥) ∈ dom card))
23 nnfi 8113 . . . . . . 7 ((card‘𝑥) ∈ ω → (card‘𝑥) ∈ Fin)
24 pwfi 8221 . . . . . . 7 ((card‘𝑥) ∈ Fin ↔ 𝒫 (card‘𝑥) ∈ Fin)
2523, 24sylib 208 . . . . . 6 ((card‘𝑥) ∈ ω → 𝒫 (card‘𝑥) ∈ Fin)
26 finnum 8734 . . . . . 6 (𝒫 (card‘𝑥) ∈ Fin → 𝒫 (card‘𝑥) ∈ dom card)
2725, 26syl 17 . . . . 5 ((card‘𝑥) ∈ ω → 𝒫 (card‘𝑥) ∈ dom card)
2822, 27pm2.61d2 172 . . . 4 (∀𝑦 ∈ On 𝒫 (ℵ‘𝑦) ∈ dom card → 𝒫 (card‘𝑥) ∈ dom card)
29 oncardid 8742 . . . . 5 (𝑥 ∈ On → (card‘𝑥) ≈ 𝑥)
30 pwen 8093 . . . . 5 ((card‘𝑥) ≈ 𝑥 → 𝒫 (card‘𝑥) ≈ 𝒫 𝑥)
31 ennum 8733 . . . . 5 (𝒫 (card‘𝑥) ≈ 𝒫 𝑥 → (𝒫 (card‘𝑥) ∈ dom card ↔ 𝒫 𝑥 ∈ dom card))
3229, 30, 313syl 18 . . . 4 (𝑥 ∈ On → (𝒫 (card‘𝑥) ∈ dom card ↔ 𝒫 𝑥 ∈ dom card))
3328, 32syl5ibcom 235 . . 3 (∀𝑦 ∈ On 𝒫 (ℵ‘𝑦) ∈ dom card → (𝑥 ∈ On → 𝒫 𝑥 ∈ dom card))
3433ralrimiv 2961 . 2 (∀𝑦 ∈ On 𝒫 (ℵ‘𝑦) ∈ dom card → ∀𝑥 ∈ On 𝒫 𝑥 ∈ dom card)
356, 34impbii 199 1 (∀𝑥 ∈ On 𝒫 𝑥 ∈ dom card ↔ ∀𝑦 ∈ On 𝒫 (ℵ‘𝑦) ∈ dom card)
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 196   ∧ wa 384   = wceq 1480   ∈ wcel 1987  ∀wral 2908  ∃wrex 2909   ⊆ wss 3560  𝒫 cpw 4136   class class class wbr 4623  dom cdm 5084  Oncon0 5692  ‘cfv 5857  ωcom 7027   ≈ cen 7912  Fincfn 7915  cardccrd 8721  ℵcale 8722 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-8 1989  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601  ax-rep 4741  ax-sep 4751  ax-nul 4759  ax-pow 4813  ax-pr 4877  ax-un 6914  ax-inf2 8498 This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1037  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-eu 2473  df-mo 2474  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-ne 2791  df-ral 2913  df-rex 2914  df-reu 2915  df-rmo 2916  df-rab 2917  df-v 3192  df-sbc 3423  df-csb 3520  df-dif 3563  df-un 3565  df-in 3567  df-ss 3574  df-pss 3576  df-nul 3898  df-if 4065  df-pw 4138  df-sn 4156  df-pr 4158  df-tp 4160  df-op 4162  df-uni 4410  df-int 4448  df-iun 4494  df-br 4624  df-opab 4684  df-mpt 4685  df-tr 4723  df-eprel 4995  df-id 4999  df-po 5005  df-so 5006  df-fr 5043  df-se 5044  df-we 5045  df-xp 5090  df-rel 5091  df-cnv 5092  df-co 5093  df-dm 5094  df-rn 5095  df-res 5096  df-ima 5097  df-pred 5649  df-ord 5695  df-on 5696  df-lim 5697  df-suc 5698  df-iota 5820  df-fun 5859  df-fn 5860  df-f 5861  df-f1 5862  df-fo 5863  df-f1o 5864  df-fv 5865  df-isom 5866  df-riota 6576  df-ov 6618  df-oprab 6619  df-mpt2 6620  df-om 7028  df-1st 7128  df-2nd 7129  df-wrecs 7367  df-recs 7428  df-rdg 7466  df-1o 7520  df-2o 7521  df-oadd 7524  df-er 7702  df-map 7819  df-en 7916  df-dom 7917  df-sdom 7918  df-fin 7919  df-oi 8375  df-har 8423  df-card 8725  df-aleph 8726 This theorem is referenced by:  dfac12  8931
 Copyright terms: Public domain W3C validator