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

Theorem gchina 10610
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 9219 . . . . . . . . . . . . 13 (𝑦 ∈ Fin ↔ 𝒫 𝑦 ∈ Fin)
5 isfinite 9561 . . . . . . . . . . . . . 14 (𝒫 𝑦 ∈ Fin ↔ 𝒫 𝑦 ≺ ω)
6 winainf 10605 . . . . . . . . . . . . . . . 16 (𝑥 ∈ Inaccw → ω ⊆ 𝑥)
7 ssdomg 8937 . . . . . . . . . . . . . . . 16 (𝑥 ∈ Inaccw → (ω ⊆ 𝑥 → ω ≼ 𝑥))
86, 7mpd 15 . . . . . . . . . . . . . . 15 (𝑥 ∈ Inaccw → ω ≼ 𝑥)
9 sdomdomtr 9038 . . . . . . . . . . . . . . . 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 3444 . . . . . . . . . . . . . . 15 𝑦 ∈ V
17 simplll 774 . . . . . . . . . . . . . . 15 ((((GCH = V ∧ 𝑥 ∈ Inaccw) ∧ 𝑦𝑥) ∧ (𝑧𝑥 ∧ ¬ 𝑦 ∈ Fin)) → GCH = V)
1816, 17eleqtrrid 2843 . . . . . . . . . . . . . 14 ((((GCH = V ∧ 𝑥 ∈ Inaccw) ∧ 𝑦𝑥) ∧ (𝑧𝑥 ∧ ¬ 𝑦 ∈ Fin)) → 𝑦 ∈ GCH)
19 simprr 772 . . . . . . . . . . . . . 14 ((((GCH = V ∧ 𝑥 ∈ Inaccw) ∧ 𝑦𝑥) ∧ (𝑧𝑥 ∧ ¬ 𝑦 ∈ Fin)) → ¬ 𝑦 ∈ Fin)
20 gchinf 10568 . . . . . . . . . . . . . 14 ((𝑦 ∈ GCH ∧ ¬ 𝑦 ∈ Fin) → ω ≼ 𝑦)
2118, 19, 20syl2anc 584 . . . . . . . . . . . . 13 ((((GCH = V ∧ 𝑥 ∈ Inaccw) ∧ 𝑦𝑥) ∧ (𝑧𝑥 ∧ ¬ 𝑦 ∈ Fin)) → ω ≼ 𝑦)
22 vex 3444 . . . . . . . . . . . . . 14 𝑧 ∈ V
2322, 17eleqtrrid 2843 . . . . . . . . . . . . 13 ((((GCH = V ∧ 𝑥 ∈ Inaccw) ∧ 𝑦𝑥) ∧ (𝑧𝑥 ∧ ¬ 𝑦 ∈ Fin)) → 𝑧 ∈ GCH)
24 gchpwdom 10581 . . . . . . . . . . . . 13 ((ω ≼ 𝑦𝑦 ∈ GCH ∧ 𝑧 ∈ GCH) → (𝑦𝑧 ↔ 𝒫 𝑦𝑧))
2521, 18, 23, 24syl3anc 1373 . . . . . . . . . . . 12 ((((GCH = V ∧ 𝑥 ∈ Inaccw) ∧ 𝑦𝑥) ∧ (𝑧𝑥 ∧ ¬ 𝑦 ∈ Fin)) → (𝑦𝑧 ↔ 𝒫 𝑦𝑧))
26 winacard 10603 . . . . . . . . . . . . . . . . 17 (𝑥 ∈ Inaccw → (card‘𝑥) = 𝑥)
27 iscard 9887 . . . . . . . . . . . . . . . . . 18 ((card‘𝑥) = 𝑥 ↔ (𝑥 ∈ On ∧ ∀𝑧𝑥 𝑧𝑥))
2827simprbi 496 . . . . . . . . . . . . . . . . 17 ((card‘𝑥) = 𝑥 → ∀𝑧𝑥 𝑧𝑥)
2926, 28syl 17 . . . . . . . . . . . . . . . 16 (𝑥 ∈ Inaccw → ∀𝑧𝑥 𝑧𝑥)
3029ad2antlr 727 . . . . . . . . . . . . . . 15 (((GCH = V ∧ 𝑥 ∈ Inaccw) ∧ 𝑦𝑥) → ∀𝑧𝑥 𝑧𝑥)
3130r19.21bi 3228 . . . . . . . . . . . . . 14 ((((GCH = V ∧ 𝑥 ∈ Inaccw) ∧ 𝑦𝑥) ∧ 𝑧𝑥) → 𝑧𝑥)
32 domsdomtr 9040 . . . . . . . . . . . . . . 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 3137 . . . . . . . 8 (((GCH = V ∧ 𝑥 ∈ Inaccw) ∧ 𝑦𝑥) → (∃𝑧𝑥 𝑦𝑧 → 𝒫 𝑦𝑥))
4039ralimdva 3148 . . . . . . 7 ((GCH = V ∧ 𝑥 ∈ Inaccw) → (∀𝑦𝑥𝑧𝑥 𝑦𝑧 → ∀𝑦𝑥 𝒫 𝑦𝑥))
412, 3, 403anim123d 1445 . . . . . 6 ((GCH = V ∧ 𝑥 ∈ Inaccw) → ((𝑥 ≠ ∅ ∧ (cf‘𝑥) = 𝑥 ∧ ∀𝑦𝑥𝑧𝑥 𝑦𝑧) → (𝑥 ≠ ∅ ∧ (cf‘𝑥) = 𝑥 ∧ ∀𝑦𝑥 𝒫 𝑦𝑥)))
42 elwina 10597 . . . . . 6 (𝑥 ∈ Inaccw ↔ (𝑥 ≠ ∅ ∧ (cf‘𝑥) = 𝑥 ∧ ∀𝑦𝑥𝑧𝑥 𝑦𝑧))
43 elina 10598 . . . . . 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 10601 . . 3 (𝑥 ∈ Inacc → 𝑥 ∈ Inaccw)
4846, 47impbid1 225 . 2 (GCH = V → (𝑥 ∈ Inaccw𝑥 ∈ Inacc))
4948eqrdv 2734 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 2932  wral 3051  wrex 3060  Vcvv 3440  wss 3901  c0 4285  𝒫 cpw 4554   class class class wbr 5098  Oncon0 6317  cfv 6492  ωcom 7808  cdom 8881  csdm 8882  Fincfn 8883  cardccrd 9847  cfccf 9849  GCHcgch 10531  Inaccwcwina 10593  Inacccina 10594
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 2184  ax-ext 2708  ax-rep 5224  ax-sep 5241  ax-nul 5251  ax-pow 5310  ax-pr 5377  ax-un 7680  ax-inf2 9550
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 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-rmo 3350  df-reu 3351  df-rab 3400  df-v 3442  df-sbc 3741  df-csb 3850  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-pss 3921  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4581  df-pr 4583  df-tp 4585  df-op 4587  df-uni 4864  df-int 4903  df-iun 4948  df-br 5099  df-opab 5161  df-mpt 5180  df-tr 5206  df-id 5519  df-eprel 5524  df-po 5532  df-so 5533  df-fr 5577  df-se 5578  df-we 5579  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-pred 6259  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-isom 6501  df-riota 7315  df-ov 7361  df-oprab 7362  df-mpo 7363  df-om 7809  df-1st 7933  df-2nd 7934  df-supp 8103  df-frecs 8223  df-wrecs 8254  df-recs 8303  df-rdg 8341  df-seqom 8379  df-1o 8397  df-2o 8398  df-oadd 8401  df-omul 8402  df-oexp 8403  df-er 8635  df-map 8765  df-en 8884  df-dom 8885  df-sdom 8886  df-fin 8887  df-fsupp 9265  df-oi 9415  df-har 9462  df-wdom 9470  df-cnf 9571  df-dju 9813  df-card 9851  df-cf 9853  df-fin4 10197  df-gch 10532  df-wina 10595  df-ina 10596
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator