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

Theorem gchen2 10544
Description: If 𝐴 < 𝐵 ≤ 𝒫 𝐴, and 𝐴 is an infinite GCH-set, then 𝐵 = 𝒫 𝐴 in cardinality. (Contributed by Mario Carneiro, 15-May-2015.)
Assertion
Ref Expression
gchen2 (((𝐴 ∈ GCH ∧ ¬ 𝐴 ∈ Fin) ∧ (𝐴𝐵𝐵 ≼ 𝒫 𝐴)) → 𝐵 ≈ 𝒫 𝐴)

Proof of Theorem gchen2
StepHypRef Expression
1 simprr 779 . 2 (((𝐴 ∈ GCH ∧ ¬ 𝐴 ∈ Fin) ∧ (𝐴𝐵𝐵 ≼ 𝒫 𝐴)) → 𝐵 ≼ 𝒫 𝐴)
2 gchi 10542 . . . . . 6 ((𝐴 ∈ GCH ∧ 𝐴𝐵𝐵 ≺ 𝒫 𝐴) → 𝐴 ∈ Fin)
323expia 1128 . . . . 5 ((𝐴 ∈ GCH ∧ 𝐴𝐵) → (𝐵 ≺ 𝒫 𝐴𝐴 ∈ Fin))
43con3dimp 410 . . . 4 (((𝐴 ∈ GCH ∧ 𝐴𝐵) ∧ ¬ 𝐴 ∈ Fin) → ¬ 𝐵 ≺ 𝒫 𝐴)
54an32s 659 . . 3 (((𝐴 ∈ GCH ∧ ¬ 𝐴 ∈ Fin) ∧ 𝐴𝐵) → ¬ 𝐵 ≺ 𝒫 𝐴)
65adantrr 724 . 2 (((𝐴 ∈ GCH ∧ ¬ 𝐴 ∈ Fin) ∧ (𝐴𝐵𝐵 ≼ 𝒫 𝐴)) → ¬ 𝐵 ≺ 𝒫 𝐴)
7 bren2 8924 . 2 (𝐵 ≈ 𝒫 𝐴 ↔ (𝐵 ≼ 𝒫 𝐴 ∧ ¬ 𝐵 ≺ 𝒫 𝐴))
81, 6, 7sylanbrc 590 1 (((𝐴 ∈ GCH ∧ ¬ 𝐴 ∈ Fin) ∧ (𝐴𝐵𝐵 ≼ 𝒫 𝐴)) → 𝐵 ≈ 𝒫 𝐴)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 397  wcel 2121  𝒫 cpw 4532   class class class wbr 5075  cen 8884  cdom 8885  csdm 8886  Fincfn 8887  GCHcgch 10538
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1975  ax-7 2016  ax-8 2123  ax-9 2131  ax-ext 2713  ax-sep 5221  ax-pr 5365
This theorem depends on definitions:  df-bi 209  df-an 398  df-or 855  df-3an 1095  df-tru 1551  df-fal 1561  df-ex 1788  df-sb 2075  df-clab 2720  df-cleq 2733  df-clel 2816  df-ral 3056  df-rex 3066  df-rab 3394  df-v 3435  df-dif 3888  df-un 3890  df-in 3892  df-ss 3902  df-nul 4265  df-if 4458  df-pw 4534  df-sn 4559  df-pr 4561  df-op 4565  df-br 5076  df-opab 5138  df-xp 5627  df-rel 5628  df-f1o 6496  df-en 8888  df-dom 8889  df-sdom 8890  df-gch 10539
This theorem is referenced by:  gchhar  10597
  Copyright terms: Public domain W3C validator