Theorem gchi 10543

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.

Step	Hyp	Ref	Expression
1		relsdom 8894	. . . . . . 7 ⊢ Rel ≺
2	1	brrelex1i 5676	. . . . . 6 ⊢ (𝐵 ≺ 𝒫 𝐴 → 𝐵 ∈ V)
3	2	adantl 483	. . . . 5 ⊢ ((𝐴 ≺ 𝐵 ∧ 𝐵 ≺ 𝒫 𝐴) → 𝐵 ∈ V)
4		breq2 5078	. . . . . . 7 ⊢ (𝑥 = 𝐵 → (𝐴 ≺ 𝑥 ↔ 𝐴 ≺ 𝐵))
5		breq1 5077	. . . . . . 7 ⊢ (𝑥 = 𝐵 → (𝑥 ≺ 𝒫 𝐴 ↔ 𝐵 ≺ 𝒫 𝐴))
6	4, 5	anbi12d 639	. . . . . 6 ⊢ (𝑥 = 𝐵 → ((𝐴 ≺ 𝑥 ∧ 𝑥 ≺ 𝒫 𝐴) ↔ (𝐴 ≺ 𝐵 ∧ 𝐵 ≺ 𝒫 𝐴)))
7	6	spcegv 3536	. . . . 5 ⊢ (𝐵 ∈ V → ((𝐴 ≺ 𝐵 ∧ 𝐵 ≺ 𝒫 𝐴) → ∃𝑥(𝐴 ≺ 𝑥 ∧ 𝑥 ≺ 𝒫 𝐴)))
8	3, 7	mpcom 38	. . . 4 ⊢ ((𝐴 ≺ 𝐵 ∧ 𝐵 ≺ 𝒫 𝐴) → ∃𝑥(𝐴 ≺ 𝑥 ∧ 𝑥 ≺ 𝒫 𝐴))
9		df-ex 1788	. . . 4 ⊢ (∃𝑥(𝐴 ≺ 𝑥 ∧ 𝑥 ≺ 𝒫 𝐴) ↔ ¬ ∀𝑥 ¬ (𝐴 ≺ 𝑥 ∧ 𝑥 ≺ 𝒫 𝐴))
10	8, 9	sylib 220	. . 3 ⊢ ((𝐴 ≺ 𝐵 ∧ 𝐵 ≺ 𝒫 𝐴) → ¬ ∀𝑥 ¬ (𝐴 ≺ 𝑥 ∧ 𝑥 ≺ 𝒫 𝐴))
11		elgch 10541	. . . . . 6 ⊢ (𝐴 ∈ GCH → (𝐴 ∈ GCH ↔ (𝐴 ∈ Fin ∨ ∀𝑥 ¬ (𝐴 ≺ 𝑥 ∧ 𝑥 ≺ 𝒫 𝐴))))
12	11	ibi 269	. . . . 5 ⊢ (𝐴 ∈ GCH → (𝐴 ∈ Fin ∨ ∀𝑥 ¬ (𝐴 ≺ 𝑥 ∧ 𝑥 ≺ 𝒫 𝐴)))
13	12	orcomd 878	. . . 4 ⊢ (𝐴 ∈ GCH → (∀𝑥 ¬ (𝐴 ≺ 𝑥 ∧ 𝑥 ≺ 𝒫 𝐴) ∨ 𝐴 ∈ Fin))
14	13	ord 871	. . 3 ⊢ (𝐴 ∈ GCH → (¬ ∀𝑥 ¬ (𝐴 ≺ 𝑥 ∧ 𝑥 ≺ 𝒫 𝐴) → 𝐴 ∈ Fin))
15	10, 14	syl5 34	. 2 ⊢ (𝐴 ∈ GCH → ((𝐴 ≺ 𝐵 ∧ 𝐵 ≺ 𝒫 𝐴) → 𝐴 ∈ Fin))
16	15	3impib 1123	1 ⊢ ((𝐴 ∈ GCH ∧ 𝐴 ≺ 𝐵 ∧ 𝐵 ≺ 𝒫 𝐴) → 𝐴 ∈ Fin)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 397   ∨ wo 854   ∧ w3a 1093  ∀wal 1546   = wceq 1548  ∃wex 1787   ∈ wcel 2121  Vcvv 3433  𝒫 cpw 4531   class class class wbr 5074   ≺ csdm 8886  Fincfn 8887  GCHcgch 10539

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 5220  ax-pr 5364

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 3887  df-un 3889  df-in 3891  df-ss 3901  df-nul 4264  df-if 4457  df-pw 4533  df-sn 4558  df-pr 4560  df-op 4564  df-br 5075  df-opab 5137  df-xp 5626  df-rel 5627  df-dom 8889  df-sdom 8890  df-gch 10540

This theorem is referenced by:  gchen1  10544  gchen2  10545  gchpwdom  10589  gchaleph  10590