cdlemg2ce - Mathbox for Norm Megill

	Mathbox for Norm Megill		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > cdlemg2ce		Structured version Visualization version GIF version

Theorem cdlemg2ce 41407

Description: Utility theorem to eliminate p,q when converting theorems with explicit f. TODO: fix comment. (Contributed by NM, 22-Apr-2013.)

**Hypotheses**
Ref	Expression
cdlemg2.b	⊢ 𝐵 = (Base‘𝐾)
cdlemg2.l	⊢ ≤ = (le‘𝐾)
cdlemg2.j	⊢ ∨ = (join‘𝐾)
cdlemg2.m	⊢ ∧ = (meet‘𝐾)
cdlemg2.a	⊢ 𝐴 = (Atoms‘𝐾)
cdlemg2.h	⊢ 𝐻 = (LHyp‘𝐾)
cdlemg2.t	⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
cdlemg2ex.u	⊢ 𝑈 = ((𝑝 ∨ 𝑞) ∧ 𝑊)
cdlemg2ex.d	⊢ 𝐷 = ((𝑡 ∨ 𝑈) ∧ (𝑞 ∨ ((𝑝 ∨ 𝑡) ∧ 𝑊)))
cdlemg2ex.e	⊢ 𝐸 = ((𝑝 ∨ 𝑞) ∧ (𝐷 ∨ ((𝑠 ∨ 𝑡) ∧ 𝑊)))
cdlemg2ex.g	⊢ 𝐺 = (𝑥 ∈ 𝐵 ↦ if((𝑝 ≠ 𝑞 ∧ ¬ 𝑥 ≤ 𝑊), (℩𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑧 = (if(𝑠 ≤ (𝑝 ∨ 𝑞), (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑝 ∨ 𝑞)) → 𝑦 = 𝐸)), ⦋𝑠 / 𝑡⦌𝐷) ∨ (𝑥 ∧ 𝑊)))), 𝑥))
cdlemg2ce.p	⊢ (𝐹 = 𝐺 → (𝜓 ↔ 𝜒))
cdlemg2ce.c	⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑝 ∈ 𝐴 ∧ ¬ 𝑝 ≤ 𝑊) ∧ (𝑞 ∈ 𝐴 ∧ ¬ 𝑞 ≤ 𝑊)) ∧ 𝜑) → 𝜒)

**Assertion**
Ref	Expression
cdlemg2ce	⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝜑) → 𝜓)

Distinct variable groups: ∧ ,𝑠,𝑡,𝑥,𝑦,𝑧 𝐾,𝑠,𝑡,𝑥,𝑦,𝑧 𝑈,𝑠,𝑡,𝑥,𝑦,𝑧 𝑊,𝑠,𝑡,𝑥,𝑦,𝑧 ∨ ,𝑠,𝑡,𝑥,𝑦,𝑧 𝐵,𝑠,𝑡,𝑥,𝑦,𝑧 𝐴,𝑠,𝑡,𝑥,𝑦,𝑧 ≤ ,𝑠,𝑡,𝑥,𝑦,𝑧 𝐻,𝑠,𝑡,𝑥,𝑦,𝑧 𝑥,𝐸,𝑦,𝑧 𝐷,𝑠,𝑥,𝑦,𝑧 𝑞,𝑝,𝐴 𝐹,𝑝,𝑞 𝐻,𝑝,𝑞 𝐾,𝑝,𝑞 ≤ ,𝑝,𝑞 𝑇,𝑝,𝑞 𝑊,𝑝,𝑞,𝑠,𝑡,𝑥,𝑦,𝑧 𝜑,𝑝,𝑞 𝜓,𝑝,𝑞 Allowed substitution hints: 𝜑(𝑥, 𝑦, 𝑧, 𝑡, 𝑠) 𝜓(𝑥, 𝑦, 𝑧, 𝑡, 𝑠) 𝜒(𝑥, 𝑦, 𝑧, 𝑡, 𝑠, 𝑞, 𝑝) 𝐵(𝑞, 𝑝) 𝐷(𝑡, 𝑞, 𝑝) 𝑇(𝑥, 𝑦, 𝑧, 𝑡, 𝑠) 𝑈(𝑞, 𝑝) 𝐸(𝑡, 𝑠, 𝑞, 𝑝) 𝐹(𝑥, 𝑦, 𝑧, 𝑡, 𝑠) 𝐺(𝑥, 𝑦, 𝑧, 𝑡, 𝑠, 𝑞, 𝑝) ∨ (𝑞, 𝑝) ∧ (𝑞, 𝑝)

**Proof of Theorem cdlemg2ce**
Step	Hyp	Ref	Expression
1		simp2 1155	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝜑) → 𝐹 ∈ 𝑇)
2		cdlemg2.b	. . . . 5 ⊢ 𝐵 = (Base‘𝐾)
3		cdlemg2.l	. . . . 5 ⊢ ≤ = (le‘𝐾)
4		cdlemg2.j	. . . . 5 ⊢ ∨ = (join‘𝐾)
5		cdlemg2.m	. . . . 5 ⊢ ∧ = (meet‘𝐾)
6		cdlemg2.a	. . . . 5 ⊢ 𝐴 = (Atoms‘𝐾)
7		cdlemg2.h	. . . . 5 ⊢ 𝐻 = (LHyp‘𝐾)
8		cdlemg2.t	. . . . 5 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
9		cdlemg2ex.u	. . . . 5 ⊢ 𝑈 = ((𝑝 ∨ 𝑞) ∧ 𝑊)
10		cdlemg2ex.d	. . . . 5 ⊢ 𝐷 = ((𝑡 ∨ 𝑈) ∧ (𝑞 ∨ ((𝑝 ∨ 𝑡) ∧ 𝑊)))
11		cdlemg2ex.e	. . . . 5 ⊢ 𝐸 = ((𝑝 ∨ 𝑞) ∧ (𝐷 ∨ ((𝑠 ∨ 𝑡) ∧ 𝑊)))
12		cdlemg2ex.g	. . . . 5 ⊢ 𝐺 = (𝑥 ∈ 𝐵 ↦ if((𝑝 ≠ 𝑞 ∧ ¬ 𝑥 ≤ 𝑊), (℩𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑧 = (if(𝑠 ≤ (𝑝 ∨ 𝑞), (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑝 ∨ 𝑞)) → 𝑦 = 𝐸)), ⦋𝑠 / 𝑡⦌𝐷) ∨ (𝑥 ∧ 𝑊)))), 𝑥))
13	2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12	cdlemg2cex 41406	. . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → (𝐹 ∈ 𝑇 ↔ ∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊 ∧ 𝐹 = 𝐺)))
14	13	3ad2ant1 1151	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝜑) → (𝐹 ∈ 𝑇 ↔ ∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊 ∧ 𝐹 = 𝐺)))
15	1, 14	mpbid 235	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝜑) → ∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊 ∧ 𝐹 = 𝐺))
16		simp11 1222	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝜑) ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴) ∧ (¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊 ∧ 𝐹 = 𝐺)) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
17		simp2l 1218	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝜑) ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴) ∧ (¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊 ∧ 𝐹 = 𝐺)) → 𝑝 ∈ 𝐴)
18		simp31 1228	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝜑) ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴) ∧ (¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊 ∧ 𝐹 = 𝐺)) → ¬ 𝑝 ≤ 𝑊)
19	17, 18	jca 521	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝜑) ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴) ∧ (¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊 ∧ 𝐹 = 𝐺)) → (𝑝 ∈ 𝐴 ∧ ¬ 𝑝 ≤ 𝑊))
20		simp2r 1219	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝜑) ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴) ∧ (¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊 ∧ 𝐹 = 𝐺)) → 𝑞 ∈ 𝐴)
21		simp32 1229	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝜑) ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴) ∧ (¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊 ∧ 𝐹 = 𝐺)) → ¬ 𝑞 ≤ 𝑊)
22	20, 21	jca 521	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝜑) ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴) ∧ (¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊 ∧ 𝐹 = 𝐺)) → (𝑞 ∈ 𝐴 ∧ ¬ 𝑞 ≤ 𝑊))
23		simp13 1224	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝜑) ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴) ∧ (¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊 ∧ 𝐹 = 𝐺)) → 𝜑)
24		cdlemg2ce.c	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑝 ∈ 𝐴 ∧ ¬ 𝑝 ≤ 𝑊) ∧ (𝑞 ∈ 𝐴 ∧ ¬ 𝑞 ≤ 𝑊)) ∧ 𝜑) → 𝜒)
25	16, 19, 22, 23, 24	syl31anc 1400	. . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝜑) ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴) ∧ (¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊 ∧ 𝐹 = 𝐺)) → 𝜒)
26		simp33 1230	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝜑) ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴) ∧ (¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊 ∧ 𝐹 = 𝐺)) → 𝐹 = 𝐺)
27		cdlemg2ce.p	. . . . . 6 ⊢ (𝐹 = 𝐺 → (𝜓 ↔ 𝜒))
28	26, 27	syl 18	. . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝜑) ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴) ∧ (¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊 ∧ 𝐹 = 𝐺)) → (𝜓 ↔ 𝜒))
29	25, 28	mpbird 260	. . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝜑) ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴) ∧ (¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊 ∧ 𝐹 = 𝐺)) → 𝜓)
30	29	3exp 1137	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝜑) → ((𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴) → ((¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊 ∧ 𝐹 = 𝐺) → 𝜓)))
31	30	rexlimdvv 3224	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝜑) → (∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊 ∧ 𝐹 = 𝐺) → 𝜓))
32	15, 31	mpd 16	1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝜑) → 𝜓)

Colors of variables: wff setvar class

This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2146 ≠ wne 2961 ∀wral 3082 ∃wrex 3092 ⦋csb 3856 ifcif 4492 class class class wbr 5114 ↦ cmpt 5197 ‘cfv 6543 ℩crio 7379 (class class class)co 7423 Basecbs 17294 lecple 17342 joincjn 18392 meetcmee 18393 Atomscatm 40078 HLchlt 40165 LHypclh 40799 LTrncltrn 40916

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2738 ax-rep 5243 ax-sep 5262 ax-nul 5274 ax-pow 5341 ax-pr 5409 ax-un 7745 ax-riotaBAD 39768

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2841 df-nfc 2915 df-ne 2962 df-ral 3083 df-rex 3093 df-rmo 3372 df-reu 3373 df-rab 3420 df-v 3460 df-sbc 3748 df-csb 3857 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-nul 4290 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-iun 4963 df-iin 4964 df-br 5115 df-opab 5179 df-mpt 5198 df-id 5561 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-rn 5677 df-res 5678 df-ima 5679 df-iota 6499 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7380 df-ov 7426 df-oprab 7427 df-mpo 7428 df-1st 7995 df-2nd 7996 df-undef 8278 df-map 8835 df-proset 18375 df-poset 18394 df-plt 18409 df-lub 18425 df-glb 18426 df-join 18427 df-meet 18428 df-p0 18504 df-p1 18505 df-lat 18513 df-clat 18580 df-oposet 39991 df-ol 39993 df-oml 39994 df-covers 40081 df-ats 40082 df-atl 40113 df-cvlat 40137 df-hlat 40166 df-llines 40313 df-lplanes 40314 df-lvols 40315 df-lines 40316 df-psubsp 40318 df-pmap 40319 df-padd 40611 df-lhyp 40803 df-laut 40804 df-ldil 40919 df-ltrn 40920 df-trl 40974

This theorem is used by: cdlemg2jlemOLDN 41408 cdlemg2fvlem 41409 cdlemg2klem 41410

W3C validator