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

Theorem dfac12k 10127
Description: Equivalence of dfac12 10129 and dfac12a 10128, 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 10049 . . . 4 (ℵ‘𝑦) ∈ On
2 pweq 4576 . . . . . 6 (𝑥 = (ℵ‘𝑦) → 𝒫 𝑥 = 𝒫 (ℵ‘𝑦))
32eleq1d 2848 . . . . 5 (𝑥 = (ℵ‘𝑦) → (𝒫 𝑥 ∈ dom card ↔ 𝒫 (ℵ‘𝑦) ∈ dom card))
43rspcv 3577 . . . 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 9611 . . . . . . 7 ω ∈ On
8 cardon 9926 . . . . . . 7 (card‘𝑥) ∈ On
9 ontri1 6395 . . . . . . 7 ((ω ∈ On ∧ (card‘𝑥) ∈ On) → (ω ⊆ (card‘𝑥) ↔ ¬ (card‘𝑥) ∈ ω))
107, 8, 9mp2an 704 . . . . . 6 (ω ⊆ (card‘𝑥) ↔ ¬ (card‘𝑥) ∈ ω)
11 cardidm 9941 . . . . . . . 8 (card‘(card‘𝑥)) = (card‘𝑥)
12 cardalephex 10070 . . . . . . . 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 4576 . . . . . . . . . . . 12 ((card‘𝑥) = (ℵ‘𝑦) → 𝒫 (card‘𝑥) = 𝒫 (ℵ‘𝑦))
1615eleq1d 2848 . . . . . . . . . . 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 9148 . . . . . . 7 ((card‘𝑥) ∈ ω → (card‘𝑥) ∈ Fin)
24 pwfi 9274 . . . . . . 7 ((card‘𝑥) ∈ Fin ↔ 𝒫 (card‘𝑥) ∈ Fin)
2523, 24sylib 221 . . . . . 6 ((card‘𝑥) ∈ ω → 𝒫 (card‘𝑥) ∈ Fin)
26 finnum 9930 . . . . . 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 9938 . . . . 5 (𝑥 ∈ On → (card‘𝑥) ≈ 𝑥)
30 pwen 9134 . . . . 5 ((card‘𝑥) ≈ 𝑥 → 𝒫 (card‘𝑥) ≈ 𝒫 𝑥)
31 ennum 9929 . . . . 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 1570  wcel 2143  wral 3079  wrex 3089  wss 3905  𝒫 cpw 4562   class class class wbr 5109  dom cdm 5661  Oncon0 6360  cfv 6536  ωcom 7858  cen 8936  Fincfn 8939  cardccrd 9917  cale 9918
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5238  ax-sep 5257  ax-nul 5269  ax-pow 5336  ax-pr 5404  ax-un 7732  ax-inf2 9606
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-pss 3925  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-int 4913  df-iun 4958  df-br 5110  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5556  df-eprel 5561  df-po 5569  df-so 5570  df-fr 5614  df-se 5615  df-we 5616  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-pred 6302  df-ord 6363  df-on 6364  df-lim 6365  df-suc 6366  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-isom 6545  df-riota 7367  df-ov 7413  df-oprab 7414  df-mpo 7415  df-om 7859  df-1st 7982  df-2nd 7983  df-frecs 8274  df-wrecs 8305  df-recs 8354  df-rdg 8393  df-1o 8449  df-2o 8450  df-er 8690  df-map 8822  df-en 8940  df-dom 8941  df-sdom 8942  df-fin 8943  df-oi 9468  df-har 9515  df-card 9921  df-aleph 9922
This theorem is referenced by:  dfac12  10129
  Copyright terms: Public domain W3C validator