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

Theorem dfac12k 10147
Description: Equivalence of dfac12 10149 and dfac12a 10148, 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 10069 . . . 4 (ℵ‘𝑦) ∈ On
2 pweq 4578 . . . . . 6 (𝑥 = (ℵ‘𝑦) → 𝒫 𝑥 = 𝒫 (ℵ‘𝑦))
32eleq1d 2850 . . . . 5 (𝑥 = (ℵ‘𝑦) → (𝒫 𝑥 ∈ dom card ↔ 𝒫 (ℵ‘𝑦) ∈ dom card))
43rspcv 3579 . . . 4 ((ℵ‘𝑦) ∈ On → (∀𝑥 ∈ On 𝒫 𝑥 ∈ dom card → 𝒫 (ℵ‘𝑦) ∈ dom card))
51, 4ax-mp 5 . . 3 (∀𝑥 ∈ On 𝒫 𝑥 ∈ dom card → 𝒫 (ℵ‘𝑦) ∈ dom card)
65ralrimivw 3163 . 2 (∀𝑥 ∈ On 𝒫 𝑥 ∈ dom card → ∀𝑦 ∈ On 𝒫 (ℵ‘𝑦) ∈ dom card)
7 omelon 9622 . . . . . . 7 ω ∈ On
8 cardon 9946 . . . . . . 7 (card‘𝑥) ∈ On
9 ontri1 6399 . . . . . . 7 ((ω ∈ On ∧ (card‘𝑥) ∈ On) → (ω ⊆ (card‘𝑥) ↔ ¬ (card‘𝑥) ∈ ω))
107, 8, 9mp2an 705 . . . . . 6 (ω ⊆ (card‘𝑥) ↔ ¬ (card‘𝑥) ∈ ω)
11 cardidm 9961 . . . . . . . 8 (card‘(card‘𝑥)) = (card‘𝑥)
12 cardalephex 10090 . . . . . . . 8 (ω ⊆ (card‘𝑥) → ((card‘(card‘𝑥)) = (card‘𝑥) ↔ ∃𝑦 ∈ On (card‘𝑥) = (ℵ‘𝑦)))
1311, 12mpbii 236 . . . . . . 7 (ω ⊆ (card‘𝑥) → ∃𝑦 ∈ On (card‘𝑥) = (ℵ‘𝑦))
14 r19.29 3130 . . . . . . . . 9 ((∀𝑦 ∈ On 𝒫 (ℵ‘𝑦) ∈ dom card ∧ ∃𝑦 ∈ On (card‘𝑥) = (ℵ‘𝑦)) → ∃𝑦 ∈ On (𝒫 (ℵ‘𝑦) ∈ dom card ∧ (card‘𝑥) = (ℵ‘𝑦)))
15 pweq 4578 . . . . . . . . . . . 12 ((card‘𝑥) = (ℵ‘𝑦) → 𝒫 (card‘𝑥) = 𝒫 (ℵ‘𝑦))
1615eleq1d 2850 . . . . . . . . . . 11 ((card‘𝑥) = (ℵ‘𝑦) → (𝒫 (card‘𝑥) ∈ dom card ↔ 𝒫 (ℵ‘𝑦) ∈ dom card))
1716biimparc 485 . . . . . . . . . 10 ((𝒫 (ℵ‘𝑦) ∈ dom card ∧ (card‘𝑥) = (ℵ‘𝑦)) → 𝒫 (card‘𝑥) ∈ dom card)
1817rexlimivw 3164 . . . . . . . . 9 (∃𝑦 ∈ On (𝒫 (ℵ‘𝑦) ∈ dom card ∧ (card‘𝑥) = (ℵ‘𝑦)) → 𝒫 (card‘𝑥) ∈ dom card)
1914, 18syl 18 . . . . . . . 8 ((∀𝑦 ∈ On 𝒫 (ℵ‘𝑦) ∈ dom card ∧ ∃𝑦 ∈ On (card‘𝑥) = (ℵ‘𝑦)) → 𝒫 (card‘𝑥) ∈ dom card)
2019ex 418 . . . . . . 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 9159 . . . . . . 7 ((card‘𝑥) ∈ ω → (card‘𝑥) ∈ Fin)
24 pwfi 9285 . . . . . . 7 ((card‘𝑥) ∈ Fin ↔ 𝒫 (card‘𝑥) ∈ Fin)
2523, 24sylib 221 . . . . . 6 ((card‘𝑥) ∈ ω → 𝒫 (card‘𝑥) ∈ Fin)
26 finnum 9950 . . . . . 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 9958 . . . . 5 (𝑥 ∈ On → (card‘𝑥) ≈ 𝑥)
30 pwen 9145 . . . . 5 ((card‘𝑥) ≈ 𝑥 → 𝒫 (card‘𝑥) ≈ 𝒫 𝑥)
31 ennum 9949 . . . . 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 3158 . 2 (∀𝑦 ∈ On 𝒫 (ℵ‘𝑦) ∈ dom card → ∀𝑥 ∈ On 𝒫 𝑥 ∈ dom card)
356, 34impbii 212 1 (∀𝑥 ∈ On 𝒫 𝑥 ∈ dom card ↔ ∀𝑦 ∈ On 𝒫 (ℵ‘𝑦) ∈ dom card)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wi 4  wb 209  wa 401   = wceq 1570  wcel 2146  wral 3081  wrex 3091  wss 3906  𝒫 cpw 4564   class class class wbr 5111  dom cdm 5663  Oncon0 6364  cfv 6540  ωcom 7868  cen 8946  Fincfn 8949  cardccrd 9937  cale 9938
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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7742  ax-inf2 9617
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-rmo 3371  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-int 4915  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-tr 5221  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-se 5617  df-we 5618  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-pred 6306  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-isom 6549  df-riota 7376  df-ov 7422  df-oprab 7423  df-mpo 7424  df-om 7869  df-1st 7992  df-2nd 7993  df-frecs 8284  df-wrecs 8315  df-recs 8364  df-rdg 8403  df-1o 8459  df-2o 8460  df-er 8700  df-map 8832  df-en 8950  df-dom 8951  df-sdom 8952  df-fin 8953  df-oi 9479  df-har 9526  df-card 9941  df-aleph 9942
This theorem is used by:  dfac12  10149
  Copyright terms: Public domain W3C validator