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 41091

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 1143	. . 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 41090	. . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → (𝐹 ∈ 𝑇 ↔ ∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊 ∧ 𝐹 = 𝐺)))
14	13	3ad2ant1 1139	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝜑) → (𝐹 ∈ 𝑇 ↔ ∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊 ∧ 𝐹 = 𝐺)))
15	1, 14	mpbid 233	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝜑) → ∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊 ∧ 𝐹 = 𝐺))
16		simp11 1210	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝜑) ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴) ∧ (¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊 ∧ 𝐹 = 𝐺)) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
17		simp2l 1206	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝜑) ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴) ∧ (¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊 ∧ 𝐹 = 𝐺)) → 𝑝 ∈ 𝐴)
18		simp31 1216	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝜑) ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴) ∧ (¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊 ∧ 𝐹 = 𝐺)) → ¬ 𝑝 ≤ 𝑊)
19	17, 18	jca 516	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝜑) ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴) ∧ (¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊 ∧ 𝐹 = 𝐺)) → (𝑝 ∈ 𝐴 ∧ ¬ 𝑝 ≤ 𝑊))
20		simp2r 1207	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝜑) ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴) ∧ (¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊 ∧ 𝐹 = 𝐺)) → 𝑞 ∈ 𝐴)
21		simp32 1217	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝜑) ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴) ∧ (¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊 ∧ 𝐹 = 𝐺)) → ¬ 𝑞 ≤ 𝑊)
22	20, 21	jca 516	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝜑) ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴) ∧ (¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊 ∧ 𝐹 = 𝐺)) → (𝑞 ∈ 𝐴 ∧ ¬ 𝑞 ≤ 𝑊))
23		simp13 1212	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝜑) ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴) ∧ (¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊 ∧ 𝐹 = 𝐺)) → 𝜑)
24		cdlemg2ce.c	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑝 ∈ 𝐴 ∧ ¬ 𝑝 ≤ 𝑊) ∧ (𝑞 ∈ 𝐴 ∧ ¬ 𝑞 ≤ 𝑊)) ∧ 𝜑) → 𝜒)
25	16, 19, 22, 23, 24	syl31anc 1381	. . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝜑) ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴) ∧ (¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊 ∧ 𝐹 = 𝐺)) → 𝜒)
26		simp33 1218	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝜑) ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴) ∧ (¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊 ∧ 𝐹 = 𝐺)) → 𝐹 = 𝐺)
27		cdlemg2ce.p	. . . . . 6 ⊢ (𝐹 = 𝐺 → (𝜓 ↔ 𝜒))
28	26, 27	syl 17	. . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝜑) ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴) ∧ (¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊 ∧ 𝐹 = 𝐺)) → (𝜓 ↔ 𝜒))
29	25, 28	mpbird 258	. . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝜑) ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴) ∧ (¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊 ∧ 𝐹 = 𝐺)) → 𝜓)
30	29	3exp 1125	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝜑) → ((𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴) → ((¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊 ∧ 𝐹 = 𝐺) → 𝜓)))
31	30	rexlimdvv 3196	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝜑) → (∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊 ∧ 𝐹 = 𝐺) → 𝜓))
32	15, 31	mpd 15	1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝜑) → 𝜓)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 207 ∧ wa 396 ∧ w3a 1092 = wceq 1547 ∈ wcel 2119 ≠ wne 2935 ∀wral 3054 ∃wrex 3064 ⦋csb 3838 ifcif 4461 class class class wbr 5079 ↦ cmpt 5160 ‘cfv 6492 ℩crio 7319 (class class class)co 7363 Basecbs 17177 lecple 17225 joincjn 18275 meetcmee 18276 Atomscatm 39762 HLchlt 39849 LHypclh 40483 LTrncltrn 40600

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2712 ax-rep 5206 ax-sep 5225 ax-nul 5235 ax-pow 5301 ax-pr 5369 ax-un 7685 ax-riotaBAD 39452

This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2719 df-cleq 2732 df-clel 2815 df-nfc 2889 df-ne 2936 df-ral 3055 df-rex 3065 df-rmo 3345 df-reu 3346 df-rab 3393 df-v 3434 df-sbc 3731 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4269 df-if 4462 df-pw 4538 df-sn 4563 df-pr 4565 df-op 4569 df-uni 4846 df-iun 4930 df-iin 4931 df-br 5080 df-opab 5142 df-mpt 5161 df-id 5520 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7320 df-ov 7366 df-oprab 7367 df-mpo 7368 df-1st 7938 df-2nd 7939 df-undef 8220 df-map 8772 df-proset 18258 df-poset 18277 df-plt 18292 df-lub 18308 df-glb 18309 df-join 18310 df-meet 18311 df-p0 18387 df-p1 18388 df-lat 18396 df-clat 18463 df-oposet 39675 df-ol 39677 df-oml 39678 df-covers 39765 df-ats 39766 df-atl 39797 df-cvlat 39821 df-hlat 39850 df-llines 39997 df-lplanes 39998 df-lvols 39999 df-lines 40000 df-psubsp 40002 df-pmap 40003 df-padd 40295 df-lhyp 40487 df-laut 40488 df-ldil 40603 df-ltrn 40604 df-trl 40658

This theorem is referenced by: cdlemg2jlemOLDN 41092 cdlemg2fvlem 41093 cdlemg2klem 41094

W3C validator