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

Theorem gchi 10605
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 8946 . . . . . . 7 Rel ≺
21brrelex1i 5715 . . . . . 6 (𝐵 ≺ 𝒫 𝐴𝐵 ∈ V)
32adantl 486 . . . . 5 ((𝐴𝐵𝐵 ≺ 𝒫 𝐴) → 𝐵 ∈ V)
4 breq2 5114 . . . . . . 7 (𝑥 = 𝐵 → (𝐴𝑥𝐴𝐵))
5 breq1 5113 . . . . . . 7 (𝑥 = 𝐵 → (𝑥 ≺ 𝒫 𝐴𝐵 ≺ 𝒫 𝐴))
64, 5anbi12d 643 . . . . . 6 (𝑥 = 𝐵 → ((𝐴𝑥𝑥 ≺ 𝒫 𝐴) ↔ (𝐴𝐵𝐵 ≺ 𝒫 𝐴)))
76spcegv 3565 . . . . 5 (𝐵 ∈ V → ((𝐴𝐵𝐵 ≺ 𝒫 𝐴) → ∃𝑥(𝐴𝑥𝑥 ≺ 𝒫 𝐴)))
83, 7mpcom 39 . . . 4 ((𝐴𝐵𝐵 ≺ 𝒫 𝐴) → ∃𝑥(𝐴𝑥𝑥 ≺ 𝒫 𝐴))
9 df-ex 1807 . . . 4 (∃𝑥(𝐴𝑥𝑥 ≺ 𝒫 𝐴) ↔ ¬ ∀𝑥 ¬ (𝐴𝑥𝑥 ≺ 𝒫 𝐴))
108, 9sylib 221 . . 3 ((𝐴𝐵𝐵 ≺ 𝒫 𝐴) → ¬ ∀𝑥 ¬ (𝐴𝑥𝑥 ≺ 𝒫 𝐴))
11 elgch 10603 . . . . . 6 (𝐴 ∈ GCH → (𝐴 ∈ GCH ↔ (𝐴 ∈ Fin ∨ ∀𝑥 ¬ (𝐴𝑥𝑥 ≺ 𝒫 𝐴))))
1211ibi 270 . . . . 5 (𝐴 ∈ GCH → (𝐴 ∈ Fin ∨ ∀𝑥 ¬ (𝐴𝑥𝑥 ≺ 𝒫 𝐴)))
1312orcomd 884 . . . 4 (𝐴 ∈ GCH → (∀𝑥 ¬ (𝐴𝑥𝑥 ≺ 𝒫 𝐴) ∨ 𝐴 ∈ Fin))
1413ord 877 . . 3 (𝐴 ∈ GCH → (¬ ∀𝑥 ¬ (𝐴𝑥𝑥 ≺ 𝒫 𝐴) → 𝐴 ∈ Fin))
1510, 14syl5 35 . 2 (𝐴 ∈ GCH → ((𝐴𝐵𝐵 ≺ 𝒫 𝐴) → 𝐴 ∈ Fin))
16153impib 1132 1 ((𝐴 ∈ GCH ∧ 𝐴𝐵𝐵 ≺ 𝒫 𝐴) → 𝐴 ∈ Fin)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 400  wo 860  w3a 1101  wal 1565   = wceq 1567  wex 1806  wcel 2149  Vcvv 3463  𝒫 cpw 4564   class class class wbr 5110  csdm 8938  Fincfn 8939  GCHcgch 10601
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-ext 2741  ax-sep 5258  ax-pr 5402
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-sb 2098  df-clab 2748  df-cleq 2761  df-clel 2844  df-ral 3086  df-rex 3096  df-rab 3424  df-v 3465  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-br 5111  df-opab 5175  df-xp 5665  df-rel 5666  df-dom 8941  df-sdom 8942  df-gch 10602
This theorem is referenced by:  gchen1  10606  gchen2  10607  gchpwdom  10651  gchaleph  10652
  Copyright terms: Public domain W3C validator