cdlemg31b0a - Mathbox for Norm Megill

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

Theorem cdlemg31b0a 40223

Description: TODO: Fix comment. (Contributed by NM, 30-May-2013.)

**Hypotheses**
Ref	Expression
cdlemg12.l	⊢ ≤ = (le‘𝐾)
cdlemg12.j	⊢ ∨ = (join‘𝐾)
cdlemg12.m	⊢ ∧ = (meet‘𝐾)
cdlemg12.a	⊢ 𝐴 = (Atoms‘𝐾)
cdlemg12.h	⊢ 𝐻 = (LHyp‘𝐾)
cdlemg12.t	⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
cdlemg12b.r	⊢ 𝑅 = ((trL‘𝐾)‘𝑊)
cdlemg31.n	⊢ 𝑁 = ((𝑃 ∨ 𝑣) ∧ (𝑄 ∨ (𝑅‘𝐹)))

**Assertion**
Ref	Expression
cdlemg31b0a	⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹))) → (𝑁 ∈ 𝐴 ∨ 𝑁 = (0.‘𝐾)))

**Proof of Theorem cdlemg31b0a**
Step	Hyp	Ref	Expression
1		simp1l 1194	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹))) → 𝐾 ∈ HL)
2		simp21l 1287	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹))) → 𝑃 ∈ 𝐴)
3		simp23l 1291	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹))) → 𝑣 ∈ 𝐴)
4		simp22l 1289	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹))) → 𝑄 ∈ 𝐴)
5		simp1 1133	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹))) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
6		simp3l 1198	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹))) → 𝐹 ∈ 𝑇)
7		eqid 2725	. . . . 5 ⊢ (0.‘𝐾) = (0.‘𝐾)
8		cdlemg12.a	. . . . 5 ⊢ 𝐴 = (Atoms‘𝐾)
9		cdlemg12.h	. . . . 5 ⊢ 𝐻 = (LHyp‘𝐾)
10		cdlemg12.t	. . . . 5 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
11		cdlemg12b.r	. . . . 5 ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)
12	7, 8, 9, 10, 11	trlator0 39699	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) → ((𝑅‘𝐹) ∈ 𝐴 ∨ (𝑅‘𝐹) = (0.‘𝐾)))
13	5, 6, 12	syl2anc 582	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹))) → ((𝑅‘𝐹) ∈ 𝐴 ∨ (𝑅‘𝐹) = (0.‘𝐾)))
14		simp22 1204	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹))) → (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊))
15		cdlemg12.l	. . . . . . . 8 ⊢ ≤ = (le‘𝐾)
16	15, 9, 10, 11	trlle 39712	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) → (𝑅‘𝐹) ≤ 𝑊)
17	5, 6, 16	syl2anc 582	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹))) → (𝑅‘𝐹) ≤ 𝑊)
18	13, 17	jca 510	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹))) → (((𝑅‘𝐹) ∈ 𝐴 ∨ (𝑅‘𝐹) = (0.‘𝐾)) ∧ (𝑅‘𝐹) ≤ 𝑊))
19		simp23 1205	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹))) → (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊))
20		simp3r 1199	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹))) → 𝑣 ≠ (𝑅‘𝐹))
21	20	necomd 2986	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹))) → (𝑅‘𝐹) ≠ 𝑣)
22		cdlemg12.j	. . . . . 6 ⊢ ∨ = (join‘𝐾)
23	15, 22, 7, 8, 9	lhp2at0ne 39564	. . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ 𝑃 ∈ 𝐴) ∧ ((((𝑅‘𝐹) ∈ 𝐴 ∨ (𝑅‘𝐹) = (0.‘𝐾)) ∧ (𝑅‘𝐹) ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝑅‘𝐹) ≠ 𝑣) → (𝑄 ∨ (𝑅‘𝐹)) ≠ (𝑃 ∨ 𝑣))
24	5, 14, 2, 18, 19, 21, 23	syl321anc 1389	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹))) → (𝑄 ∨ (𝑅‘𝐹)) ≠ (𝑃 ∨ 𝑣))
25	24	necomd 2986	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹))) → (𝑃 ∨ 𝑣) ≠ (𝑄 ∨ (𝑅‘𝐹)))
26		cdlemg12.m	. . . 4 ⊢ ∧ = (meet‘𝐾)
27	22, 26, 7, 8	2at0mat0 39053	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ (𝑄 ∈ 𝐴 ∧ ((𝑅‘𝐹) ∈ 𝐴 ∨ (𝑅‘𝐹) = (0.‘𝐾)) ∧ (𝑃 ∨ 𝑣) ≠ (𝑄 ∨ (𝑅‘𝐹)))) → (((𝑃 ∨ 𝑣) ∧ (𝑄 ∨ (𝑅‘𝐹))) ∈ 𝐴 ∨ ((𝑃 ∨ 𝑣) ∧ (𝑄 ∨ (𝑅‘𝐹))) = (0.‘𝐾)))
28	1, 2, 3, 4, 13, 25, 27	syl33anc 1382	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹))) → (((𝑃 ∨ 𝑣) ∧ (𝑄 ∨ (𝑅‘𝐹))) ∈ 𝐴 ∨ ((𝑃 ∨ 𝑣) ∧ (𝑄 ∨ (𝑅‘𝐹))) = (0.‘𝐾)))
29		cdlemg31.n	. . . 4 ⊢ 𝑁 = ((𝑃 ∨ 𝑣) ∧ (𝑄 ∨ (𝑅‘𝐹)))
30	29	eleq1i 2816	. . 3 ⊢ (𝑁 ∈ 𝐴 ↔ ((𝑃 ∨ 𝑣) ∧ (𝑄 ∨ (𝑅‘𝐹))) ∈ 𝐴)
31	29	eqeq1i 2730	. . 3 ⊢ (𝑁 = (0.‘𝐾) ↔ ((𝑃 ∨ 𝑣) ∧ (𝑄 ∨ (𝑅‘𝐹))) = (0.‘𝐾))
32	30, 31	orbi12i 912	. 2 ⊢ ((𝑁 ∈ 𝐴 ∨ 𝑁 = (0.‘𝐾)) ↔ (((𝑃 ∨ 𝑣) ∧ (𝑄 ∨ (𝑅‘𝐹))) ∈ 𝐴 ∨ ((𝑃 ∨ 𝑣) ∧ (𝑄 ∨ (𝑅‘𝐹))) = (0.‘𝐾)))
33	28, 32	sylibr 233	1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹))) → (𝑁 ∈ 𝐴 ∨ 𝑁 = (0.‘𝐾)))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 394 ∨ wo 845 ∧ w3a 1084 = wceq 1533 ∈ wcel 2098 ≠ wne 2930 class class class wbr 5143 ‘cfv 6542 (class class class)co 7415 lecple 17237 joincjn 18300 meetcmee 18301 0.cp0 18412 Atomscatm 38790 HLchlt 38877 LHypclh 39512 LTrncltrn 39629 trLctrl 39686

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2696 ax-rep 5280 ax-sep 5294 ax-nul 5301 ax-pow 5359 ax-pr 5423 ax-un 7737

This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2528 df-eu 2557 df-clab 2703 df-cleq 2717 df-clel 2802 df-nfc 2877 df-ne 2931 df-ral 3052 df-rex 3061 df-rmo 3364 df-reu 3365 df-rab 3420 df-v 3465 df-sbc 3770 df-csb 3886 df-dif 3943 df-un 3945 df-in 3947 df-ss 3957 df-nul 4319 df-if 4525 df-pw 4600 df-sn 4625 df-pr 4627 df-op 4631 df-uni 4904 df-iun 4993 df-iin 4994 df-br 5144 df-opab 5206 df-mpt 5227 df-id 5570 df-xp 5678 df-rel 5679 df-cnv 5680 df-co 5681 df-dm 5682 df-rn 5683 df-res 5684 df-ima 5685 df-iota 6494 df-fun 6544 df-fn 6545 df-f 6546 df-f1 6547 df-fo 6548 df-f1o 6549 df-fv 6550 df-riota 7371 df-ov 7418 df-oprab 7419 df-mpo 7420 df-1st 7989 df-2nd 7990 df-map 8843 df-proset 18284 df-poset 18302 df-plt 18319 df-lub 18335 df-glb 18336 df-join 18337 df-meet 18338 df-p0 18414 df-p1 18415 df-lat 18421 df-clat 18488 df-oposet 38703 df-ol 38705 df-oml 38706 df-covers 38793 df-ats 38794 df-atl 38825 df-cvlat 38849 df-hlat 38878 df-llines 39026 df-psubsp 39031 df-pmap 39032 df-padd 39324 df-lhyp 39516 df-laut 39517 df-ldil 39632 df-ltrn 39633 df-trl 39687

This theorem is referenced by: cdlemg27b 40224 cdlemg33 40239

W3C validator