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 10638

Description: Lemma for gchac 10641 (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 8927	. . . . . 6 ⊢ Rel ≼
4	3	brrelex2i 5698	. . . . 5 ⊢ (𝐴 ≼ 𝐶 → 𝐶 ∈ V)
5	2, 4	syl 17	. . . 4 ⊢ (𝜑 → 𝐶 ∈ V)
6		canth2g 9101	. . . 4 ⊢ (𝐶 ∈ V → 𝐶 ≺ 𝒫 𝐶)
7		sdomdom 8954	. . . 4 ⊢ (𝐶 ≺ 𝒫 𝐶 → 𝐶 ≼ 𝒫 𝐶)
8	5, 6, 7	3syl 18	. . 3 ⊢ (𝜑 → 𝐶 ≼ 𝒫 𝐶)
9		domtr 8981	. . 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 8981	. . . . . . . 8 ⊢ ((ω ≼ 𝐴 ∧ 𝐴 ≼ 𝐶) → ω ≼ 𝐶)
15	13, 2, 14	syl2anc 584	. . . . . . 7 ⊢ (𝜑 → ω ≼ 𝐶)
16	15	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ 𝐵 ≼ 𝒫 𝒫 𝐶) → ω ≼ 𝐶)
17		pwdjuidm 10152	. . . . . 6 ⊢ (ω ≼ 𝐶 → (𝒫 𝐶 ⊔ 𝒫 𝐶) ≈ 𝒫 𝐶)
18	16, 17	syl 17	. . . . 5 ⊢ ((𝜑 ∧ 𝐵 ≼ 𝒫 𝒫 𝐶) → (𝒫 𝐶 ⊔ 𝒫 𝐶) ≈ 𝒫 𝐶)
19		simpr 484	. . . . 5 ⊢ ((𝜑 ∧ 𝐵 ≼ 𝒫 𝒫 𝐶) → 𝐵 ≼ 𝒫 𝒫 𝐶)
20		gchdomtri 10589	. . . . 5 ⊢ ((𝒫 𝐶 ∈ GCH ∧ (𝒫 𝐶 ⊔ 𝒫 𝐶) ≈ 𝒫 𝐶 ∧ 𝐵 ≼ 𝒫 𝒫 𝐶) → (𝒫 𝐶 ≼ 𝐵 ∨ 𝐵 ≼ 𝒫 𝐶))
21	12, 18, 19, 20	syl3anc 1373	. . . 4 ⊢ ((𝜑 ∧ 𝐵 ≼ 𝒫 𝒫 𝐶) → (𝒫 𝐶 ≼ 𝐵 ∨ 𝐵 ≼ 𝒫 𝐶))
22	21	ex 412	. . 3 ⊢ (𝜑 → (𝐵 ≼ 𝒫 𝒫 𝐶 → (𝒫 𝐶 ≼ 𝐵 ∨ 𝐵 ≼ 𝒫 𝐶)))
23		pwdom 9099	. . . . 5 ⊢ (𝐴 ≼ 𝐶 → 𝒫 𝐴 ≼ 𝒫 𝐶)
24		domtr 8981	. . . . . 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 3450 𝒫 cpw 4566 class class class wbr 5110 ωcom 7845 ≈ cen 8918 ≼ cdom 8919 ≺ csdm 8920 ⊔ cdju 9858 GCHcgch 10580

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 2702 ax-sep 5254 ax-nul 5264 ax-pow 5323 ax-pr 5390 ax-un 7714

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 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-ral 3046 df-rex 3055 df-reu 3357 df-rab 3409 df-v 3452 df-sbc 3757 df-csb 3866 df-dif 3920 df-un 3922 df-in 3924 df-ss 3934 df-pss 3937 df-nul 4300 df-if 4492 df-pw 4568 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-int 4914 df-iun 4960 df-br 5111 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5536 df-eprel 5541 df-po 5549 df-so 5550 df-fr 5594 df-we 5596 df-xp 5647 df-rel 5648 df-cnv 5649 df-co 5650 df-dm 5651 df-rn 5652 df-res 5653 df-ima 5654 df-ord 6338 df-on 6339 df-lim 6340 df-suc 6341 df-iota 6467 df-fun 6516 df-fn 6517 df-f 6518 df-f1 6519 df-fo 6520 df-f1o 6521 df-fv 6522 df-ov 7393 df-oprab 7394 df-mpo 7395 df-om 7846 df-1st 7971 df-2nd 7972 df-1o 8437 df-2o 8438 df-er 8674 df-map 8804 df-en 8922 df-dom 8923 df-sdom 8924 df-fin 8925 df-wdom 9525 df-dju 9861 df-card 9899 df-gch 10581

This theorem is referenced by: (None)

W3C validator