gchaclem - Metamath Proof Explorer

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

Theorem gchaclem 10572

Description: Lemma for gchac 10575 (obsolete, used in Sierpiński's proof). (Contributed by Mario Carneiro, 15-May-2015.)

**Hypotheses**
Ref	Expression
gchaclem.1	⊢ (𝜑 → ω ≼ 𝐴)
gchaclem.3	⊢ (𝜑 → 𝒫 𝐶 ∈ GCH)
gchaclem.4	⊢ (𝜑 → (𝐴 ≼ 𝐶 ∧ (𝐵 ≼ 𝒫 𝐶 → 𝒫 𝐴 ≼ 𝐵)))

**Assertion**
Ref	Expression
gchaclem	⊢ (𝜑 → (𝐴 ≼ 𝒫 𝐶 ∧ (𝐵 ≼ 𝒫 𝒫 𝐶 → 𝒫 𝐴 ≼ 𝐵)))

**Proof of Theorem gchaclem**
Step	Hyp	Ref	Expression
1		gchaclem.4	. . . 4 ⊢ (𝜑 → (𝐴 ≼ 𝐶 ∧ (𝐵 ≼ 𝒫 𝐶 → 𝒫 𝐴 ≼ 𝐵)))
2	1	simpld 494	. . 3 ⊢ (𝜑 → 𝐴 ≼ 𝐶)
3		reldom 8878	. . . . . 6 ⊢ Rel ≼
4	3	brrelex2i 5676	. . . . 5 ⊢ (𝐴 ≼ 𝐶 → 𝐶 ∈ V)
5	2, 4	syl 17	. . . 4 ⊢ (𝜑 → 𝐶 ∈ V)
6		canth2g 9048	. . . 4 ⊢ (𝐶 ∈ V → 𝐶 ≺ 𝒫 𝐶)
7		sdomdom 8905	. . . 4 ⊢ (𝐶 ≺ 𝒫 𝐶 → 𝐶 ≼ 𝒫 𝐶)
8	5, 6, 7	3syl 18	. . 3 ⊢ (𝜑 → 𝐶 ≼ 𝒫 𝐶)
9		domtr 8932	. . 3 ⊢ ((𝐴 ≼ 𝐶 ∧ 𝐶 ≼ 𝒫 𝐶) → 𝐴 ≼ 𝒫 𝐶)
10	2, 8, 9	syl2anc 584	. 2 ⊢ (𝜑 → 𝐴 ≼ 𝒫 𝐶)
11		gchaclem.3	. . . . . 6 ⊢ (𝜑 → 𝒫 𝐶 ∈ GCH)
12	11	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ 𝐵 ≼ 𝒫 𝒫 𝐶) → 𝒫 𝐶 ∈ GCH)
13		gchaclem.1	. . . . . . . 8 ⊢ (𝜑 → ω ≼ 𝐴)
14		domtr 8932	. . . . . . . 8 ⊢ ((ω ≼ 𝐴 ∧ 𝐴 ≼ 𝐶) → ω ≼ 𝐶)
15	13, 2, 14	syl2anc 584	. . . . . . 7 ⊢ (𝜑 → ω ≼ 𝐶)
16	15	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ 𝐵 ≼ 𝒫 𝒫 𝐶) → ω ≼ 𝐶)
17		pwdjuidm 10086	. . . . . 6 ⊢ (ω ≼ 𝐶 → (𝒫 𝐶 ⊔ 𝒫 𝐶) ≈ 𝒫 𝐶)
18	16, 17	syl 17	. . . . 5 ⊢ ((𝜑 ∧ 𝐵 ≼ 𝒫 𝒫 𝐶) → (𝒫 𝐶 ⊔ 𝒫 𝐶) ≈ 𝒫 𝐶)
19		simpr 484	. . . . 5 ⊢ ((𝜑 ∧ 𝐵 ≼ 𝒫 𝒫 𝐶) → 𝐵 ≼ 𝒫 𝒫 𝐶)
20		gchdomtri 10523	. . . . 5 ⊢ ((𝒫 𝐶 ∈ GCH ∧ (𝒫 𝐶 ⊔ 𝒫 𝐶) ≈ 𝒫 𝐶 ∧ 𝐵 ≼ 𝒫 𝒫 𝐶) → (𝒫 𝐶 ≼ 𝐵 ∨ 𝐵 ≼ 𝒫 𝐶))
21	12, 18, 19, 20	syl3anc 1373	. . . 4 ⊢ ((𝜑 ∧ 𝐵 ≼ 𝒫 𝒫 𝐶) → (𝒫 𝐶 ≼ 𝐵 ∨ 𝐵 ≼ 𝒫 𝐶))
22	21	ex 412	. . 3 ⊢ (𝜑 → (𝐵 ≼ 𝒫 𝒫 𝐶 → (𝒫 𝐶 ≼ 𝐵 ∨ 𝐵 ≼ 𝒫 𝐶)))
23		pwdom 9046	. . . . 5 ⊢ (𝐴 ≼ 𝐶 → 𝒫 𝐴 ≼ 𝒫 𝐶)
24		domtr 8932	. . . . . 6 ⊢ ((𝒫 𝐴 ≼ 𝒫 𝐶 ∧ 𝒫 𝐶 ≼ 𝐵) → 𝒫 𝐴 ≼ 𝐵)
25	24	ex 412	. . . . 5 ⊢ (𝒫 𝐴 ≼ 𝒫 𝐶 → (𝒫 𝐶 ≼ 𝐵 → 𝒫 𝐴 ≼ 𝐵))
26	2, 23, 25	3syl 18	. . . 4 ⊢ (𝜑 → (𝒫 𝐶 ≼ 𝐵 → 𝒫 𝐴 ≼ 𝐵))
27	1	simprd 495	. . . 4 ⊢ (𝜑 → (𝐵 ≼ 𝒫 𝐶 → 𝒫 𝐴 ≼ 𝐵))
28	26, 27	jaod 859	. . 3 ⊢ (𝜑 → ((𝒫 𝐶 ≼ 𝐵 ∨ 𝐵 ≼ 𝒫 𝐶) → 𝒫 𝐴 ≼ 𝐵))
29	22, 28	syld 47	. 2 ⊢ (𝜑 → (𝐵 ≼ 𝒫 𝒫 𝐶 → 𝒫 𝐴 ≼ 𝐵))
30	10, 29	jca 511	1 ⊢ (𝜑 → (𝐴 ≼ 𝒫 𝐶 ∧ (𝐵 ≼ 𝒫 𝒫 𝐶 → 𝒫 𝐴 ≼ 𝐵)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 ∨ wo 847 ∈ wcel 2109 Vcvv 3436 𝒫 cpw 4551 class class class wbr 5092 ωcom 7799 ≈ cen 8869 ≼ cdom 8870 ≺ csdm 8871 ⊔ cdju 9794 GCHcgch 10514

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5235 ax-nul 5245 ax-pow 5304 ax-pr 5371 ax-un 7671

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-ral 3045 df-rex 3054 df-reu 3344 df-rab 3395 df-v 3438 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4285 df-if 4477 df-pw 4553 df-sn 4578 df-pr 4580 df-op 4584 df-uni 4859 df-int 4897 df-iun 4943 df-br 5093 df-opab 5155 df-mpt 5174 df-tr 5200 df-id 5514 df-eprel 5519 df-po 5527 df-so 5528 df-fr 5572 df-we 5574 df-xp 5625 df-rel 5626 df-cnv 5627 df-co 5628 df-dm 5629 df-rn 5630 df-res 5631 df-ima 5632 df-ord 6310 df-on 6311 df-lim 6312 df-suc 6313 df-iota 6438 df-fun 6484 df-fn 6485 df-f 6486 df-f1 6487 df-fo 6488 df-f1o 6489 df-fv 6490 df-ov 7352 df-oprab 7353 df-mpo 7354 df-om 7800 df-1st 7924 df-2nd 7925 df-1o 8388 df-2o 8389 df-er 8625 df-map 8755 df-en 8873 df-dom 8874 df-sdom 8875 df-fin 8876 df-wdom 9457 df-dju 9797 df-card 9835 df-gch 10515

This theorem is referenced by: (None)

W3C validator