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

Theorem gchina 10597
Description: Assuming the GCH, weakly and strongly inaccessible cardinals coincide. Theorem 11.20 of [TakeutiZaring] p. 106. (Contributed by Mario Carneiro, 5-Jun-2015.)
Assertion
Ref Expression
gchina (GCH = V → Inaccw = Inacc)

Proof of Theorem gchina
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simpr 484 . . . . 5 ((GCH = V ∧ 𝑥 ∈ Inaccw) → 𝑥 ∈ Inaccw)
2 idd 24 . . . . . . 7 ((GCH = V ∧ 𝑥 ∈ Inaccw) → (𝑥 ≠ ∅ → 𝑥 ≠ ∅))
3 idd 24 . . . . . . 7 ((GCH = V ∧ 𝑥 ∈ Inaccw) → ((cf‘𝑥) = 𝑥 → (cf‘𝑥) = 𝑥))
4 pwfi 9210 . . . . . . . . . . . . 13 (𝑦 ∈ Fin ↔ 𝒫 𝑦 ∈ Fin)
5 isfinite 9549 . . . . . . . . . . . . . 14 (𝒫 𝑦 ∈ Fin ↔ 𝒫 𝑦 ≺ ω)
6 winainf 10592 . . . . . . . . . . . . . . . 16 (𝑥 ∈ Inaccw → ω ⊆ 𝑥)
7 ssdomg 8929 . . . . . . . . . . . . . . . 16 (𝑥 ∈ Inaccw → (ω ⊆ 𝑥 → ω ≼ 𝑥))
86, 7mpd 15 . . . . . . . . . . . . . . 15 (𝑥 ∈ Inaccw → ω ≼ 𝑥)
9 sdomdomtr 9030 . . . . . . . . . . . . . . . 16 ((𝒫 𝑦 ≺ ω ∧ ω ≼ 𝑥) → 𝒫 𝑦𝑥)
109expcom 413 . . . . . . . . . . . . . . 15 (ω ≼ 𝑥 → (𝒫 𝑦 ≺ ω → 𝒫 𝑦𝑥))
118, 10syl 17 . . . . . . . . . . . . . 14 (𝑥 ∈ Inaccw → (𝒫 𝑦 ≺ ω → 𝒫 𝑦𝑥))
125, 11biimtrid 242 . . . . . . . . . . . . 13 (𝑥 ∈ Inaccw → (𝒫 𝑦 ∈ Fin → 𝒫 𝑦𝑥))
134, 12biimtrid 242 . . . . . . . . . . . 12 (𝑥 ∈ Inaccw → (𝑦 ∈ Fin → 𝒫 𝑦𝑥))
1413ad3antlr 731 . . . . . . . . . . 11 ((((GCH = V ∧ 𝑥 ∈ Inaccw) ∧ 𝑦𝑥) ∧ 𝑧𝑥) → (𝑦 ∈ Fin → 𝒫 𝑦𝑥))
1514a1dd 50 . . . . . . . . . 10 ((((GCH = V ∧ 𝑥 ∈ Inaccw) ∧ 𝑦𝑥) ∧ 𝑧𝑥) → (𝑦 ∈ Fin → (𝑦𝑧 → 𝒫 𝑦𝑥)))
16 vex 3441 . . . . . . . . . . . . . . 15 𝑦 ∈ V
17 simplll 774 . . . . . . . . . . . . . . 15 ((((GCH = V ∧ 𝑥 ∈ Inaccw) ∧ 𝑦𝑥) ∧ (𝑧𝑥 ∧ ¬ 𝑦 ∈ Fin)) → GCH = V)
1816, 17eleqtrrid 2840 . . . . . . . . . . . . . 14 ((((GCH = V ∧ 𝑥 ∈ Inaccw) ∧ 𝑦𝑥) ∧ (𝑧𝑥 ∧ ¬ 𝑦 ∈ Fin)) → 𝑦 ∈ GCH)
19 simprr 772 . . . . . . . . . . . . . 14 ((((GCH = V ∧ 𝑥 ∈ Inaccw) ∧ 𝑦𝑥) ∧ (𝑧𝑥 ∧ ¬ 𝑦 ∈ Fin)) → ¬ 𝑦 ∈ Fin)
20 gchinf 10555 . . . . . . . . . . . . . 14 ((𝑦 ∈ GCH ∧ ¬ 𝑦 ∈ Fin) → ω ≼ 𝑦)
2118, 19, 20syl2anc 584 . . . . . . . . . . . . 13 ((((GCH = V ∧ 𝑥 ∈ Inaccw) ∧ 𝑦𝑥) ∧ (𝑧𝑥 ∧ ¬ 𝑦 ∈ Fin)) → ω ≼ 𝑦)
22 vex 3441 . . . . . . . . . . . . . 14 𝑧 ∈ V
2322, 17eleqtrrid 2840 . . . . . . . . . . . . 13 ((((GCH = V ∧ 𝑥 ∈ Inaccw) ∧ 𝑦𝑥) ∧ (𝑧𝑥 ∧ ¬ 𝑦 ∈ Fin)) → 𝑧 ∈ GCH)
24 gchpwdom 10568 . . . . . . . . . . . . 13 ((ω ≼ 𝑦𝑦 ∈ GCH ∧ 𝑧 ∈ GCH) → (𝑦𝑧 ↔ 𝒫 𝑦𝑧))
2521, 18, 23, 24syl3anc 1373 . . . . . . . . . . . 12 ((((GCH = V ∧ 𝑥 ∈ Inaccw) ∧ 𝑦𝑥) ∧ (𝑧𝑥 ∧ ¬ 𝑦 ∈ Fin)) → (𝑦𝑧 ↔ 𝒫 𝑦𝑧))
26 winacard 10590 . . . . . . . . . . . . . . . . 17 (𝑥 ∈ Inaccw → (card‘𝑥) = 𝑥)
27 iscard 9875 . . . . . . . . . . . . . . . . . 18 ((card‘𝑥) = 𝑥 ↔ (𝑥 ∈ On ∧ ∀𝑧𝑥 𝑧𝑥))
2827simprbi 496 . . . . . . . . . . . . . . . . 17 ((card‘𝑥) = 𝑥 → ∀𝑧𝑥 𝑧𝑥)
2926, 28syl 17 . . . . . . . . . . . . . . . 16 (𝑥 ∈ Inaccw → ∀𝑧𝑥 𝑧𝑥)
3029ad2antlr 727 . . . . . . . . . . . . . . 15 (((GCH = V ∧ 𝑥 ∈ Inaccw) ∧ 𝑦𝑥) → ∀𝑧𝑥 𝑧𝑥)
3130r19.21bi 3225 . . . . . . . . . . . . . 14 ((((GCH = V ∧ 𝑥 ∈ Inaccw) ∧ 𝑦𝑥) ∧ 𝑧𝑥) → 𝑧𝑥)
32 domsdomtr 9032 . . . . . . . . . . . . . . 15 ((𝒫 𝑦𝑧𝑧𝑥) → 𝒫 𝑦𝑥)
3332expcom 413 . . . . . . . . . . . . . 14 (𝑧𝑥 → (𝒫 𝑦𝑧 → 𝒫 𝑦𝑥))
3431, 33syl 17 . . . . . . . . . . . . 13 ((((GCH = V ∧ 𝑥 ∈ Inaccw) ∧ 𝑦𝑥) ∧ 𝑧𝑥) → (𝒫 𝑦𝑧 → 𝒫 𝑦𝑥))
3534adantrr 717 . . . . . . . . . . . 12 ((((GCH = V ∧ 𝑥 ∈ Inaccw) ∧ 𝑦𝑥) ∧ (𝑧𝑥 ∧ ¬ 𝑦 ∈ Fin)) → (𝒫 𝑦𝑧 → 𝒫 𝑦𝑥))
3625, 35sylbid 240 . . . . . . . . . . 11 ((((GCH = V ∧ 𝑥 ∈ Inaccw) ∧ 𝑦𝑥) ∧ (𝑧𝑥 ∧ ¬ 𝑦 ∈ Fin)) → (𝑦𝑧 → 𝒫 𝑦𝑥))
3736expr 456 . . . . . . . . . 10 ((((GCH = V ∧ 𝑥 ∈ Inaccw) ∧ 𝑦𝑥) ∧ 𝑧𝑥) → (¬ 𝑦 ∈ Fin → (𝑦𝑧 → 𝒫 𝑦𝑥)))
3815, 37pm2.61d 179 . . . . . . . . 9 ((((GCH = V ∧ 𝑥 ∈ Inaccw) ∧ 𝑦𝑥) ∧ 𝑧𝑥) → (𝑦𝑧 → 𝒫 𝑦𝑥))
3938rexlimdva 3134 . . . . . . . 8 (((GCH = V ∧ 𝑥 ∈ Inaccw) ∧ 𝑦𝑥) → (∃𝑧𝑥 𝑦𝑧 → 𝒫 𝑦𝑥))
4039ralimdva 3145 . . . . . . 7 ((GCH = V ∧ 𝑥 ∈ Inaccw) → (∀𝑦𝑥𝑧𝑥 𝑦𝑧 → ∀𝑦𝑥 𝒫 𝑦𝑥))
412, 3, 403anim123d 1445 . . . . . 6 ((GCH = V ∧ 𝑥 ∈ Inaccw) → ((𝑥 ≠ ∅ ∧ (cf‘𝑥) = 𝑥 ∧ ∀𝑦𝑥𝑧𝑥 𝑦𝑧) → (𝑥 ≠ ∅ ∧ (cf‘𝑥) = 𝑥 ∧ ∀𝑦𝑥 𝒫 𝑦𝑥)))
42 elwina 10584 . . . . . 6 (𝑥 ∈ Inaccw ↔ (𝑥 ≠ ∅ ∧ (cf‘𝑥) = 𝑥 ∧ ∀𝑦𝑥𝑧𝑥 𝑦𝑧))
43 elina 10585 . . . . . 6 (𝑥 ∈ Inacc ↔ (𝑥 ≠ ∅ ∧ (cf‘𝑥) = 𝑥 ∧ ∀𝑦𝑥 𝒫 𝑦𝑥))
4441, 42, 433imtr4g 296 . . . . 5 ((GCH = V ∧ 𝑥 ∈ Inaccw) → (𝑥 ∈ Inaccw𝑥 ∈ Inacc))
451, 44mpd 15 . . . 4 ((GCH = V ∧ 𝑥 ∈ Inaccw) → 𝑥 ∈ Inacc)
4645ex 412 . . 3 (GCH = V → (𝑥 ∈ Inaccw𝑥 ∈ Inacc))
47 inawina 10588 . . 3 (𝑥 ∈ Inacc → 𝑥 ∈ Inaccw)
4846, 47impbid1 225 . 2 (GCH = V → (𝑥 ∈ Inaccw𝑥 ∈ Inacc))
4948eqrdv 2731 1 (GCH = V → Inaccw = Inacc)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395  w3a 1086   = wceq 1541  wcel 2113  wne 2929  wral 3048  wrex 3057  Vcvv 3437  wss 3898  c0 4282  𝒫 cpw 4549   class class class wbr 5093  Oncon0 6311  cfv 6486  ωcom 7802  cdom 8873  csdm 8874  Fincfn 8875  cardccrd 9835  cfccf 9837  GCHcgch 10518  Inaccwcwina 10580  Inacccina 10581
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2705  ax-rep 5219  ax-sep 5236  ax-nul 5246  ax-pow 5305  ax-pr 5372  ax-un 7674  ax-inf2 9538
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2725  df-clel 2808  df-nfc 2882  df-ne 2930  df-ral 3049  df-rex 3058  df-rmo 3347  df-reu 3348  df-rab 3397  df-v 3439  df-sbc 3738  df-csb 3847  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-pss 3918  df-nul 4283  df-if 4475  df-pw 4551  df-sn 4576  df-pr 4578  df-tp 4580  df-op 4582  df-uni 4859  df-int 4898  df-iun 4943  df-br 5094  df-opab 5156  df-mpt 5175  df-tr 5201  df-id 5514  df-eprel 5519  df-po 5527  df-so 5528  df-fr 5572  df-se 5573  df-we 5574  df-xp 5625  df-rel 5626  df-cnv 5627  df-co 5628  df-dm 5629  df-rn 5630  df-res 5631  df-ima 5632  df-pred 6253  df-ord 6314  df-on 6315  df-lim 6316  df-suc 6317  df-iota 6442  df-fun 6488  df-fn 6489  df-f 6490  df-f1 6491  df-fo 6492  df-f1o 6493  df-fv 6494  df-isom 6495  df-riota 7309  df-ov 7355  df-oprab 7356  df-mpo 7357  df-om 7803  df-1st 7927  df-2nd 7928  df-supp 8097  df-frecs 8217  df-wrecs 8248  df-recs 8297  df-rdg 8335  df-seqom 8373  df-1o 8391  df-2o 8392  df-oadd 8395  df-omul 8396  df-oexp 8397  df-er 8628  df-map 8758  df-en 8876  df-dom 8877  df-sdom 8878  df-fin 8879  df-fsupp 9253  df-oi 9403  df-har 9450  df-wdom 9458  df-cnf 9559  df-dju 9801  df-card 9839  df-cf 9841  df-fin4 10185  df-gch 10519  df-wina 10582  df-ina 10583
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator