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 10601

Description: Lemma for gchac 10604 (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 8901	. . . . . 6 ⊢ Rel ≼
4	3	brrelex2i 5689	. . . . 5 ⊢ (𝐴 ≼ 𝐶 → 𝐶 ∈ V)
5	2, 4	syl 17	. . . 4 ⊢ (𝜑 → 𝐶 ∈ V)
6		canth2g 9071	. . . 4 ⊢ (𝐶 ∈ V → 𝐶 ≺ 𝒫 𝐶)
7		sdomdom 8929	. . . 4 ⊢ (𝐶 ≺ 𝒫 𝐶 → 𝐶 ≼ 𝒫 𝐶)
8	5, 6, 7	3syl 18	. . 3 ⊢ (𝜑 → 𝐶 ≼ 𝒫 𝐶)
9		domtr 8956	. . 3 ⊢ ((𝐴 ≼ 𝐶 ∧ 𝐶 ≼ 𝒫 𝐶) → 𝐴 ≼ 𝒫 𝐶)
10	2, 8, 9	syl2anc 585	. 2 ⊢ (𝜑 → 𝐴 ≼ 𝒫 𝐶)
11		gchaclem.3	. . . . . 6 ⊢ (𝜑 → 𝒫 𝐶 ∈ GCH)
12	11	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ 𝐵 ≼ 𝒫 𝒫 𝐶) → 𝒫 𝐶 ∈ GCH)
13		gchaclem.1	. . . . . . . 8 ⊢ (𝜑 → ω ≼ 𝐴)
14		domtr 8956	. . . . . . . 8 ⊢ ((ω ≼ 𝐴 ∧ 𝐴 ≼ 𝐶) → ω ≼ 𝐶)
15	13, 2, 14	syl2anc 585	. . . . . . 7 ⊢ (𝜑 → ω ≼ 𝐶)
16	15	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ 𝐵 ≼ 𝒫 𝒫 𝐶) → ω ≼ 𝐶)
17		pwdjuidm 10114	. . . . . 6 ⊢ (ω ≼ 𝐶 → (𝒫 𝐶 ⊔ 𝒫 𝐶) ≈ 𝒫 𝐶)
18	16, 17	syl 17	. . . . 5 ⊢ ((𝜑 ∧ 𝐵 ≼ 𝒫 𝒫 𝐶) → (𝒫 𝐶 ⊔ 𝒫 𝐶) ≈ 𝒫 𝐶)
19		simpr 484	. . . . 5 ⊢ ((𝜑 ∧ 𝐵 ≼ 𝒫 𝒫 𝐶) → 𝐵 ≼ 𝒫 𝒫 𝐶)
20		gchdomtri 10552	. . . . 5 ⊢ ((𝒫 𝐶 ∈ GCH ∧ (𝒫 𝐶 ⊔ 𝒫 𝐶) ≈ 𝒫 𝐶 ∧ 𝐵 ≼ 𝒫 𝒫 𝐶) → (𝒫 𝐶 ≼ 𝐵 ∨ 𝐵 ≼ 𝒫 𝐶))
21	12, 18, 19, 20	syl3anc 1374	. . . 4 ⊢ ((𝜑 ∧ 𝐵 ≼ 𝒫 𝒫 𝐶) → (𝒫 𝐶 ≼ 𝐵 ∨ 𝐵 ≼ 𝒫 𝐶))
22	21	ex 412	. . 3 ⊢ (𝜑 → (𝐵 ≼ 𝒫 𝒫 𝐶 → (𝒫 𝐶 ≼ 𝐵 ∨ 𝐵 ≼ 𝒫 𝐶)))
23		pwdom 9069	. . . . 5 ⊢ (𝐴 ≼ 𝐶 → 𝒫 𝐴 ≼ 𝒫 𝐶)
24		domtr 8956	. . . . . 6 ⊢ ((𝒫 𝐴 ≼ 𝒫 𝐶 ∧ 𝒫 𝐶 ≼ 𝐵) → 𝒫 𝐴 ≼ 𝐵)
25	24	ex 412	. . . . 5 ⊢ (𝒫 𝐴 ≼ 𝒫 𝐶 → (𝒫 𝐶 ≼ 𝐵 → 𝒫 𝐴 ≼ 𝐵))
26	2, 23, 25	3syl 18	. . . 4 ⊢ (𝜑 → (𝒫 𝐶 ≼ 𝐵 → 𝒫 𝐴 ≼ 𝐵))
27	1	simprd 495	. . . 4 ⊢ (𝜑 → (𝐵 ≼ 𝒫 𝐶 → 𝒫 𝐴 ≼ 𝐵))
28	26, 27	jaod 860	. . 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 848 ∈ wcel 2114 Vcvv 3442 𝒫 cpw 4556 class class class wbr 5100 ωcom 7818 ≈ cen 8892 ≼ cdom 8893 ≺ csdm 8894 ⊔ cdju 9822 GCHcgch 10543

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-int 4905 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5527 df-eprel 5532 df-po 5540 df-so 5541 df-fr 5585 df-we 5587 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-ord 6328 df-on 6329 df-lim 6330 df-suc 6331 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-ov 7371 df-oprab 7372 df-mpo 7373 df-om 7819 df-1st 7943 df-2nd 7944 df-1o 8407 df-2o 8408 df-er 8645 df-map 8777 df-en 8896 df-dom 8897 df-sdom 8898 df-fin 8899 df-wdom 9482 df-dju 9825 df-card 9863 df-gch 10544

This theorem is referenced by: (None)

W3C validator