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

Theorem dfac12k 10119
Description: Equivalence of dfac12 10121 and dfac12a 10120, 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 10041 . . . 4 (ℵ‘𝑦) ∈ On
2 pweq 4572 . . . . . 6 (𝑥 = (ℵ‘𝑦) → 𝒫 𝑥 = 𝒫 (ℵ‘𝑦))
32eleq1d 2850 . . . . 5 (𝑥 = (ℵ‘𝑦) → (𝒫 𝑥 ∈ dom card ↔ 𝒫 (ℵ‘𝑦) ∈ dom card))
43rspcv 3580 . . . 4 ((ℵ‘𝑦) ∈ On → (∀𝑥 ∈ On 𝒫 𝑥 ∈ dom card → 𝒫 (ℵ‘𝑦) ∈ dom card))
51, 4ax-mp 5 . . 3 (∀𝑥 ∈ On 𝒫 𝑥 ∈ dom card → 𝒫 (ℵ‘𝑦) ∈ dom card)
65ralrimivw 3161 . 2 (∀𝑥 ∈ On 𝒫 𝑥 ∈ dom card → ∀𝑦 ∈ On 𝒫 (ℵ‘𝑦) ∈ dom card)
7 omelon 9603 . . . . . . 7 ω ∈ On
8 cardon 9918 . . . . . . 7 (card‘𝑥) ∈ On
9 ontri1 6384 . . . . . . 7 ((ω ∈ On ∧ (card‘𝑥) ∈ On) → (ω ⊆ (card‘𝑥) ↔ ¬ (card‘𝑥) ∈ ω))
107, 8, 9mp2an 704 . . . . . 6 (ω ⊆ (card‘𝑥) ↔ ¬ (card‘𝑥) ∈ ω)
11 cardidm 9933 . . . . . . . 8 (card‘(card‘𝑥)) = (card‘𝑥)
12 cardalephex 10062 . . . . . . . 8 (ω ⊆ (card‘𝑥) → ((card‘(card‘𝑥)) = (card‘𝑥) ↔ ∃𝑦 ∈ On (card‘𝑥) = (ℵ‘𝑦)))
1311, 12mpbii 236 . . . . . . 7 (ω ⊆ (card‘𝑥) → ∃𝑦 ∈ On (card‘𝑥) = (ℵ‘𝑦))
14 r19.29 3128 . . . . . . . . 9 ((∀𝑦 ∈ On 𝒫 (ℵ‘𝑦) ∈ dom card ∧ ∃𝑦 ∈ On (card‘𝑥) = (ℵ‘𝑦)) → ∃𝑦 ∈ On (𝒫 (ℵ‘𝑦) ∈ dom card ∧ (card‘𝑥) = (ℵ‘𝑦)))
15 pweq 4572 . . . . . . . . . . . 12 ((card‘𝑥) = (ℵ‘𝑦) → 𝒫 (card‘𝑥) = 𝒫 (ℵ‘𝑦))
1615eleq1d 2850 . . . . . . . . . . 11 ((card‘𝑥) = (ℵ‘𝑦) → (𝒫 (card‘𝑥) ∈ dom card ↔ 𝒫 (ℵ‘𝑦) ∈ dom card))
1716biimparc 484 . . . . . . . . . 10 ((𝒫 (ℵ‘𝑦) ∈ dom card ∧ (card‘𝑥) = (ℵ‘𝑦)) → 𝒫 (card‘𝑥) ∈ dom card)
1817rexlimivw 3162 . . . . . . . . 9 (∃𝑦 ∈ On (𝒫 (ℵ‘𝑦) ∈ dom card ∧ (card‘𝑥) = (ℵ‘𝑦)) → 𝒫 (card‘𝑥) ∈ dom card)
1914, 18syl 18 . . . . . . . 8 ((∀𝑦 ∈ On 𝒫 (ℵ‘𝑦) ∈ dom card ∧ ∃𝑦 ∈ On (card‘𝑥) = (ℵ‘𝑦)) → 𝒫 (card‘𝑥) ∈ dom card)
2019ex 417 . . . . . . 7 (∀𝑦 ∈ On 𝒫 (ℵ‘𝑦) ∈ dom card → (∃𝑦 ∈ On (card‘𝑥) = (ℵ‘𝑦) → 𝒫 (card‘𝑥) ∈ dom card))
2113, 20syl5 35 . . . . . 6 (∀𝑦 ∈ On 𝒫 (ℵ‘𝑦) ∈ dom card → (ω ⊆ (card‘𝑥) → 𝒫 (card‘𝑥) ∈ dom card))
2210, 21biimtrrid 246 . . . . 5 (∀𝑦 ∈ On 𝒫 (ℵ‘𝑦) ∈ dom card → (¬ (card‘𝑥) ∈ ω → 𝒫 (card‘𝑥) ∈ dom card))
23 nnfi 9140 . . . . . . 7 ((card‘𝑥) ∈ ω → (card‘𝑥) ∈ Fin)
24 pwfi 9266 . . . . . . 7 ((card‘𝑥) ∈ Fin ↔ 𝒫 (card‘𝑥) ∈ Fin)
2523, 24sylib 221 . . . . . 6 ((card‘𝑥) ∈ ω → 𝒫 (card‘𝑥) ∈ Fin)
26 finnum 9922 . . . . . 6 (𝒫 (card‘𝑥) ∈ Fin → 𝒫 (card‘𝑥) ∈ dom card)
2725, 26syl 18 . . . . 5 ((card‘𝑥) ∈ ω → 𝒫 (card‘𝑥) ∈ dom card)
2822, 27pm2.61d2 183 . . . 4 (∀𝑦 ∈ On 𝒫 (ℵ‘𝑦) ∈ dom card → 𝒫 (card‘𝑥) ∈ dom card)
29 oncardid 9930 . . . . 5 (𝑥 ∈ On → (card‘𝑥) ≈ 𝑥)
30 pwen 9126 . . . . 5 ((card‘𝑥) ≈ 𝑥 → 𝒫 (card‘𝑥) ≈ 𝒫 𝑥)
31 ennum 9921 . . . . 5 (𝒫 (card‘𝑥) ≈ 𝒫 𝑥 → (𝒫 (card‘𝑥) ∈ dom card ↔ 𝒫 𝑥 ∈ dom card))
3229, 30, 313syl 19 . . . 4 (𝑥 ∈ On → (𝒫 (card‘𝑥) ∈ dom card ↔ 𝒫 𝑥 ∈ dom card))
3328, 32syl5ibcom 248 . . 3 (∀𝑦 ∈ On 𝒫 (ℵ‘𝑦) ∈ dom card → (𝑥 ∈ On → 𝒫 𝑥 ∈ dom card))
3433ralrimiv 3156 . 2 (∀𝑦 ∈ On 𝒫 (ℵ‘𝑦) ∈ dom card → ∀𝑥 ∈ On 𝒫 𝑥 ∈ dom card)
356, 34impbii 212 1 (∀𝑥 ∈ On 𝒫 𝑥 ∈ dom card ↔ ∀𝑦 ∈ On 𝒫 (ℵ‘𝑦) ∈ dom card)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 209  wa 400   = wceq 1563  wcel 2145  wral 3079  wrex 3089  wss 3907  𝒫 cpw 4558   class class class wbr 5104  dom cdm 5651  Oncon0 6349  cfv 6525  ωcom 7850  cen 8928  Fincfn 8931  cardccrd 9909  cale 9910
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2737  ax-rep 5231  ax-sep 5250  ax-nul 5260  ax-pow 5326  ax-pr 5394  ax-un 7722  ax-inf2 9598
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-nf 1807  df-sb 2094  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3080  df-rex 3090  df-rmo 3370  df-reu 3371  df-rab 3418  df-v 3459  df-sbc 3748  df-csb 3856  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-pss 3927  df-nul 4289  df-if 4484  df-pw 4560  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4868  df-int 4908  df-iun 4953  df-br 5105  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-se 5605  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6291  df-ord 6352  df-on 6353  df-lim 6354  df-suc 6355  df-iota 6481  df-fun 6527  df-fn 6528  df-f 6529  df-f1 6530  df-fo 6531  df-f1o 6532  df-fv 6533  df-isom 6534  df-riota 7357  df-ov 7403  df-oprab 7404  df-mpo 7405  df-om 7851  df-1st 7974  df-2nd 7975  df-frecs 8266  df-wrecs 8297  df-recs 8346  df-rdg 8385  df-1o 8441  df-2o 8442  df-er 8682  df-map 8814  df-en 8932  df-dom 8933  df-sdom 8934  df-fin 8935  df-oi 9460  df-har 9507  df-card 9913  df-aleph 9914
This theorem is referenced by:  dfac12  10121
  Copyright terms: Public domain W3C validator