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

Theorem gchen2 10741
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 785 . 2 (((𝐴 ∈ GCH ∧ ¬ 𝐴 ∈ Fin) ∧ (𝐴 ≺ 𝐵 ∧ 𝐵 ≼ 𝒫 𝐴)) → 𝐵 ≼ 𝒫 𝐴)
2 gchi 10739 . . . . . 6 ((𝐴 ∈ GCH ∧ 𝐴 ≺ 𝐵 ∧ 𝐵 ≺ 𝒫 𝐴) → 𝐴 ∈ Fin)
323expia 1139 . . . . 5 ((𝐴 ∈ GCH ∧ 𝐴 ≺ 𝐵) → (𝐵 ≺ 𝒫 𝐴 → 𝐴 ∈ Fin))
43con3dimp 414 . . . 4 (((𝐴 ∈ GCH ∧ 𝐴 ≺ 𝐵) ∧ ¬ 𝐴 ∈ Fin) → ¬ 𝐵 ≺ 𝒫 𝐴)
54an32s 665 . . 3 (((𝐴 ∈ GCH ∧ ¬ 𝐴 ∈ Fin) ∧ 𝐴 ≺ 𝐵) → ¬ 𝐵 ≺ 𝒫 𝐴)
65adantrr 730 . 2 (((𝐴 ∈ GCH ∧ ¬ 𝐴 ∈ Fin) ∧ (𝐴 ≺ 𝐵 ∧ 𝐵 ≼ 𝒫 𝐴)) → ¬ 𝐵 ≺ 𝒫 𝐴)
7 bren2 9041 . 2 (𝐵 ≈ 𝒫 𝐴 ↔ (𝐵 ≼ 𝒫 𝐴 ∧ ¬ 𝐵 ≺ 𝒫 𝐴))
81, 6, 7sylanbrc 595 1 (((𝐴 ∈ GCH ∧ ¬ 𝐴 ∈ Fin) ∧ (𝐴 ≺ 𝐵 ∧ 𝐵 ≼ 𝒫 𝐴)) → 𝐵 ≈ 𝒫 𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   ∈ wcel 2147  𝒫 cpw 4560   class class class wbr 5106   ≈ cen 9001   ≼ cdom 9002   ≺ csdm 9003  Fincfn 9004  GCHcgch 10735
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-sep 5253  ax-pr 5396
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-br 5107  df-opab 5172  df-xp 5662  df-rel 5663  df-f1o 6568  df-en 9005  df-dom 9006  df-sdom 9007  df-gch 10736
This theorem is used by:  gchhar  10794
  Copyright terms: Public domain W3C validator