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

Theorem gchi 10547
Description: The only GCH-sets which have other sets between it and its power set are finite sets. (Contributed by Mario Carneiro, 15-May-2015.)
Assertion
Ref Expression
gchi ((𝐴 ∈ GCH ∧ 𝐴𝐵𝐵 ≺ 𝒫 𝐴) → 𝐴 ∈ Fin)

Proof of Theorem gchi
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 relsdom 8902 . . . . . . 7 Rel ≺
21brrelex1i 5688 . . . . . 6 (𝐵 ≺ 𝒫 𝐴𝐵 ∈ V)
32adantl 481 . . . . 5 ((𝐴𝐵𝐵 ≺ 𝒫 𝐴) → 𝐵 ∈ V)
4 breq2 5104 . . . . . . 7 (𝑥 = 𝐵 → (𝐴𝑥𝐴𝐵))
5 breq1 5103 . . . . . . 7 (𝑥 = 𝐵 → (𝑥 ≺ 𝒫 𝐴𝐵 ≺ 𝒫 𝐴))
64, 5anbi12d 633 . . . . . 6 (𝑥 = 𝐵 → ((𝐴𝑥𝑥 ≺ 𝒫 𝐴) ↔ (𝐴𝐵𝐵 ≺ 𝒫 𝐴)))
76spcegv 3553 . . . . 5 (𝐵 ∈ V → ((𝐴𝐵𝐵 ≺ 𝒫 𝐴) → ∃𝑥(𝐴𝑥𝑥 ≺ 𝒫 𝐴)))
83, 7mpcom 38 . . . 4 ((𝐴𝐵𝐵 ≺ 𝒫 𝐴) → ∃𝑥(𝐴𝑥𝑥 ≺ 𝒫 𝐴))
9 df-ex 1782 . . . 4 (∃𝑥(𝐴𝑥𝑥 ≺ 𝒫 𝐴) ↔ ¬ ∀𝑥 ¬ (𝐴𝑥𝑥 ≺ 𝒫 𝐴))
108, 9sylib 218 . . 3 ((𝐴𝐵𝐵 ≺ 𝒫 𝐴) → ¬ ∀𝑥 ¬ (𝐴𝑥𝑥 ≺ 𝒫 𝐴))
11 elgch 10545 . . . . . 6 (𝐴 ∈ GCH → (𝐴 ∈ GCH ↔ (𝐴 ∈ Fin ∨ ∀𝑥 ¬ (𝐴𝑥𝑥 ≺ 𝒫 𝐴))))
1211ibi 267 . . . . 5 (𝐴 ∈ GCH → (𝐴 ∈ Fin ∨ ∀𝑥 ¬ (𝐴𝑥𝑥 ≺ 𝒫 𝐴)))
1312orcomd 872 . . . 4 (𝐴 ∈ GCH → (∀𝑥 ¬ (𝐴𝑥𝑥 ≺ 𝒫 𝐴) ∨ 𝐴 ∈ Fin))
1413ord 865 . . 3 (𝐴 ∈ GCH → (¬ ∀𝑥 ¬ (𝐴𝑥𝑥 ≺ 𝒫 𝐴) → 𝐴 ∈ Fin))
1510, 14syl5 34 . 2 (𝐴 ∈ GCH → ((𝐴𝐵𝐵 ≺ 𝒫 𝐴) → 𝐴 ∈ Fin))
16153impib 1117 1 ((𝐴 ∈ GCH ∧ 𝐴𝐵𝐵 ≺ 𝒫 𝐴) → 𝐴 ∈ Fin)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 395  wo 848  w3a 1087  wal 1540   = wceq 1542  wex 1781  wcel 2114  Vcvv 3442  𝒫 cpw 4556   class class class wbr 5100  csdm 8894  Fincfn 8895  GCHcgch 10543
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2709  ax-sep 5243  ax-pr 5379
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-br 5101  df-opab 5163  df-xp 5638  df-rel 5639  df-dom 8897  df-sdom 8898  df-gch 10544
This theorem is referenced by:  gchen1  10548  gchen2  10549  gchpwdom  10593  gchaleph  10594
  Copyright terms: Public domain W3C validator