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

Theorem gchi 10576
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 8928 . . . . . . 7 Rel ≺
21brrelex1i 5699 . . . . . 6 (𝐵 ≺ 𝒫 𝐴𝐵 ∈ V)
32adantl 485 . . . . 5 ((𝐴𝐵𝐵 ≺ 𝒫 𝐴) → 𝐵 ∈ V)
4 breq2 5101 . . . . . . 7 (𝑥 = 𝐵 → (𝐴𝑥𝐴𝐵))
5 breq1 5100 . . . . . . 7 (𝑥 = 𝐵 → (𝑥 ≺ 𝒫 𝐴𝐵 ≺ 𝒫 𝐴))
64, 5anbi12d 641 . . . . . 6 (𝑥 = 𝐵 → ((𝐴𝑥𝑥 ≺ 𝒫 𝐴) ↔ (𝐴𝐵𝐵 ≺ 𝒫 𝐴)))
76spcegv 3555 . . . . 5 (𝐵 ∈ V → ((𝐴𝐵𝐵 ≺ 𝒫 𝐴) → ∃𝑥(𝐴𝑥𝑥 ≺ 𝒫 𝐴)))
83, 7mpcom 38 . . . 4 ((𝐴𝐵𝐵 ≺ 𝒫 𝐴) → ∃𝑥(𝐴𝑥𝑥 ≺ 𝒫 𝐴))
9 df-ex 1799 . . . 4 (∃𝑥(𝐴𝑥𝑥 ≺ 𝒫 𝐴) ↔ ¬ ∀𝑥 ¬ (𝐴𝑥𝑥 ≺ 𝒫 𝐴))
108, 9sylib 220 . . 3 ((𝐴𝐵𝐵 ≺ 𝒫 𝐴) → ¬ ∀𝑥 ¬ (𝐴𝑥𝑥 ≺ 𝒫 𝐴))
11 elgch 10574 . . . . . 6 (𝐴 ∈ GCH → (𝐴 ∈ GCH ↔ (𝐴 ∈ Fin ∨ ∀𝑥 ¬ (𝐴𝑥𝑥 ≺ 𝒫 𝐴))))
1211ibi 269 . . . . 5 (𝐴 ∈ GCH → (𝐴 ∈ Fin ∨ ∀𝑥 ¬ (𝐴𝑥𝑥 ≺ 𝒫 𝐴)))
1312orcomd 882 . . . 4 (𝐴 ∈ GCH → (∀𝑥 ¬ (𝐴𝑥𝑥 ≺ 𝒫 𝐴) ∨ 𝐴 ∈ Fin))
1413ord 875 . . 3 (𝐴 ∈ GCH → (¬ ∀𝑥 ¬ (𝐴𝑥𝑥 ≺ 𝒫 𝐴) → 𝐴 ∈ Fin))
1510, 14syl5 34 . 2 (𝐴 ∈ GCH → ((𝐴𝐵𝐵 ≺ 𝒫 𝐴) → 𝐴 ∈ Fin))
16153impib 1128 1 ((𝐴 ∈ GCH ∧ 𝐴𝐵𝐵 ≺ 𝒫 𝐴) → 𝐴 ∈ Fin)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 399  wo 858  w3a 1097  wal 1557   = wceq 1559  wex 1798  wcel 2141  Vcvv 3453  𝒫 cpw 4552   class class class wbr 5097  csdm 8920  Fincfn 8921  GCHcgch 10572
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-ext 2733  ax-sep 5243  ax-pr 5387
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-sb 2090  df-clab 2740  df-cleq 2753  df-clel 2836  df-ral 3076  df-rex 3086  df-rab 3414  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4580  df-pr 4582  df-op 4586  df-br 5098  df-opab 5160  df-xp 5649  df-rel 5650  df-dom 8923  df-sdom 8924  df-gch 10573
This theorem is referenced by:  gchen1  10577  gchen2  10578  gchpwdom  10622  gchaleph  10623
  Copyright terms: Public domain W3C validator