Theorem gchor 10582

Description: If 𝐴 ≤ 𝐵 ≤ 𝒫 𝐴, and 𝐴 is an infinite GCH-set, then either 𝐴 = 𝐵 or 𝐵 = 𝒫 𝐴 in cardinality. (Contributed by Mario Carneiro, 15-May-2015.)

Assertion

Ref	Expression
gchor	⊢ (((𝐴 ∈ GCH ∧ ¬ 𝐴 ∈ Fin) ∧ (𝐴 ≼ 𝐵 ∧ 𝐵 ≼ 𝒫 𝐴)) → (𝐴 ≈ 𝐵 ∨ 𝐵 ≈ 𝒫 𝐴))

Proof of Theorem gchor

Step	Hyp	Ref	Expression
1		simprr 782	. . 3 ⊢ (((𝐴 ∈ GCH ∧ ¬ 𝐴 ∈ Fin) ∧ (𝐴 ≼ 𝐵 ∧ 𝐵 ≼ 𝒫 𝐴)) → 𝐵 ≼ 𝒫 𝐴)
2		brdom2 8959	. . 3 ⊢ (𝐵 ≼ 𝒫 𝐴 ↔ (𝐵 ≺ 𝒫 𝐴 ∨ 𝐵 ≈ 𝒫 𝐴))
3	1, 2	sylib 220	. 2 ⊢ (((𝐴 ∈ GCH ∧ ¬ 𝐴 ∈ Fin) ∧ (𝐴 ≼ 𝐵 ∧ 𝐵 ≼ 𝒫 𝐴)) → (𝐵 ≺ 𝒫 𝐴 ∨ 𝐵 ≈ 𝒫 𝐴))
4		gchen1 10580	. . . . 5 ⊢ (((𝐴 ∈ GCH ∧ ¬ 𝐴 ∈ Fin) ∧ (𝐴 ≼ 𝐵 ∧ 𝐵 ≺ 𝒫 𝐴)) → 𝐴 ≈ 𝐵)
5	4	expr 460	. . . 4 ⊢ (((𝐴 ∈ GCH ∧ ¬ 𝐴 ∈ Fin) ∧ 𝐴 ≼ 𝐵) → (𝐵 ≺ 𝒫 𝐴 → 𝐴 ≈ 𝐵))
6	5	adantrr 727	. . 3 ⊢ (((𝐴 ∈ GCH ∧ ¬ 𝐴 ∈ Fin) ∧ (𝐴 ≼ 𝐵 ∧ 𝐵 ≼ 𝒫 𝐴)) → (𝐵 ≺ 𝒫 𝐴 → 𝐴 ≈ 𝐵))
7	6	orim1d 978	. 2 ⊢ (((𝐴 ∈ GCH ∧ ¬ 𝐴 ∈ Fin) ∧ (𝐴 ≼ 𝐵 ∧ 𝐵 ≼ 𝒫 𝐴)) → ((𝐵 ≺ 𝒫 𝐴 ∨ 𝐵 ≈ 𝒫 𝐴) → (𝐴 ≈ 𝐵 ∨ 𝐵 ≈ 𝒫 𝐴)))
8	3, 7	mpd 15	1 ⊢ (((𝐴 ∈ GCH ∧ ¬ 𝐴 ∈ Fin) ∧ (𝐴 ≼ 𝐵 ∧ 𝐵 ≼ 𝒫 𝐴)) → (𝐴 ≈ 𝐵 ∨ 𝐵 ≈ 𝒫 𝐴))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 399   ∨ wo 858   ∈ wcel 2141  𝒫 cpw 4554   class class class wbr 5099   ≈ cen 8920   ≼ cdom 8921   ≺ csdm 8922  Fincfn 8923  GCHcgch 10575

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 5245  ax-pr 5389

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 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4582  df-pr 4584  df-op 4588  df-br 5100  df-opab 5162  df-xp 5651  df-rel 5652  df-f1o 6524  df-en 8924  df-dom 8925  df-sdom 8926  df-gch 10576

This theorem is referenced by:  gchdomtri  10584  gchpwdom  10625