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

Theorem hargch 10089
Description: If 𝐴 + ≈ 𝒫 𝐴, then 𝐴 is a GCH-set. The much simpler converse to gchhar 10095. (Contributed by Mario Carneiro, 2-Jun-2015.)
Assertion
Ref Expression
hargch ((har‘𝐴) ≈ 𝒫 𝐴𝐴 ∈ GCH)

Proof of Theorem hargch
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 harcl 9019 . . . . . . . . . . . . . 14 (har‘𝐴) ∈ On
2 sdomdom 8531 . . . . . . . . . . . . . 14 (𝑥 ≺ (har‘𝐴) → 𝑥 ≼ (har‘𝐴))
3 ondomen 9457 . . . . . . . . . . . . . 14 (((har‘𝐴) ∈ On ∧ 𝑥 ≼ (har‘𝐴)) → 𝑥 ∈ dom card)
41, 2, 3sylancr 589 . . . . . . . . . . . . 13 (𝑥 ≺ (har‘𝐴) → 𝑥 ∈ dom card)
5 onenon 9372 . . . . . . . . . . . . . 14 ((har‘𝐴) ∈ On → (har‘𝐴) ∈ dom card)
61, 5ax-mp 5 . . . . . . . . . . . . 13 (har‘𝐴) ∈ dom card
7 cardsdom2 9411 . . . . . . . . . . . . 13 ((𝑥 ∈ dom card ∧ (har‘𝐴) ∈ dom card) → ((card‘𝑥) ∈ (card‘(har‘𝐴)) ↔ 𝑥 ≺ (har‘𝐴)))
84, 6, 7sylancl 588 . . . . . . . . . . . 12 (𝑥 ≺ (har‘𝐴) → ((card‘𝑥) ∈ (card‘(har‘𝐴)) ↔ 𝑥 ≺ (har‘𝐴)))
98ibir 270 . . . . . . . . . . 11 (𝑥 ≺ (har‘𝐴) → (card‘𝑥) ∈ (card‘(har‘𝐴)))
10 harcard 9401 . . . . . . . . . . 11 (card‘(har‘𝐴)) = (har‘𝐴)
119, 10eleqtrdi 2923 . . . . . . . . . 10 (𝑥 ≺ (har‘𝐴) → (card‘𝑥) ∈ (har‘𝐴))
12 elharval 9021 . . . . . . . . . . 11 ((card‘𝑥) ∈ (har‘𝐴) ↔ ((card‘𝑥) ∈ On ∧ (card‘𝑥) ≼ 𝐴))
1312simprbi 499 . . . . . . . . . 10 ((card‘𝑥) ∈ (har‘𝐴) → (card‘𝑥) ≼ 𝐴)
1411, 13syl 17 . . . . . . . . 9 (𝑥 ≺ (har‘𝐴) → (card‘𝑥) ≼ 𝐴)
15 cardid2 9376 . . . . . . . . . 10 (𝑥 ∈ dom card → (card‘𝑥) ≈ 𝑥)
16 domen1 8653 . . . . . . . . . 10 ((card‘𝑥) ≈ 𝑥 → ((card‘𝑥) ≼ 𝐴𝑥𝐴))
174, 15, 163syl 18 . . . . . . . . 9 (𝑥 ≺ (har‘𝐴) → ((card‘𝑥) ≼ 𝐴𝑥𝐴))
1814, 17mpbid 234 . . . . . . . 8 (𝑥 ≺ (har‘𝐴) → 𝑥𝐴)
19 domnsym 8637 . . . . . . . 8 (𝑥𝐴 → ¬ 𝐴𝑥)
2018, 19syl 17 . . . . . . 7 (𝑥 ≺ (har‘𝐴) → ¬ 𝐴𝑥)
2120con2i 141 . . . . . 6 (𝐴𝑥 → ¬ 𝑥 ≺ (har‘𝐴))
22 sdomen2 8656 . . . . . . 7 ((har‘𝐴) ≈ 𝒫 𝐴 → (𝑥 ≺ (har‘𝐴) ↔ 𝑥 ≺ 𝒫 𝐴))
2322notbid 320 . . . . . 6 ((har‘𝐴) ≈ 𝒫 𝐴 → (¬ 𝑥 ≺ (har‘𝐴) ↔ ¬ 𝑥 ≺ 𝒫 𝐴))
2421, 23syl5ib 246 . . . . 5 ((har‘𝐴) ≈ 𝒫 𝐴 → (𝐴𝑥 → ¬ 𝑥 ≺ 𝒫 𝐴))
25 imnan 402 . . . . 5 ((𝐴𝑥 → ¬ 𝑥 ≺ 𝒫 𝐴) ↔ ¬ (𝐴𝑥𝑥 ≺ 𝒫 𝐴))
2624, 25sylib 220 . . . 4 ((har‘𝐴) ≈ 𝒫 𝐴 → ¬ (𝐴𝑥𝑥 ≺ 𝒫 𝐴))
2726alrimiv 1924 . . 3 ((har‘𝐴) ≈ 𝒫 𝐴 → ∀𝑥 ¬ (𝐴𝑥𝑥 ≺ 𝒫 𝐴))
2827olcd 870 . 2 ((har‘𝐴) ≈ 𝒫 𝐴 → (𝐴 ∈ Fin ∨ ∀𝑥 ¬ (𝐴𝑥𝑥 ≺ 𝒫 𝐴)))
29 relen 8508 . . . . 5 Rel ≈
3029brrelex2i 5603 . . . 4 ((har‘𝐴) ≈ 𝒫 𝐴 → 𝒫 𝐴 ∈ V)
31 pwexb 7482 . . . 4 (𝐴 ∈ V ↔ 𝒫 𝐴 ∈ V)
3230, 31sylibr 236 . . 3 ((har‘𝐴) ≈ 𝒫 𝐴𝐴 ∈ V)
33 elgch 10038 . . 3 (𝐴 ∈ V → (𝐴 ∈ GCH ↔ (𝐴 ∈ Fin ∨ ∀𝑥 ¬ (𝐴𝑥𝑥 ≺ 𝒫 𝐴))))
3432, 33syl 17 . 2 ((har‘𝐴) ≈ 𝒫 𝐴 → (𝐴 ∈ GCH ↔ (𝐴 ∈ Fin ∨ ∀𝑥 ¬ (𝐴𝑥𝑥 ≺ 𝒫 𝐴))))
3528, 34mpbird 259 1 ((har‘𝐴) ≈ 𝒫 𝐴𝐴 ∈ GCH)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 208  wa 398  wo 843  wal 1531  wcel 2110  Vcvv 3494  𝒫 cpw 4538   class class class wbr 5058  dom cdm 5549  Oncon0 6185  cfv 6349  cen 8500  cdom 8501  csdm 8502  Fincfn 8503  harchar 9014  cardccrd 9358  GCHcgch 10036
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793  ax-rep 5182  ax-sep 5195  ax-nul 5202  ax-pow 5258  ax-pr 5321  ax-un 7455
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-reu 3145  df-rmo 3146  df-rab 3147  df-v 3496  df-sbc 3772  df-csb 3883  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-pss 3953  df-nul 4291  df-if 4467  df-pw 4540  df-sn 4561  df-pr 4563  df-tp 4565  df-op 4567  df-uni 4832  df-int 4869  df-iun 4913  df-br 5059  df-opab 5121  df-mpt 5139  df-tr 5165  df-id 5454  df-eprel 5459  df-po 5468  df-so 5469  df-fr 5508  df-se 5509  df-we 5510  df-xp 5555  df-rel 5556  df-cnv 5557  df-co 5558  df-dm 5559  df-rn 5560  df-res 5561  df-ima 5562  df-pred 6142  df-ord 6188  df-on 6189  df-lim 6190  df-suc 6191  df-iota 6308  df-fun 6351  df-fn 6352  df-f 6353  df-f1 6354  df-fo 6355  df-f1o 6356  df-fv 6357  df-isom 6358  df-riota 7108  df-wrecs 7941  df-recs 8002  df-er 8283  df-en 8504  df-dom 8505  df-sdom 8506  df-oi 8968  df-har 9016  df-card 9362  df-gch 10037
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator