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 40092

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 1195	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹))) → 𝐾 ∈ HL)
2		simp21l 1288	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹))) → 𝑃 ∈ 𝐴)
3		simp23l 1292	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹))) → 𝑣 ∈ 𝐴)
4		simp22l 1290	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹))) → 𝑄 ∈ 𝐴)
5		simp1 1134	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹))) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
6		simp3l 1199	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹))) → 𝐹 ∈ 𝑇)
7		eqid 2727	. . . . 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 39568	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) → ((𝑅‘𝐹) ∈ 𝐴 ∨ (𝑅‘𝐹) = (0.‘𝐾)))
13	5, 6, 12	syl2anc 583	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹))) → ((𝑅‘𝐹) ∈ 𝐴 ∨ (𝑅‘𝐹) = (0.‘𝐾)))
14		simp22 1205	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹))) → (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊))
15		cdlemg12.l	. . . . . . . 8 ⊢ ≤ = (le‘𝐾)
16	15, 9, 10, 11	trlle 39581	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) → (𝑅‘𝐹) ≤ 𝑊)
17	5, 6, 16	syl2anc 583	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹))) → (𝑅‘𝐹) ≤ 𝑊)
18	13, 17	jca 511	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹))) → (((𝑅‘𝐹) ∈ 𝐴 ∨ (𝑅‘𝐹) = (0.‘𝐾)) ∧ (𝑅‘𝐹) ≤ 𝑊))
19		simp23 1206	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹))) → (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊))
20		simp3r 1200	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹))) → 𝑣 ≠ (𝑅‘𝐹))
21	20	necomd 2991	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹))) → (𝑅‘𝐹) ≠ 𝑣)
22		cdlemg12.j	. . . . . 6 ⊢ ∨ = (join‘𝐾)
23	15, 22, 7, 8, 9	lhp2at0ne 39433	. . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ 𝑃 ∈ 𝐴) ∧ ((((𝑅‘𝐹) ∈ 𝐴 ∨ (𝑅‘𝐹) = (0.‘𝐾)) ∧ (𝑅‘𝐹) ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝑅‘𝐹) ≠ 𝑣) → (𝑄 ∨ (𝑅‘𝐹)) ≠ (𝑃 ∨ 𝑣))
24	5, 14, 2, 18, 19, 21, 23	syl321anc 1390	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹))) → (𝑄 ∨ (𝑅‘𝐹)) ≠ (𝑃 ∨ 𝑣))
25	24	necomd 2991	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹))) → (𝑃 ∨ 𝑣) ≠ (𝑄 ∨ (𝑅‘𝐹)))
26		cdlemg12.m	. . . 4 ⊢ ∧ = (meet‘𝐾)
27	22, 26, 7, 8	2at0mat0 38922	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ (𝑄 ∈ 𝐴 ∧ ((𝑅‘𝐹) ∈ 𝐴 ∨ (𝑅‘𝐹) = (0.‘𝐾)) ∧ (𝑃 ∨ 𝑣) ≠ (𝑄 ∨ (𝑅‘𝐹)))) → (((𝑃 ∨ 𝑣) ∧ (𝑄 ∨ (𝑅‘𝐹))) ∈ 𝐴 ∨ ((𝑃 ∨ 𝑣) ∧ (𝑄 ∨ (𝑅‘𝐹))) = (0.‘𝐾)))
28	1, 2, 3, 4, 13, 25, 27	syl33anc 1383	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹))) → (((𝑃 ∨ 𝑣) ∧ (𝑄 ∨ (𝑅‘𝐹))) ∈ 𝐴 ∨ ((𝑃 ∨ 𝑣) ∧ (𝑄 ∨ (𝑅‘𝐹))) = (0.‘𝐾)))
29		cdlemg31.n	. . . 4 ⊢ 𝑁 = ((𝑃 ∨ 𝑣) ∧ (𝑄 ∨ (𝑅‘𝐹)))
30	29	eleq1i 2819	. . 3 ⊢ (𝑁 ∈ 𝐴 ↔ ((𝑃 ∨ 𝑣) ∧ (𝑄 ∨ (𝑅‘𝐹))) ∈ 𝐴)
31	29	eqeq1i 2732	. . 3 ⊢ (𝑁 = (0.‘𝐾) ↔ ((𝑃 ∨ 𝑣) ∧ (𝑄 ∨ (𝑅‘𝐹))) = (0.‘𝐾))
32	30, 31	orbi12i 913	. 2 ⊢ ((𝑁 ∈ 𝐴 ∨ 𝑁 = (0.‘𝐾)) ↔ (((𝑃 ∨ 𝑣) ∧ (𝑄 ∨ (𝑅‘𝐹))) ∈ 𝐴 ∨ ((𝑃 ∨ 𝑣) ∧ (𝑄 ∨ (𝑅‘𝐹))) = (0.‘𝐾)))
33	28, 32	sylibr 233	1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹))) → (𝑁 ∈ 𝐴 ∨ 𝑁 = (0.‘𝐾)))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 ∨ wo 846 ∧ w3a 1085 = wceq 1534 ∈ wcel 2099 ≠ wne 2935 class class class wbr 5142 ‘cfv 6542 (class class class)co 7414 lecple 17225 joincjn 18288 meetcmee 18289 0.cp0 18400 Atomscatm 38659 HLchlt 38746 LHypclh 39381 LTrncltrn 39498 trLctrl 39555

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-10 2130 ax-11 2147 ax-12 2164 ax-ext 2698 ax-rep 5279 ax-sep 5293 ax-nul 5300 ax-pow 5359 ax-pr 5423 ax-un 7732

This theorem depends on definitions: df-bi 206 df-an 396 df-or 847 df-3an 1087 df-tru 1537 df-fal 1547 df-ex 1775 df-nf 1779 df-sb 2061 df-mo 2529 df-eu 2558 df-clab 2705 df-cleq 2719 df-clel 2805 df-nfc 2880 df-ne 2936 df-ral 3057 df-rex 3066 df-rmo 3371 df-reu 3372 df-rab 3428 df-v 3471 df-sbc 3775 df-csb 3890 df-dif 3947 df-un 3949 df-in 3951 df-ss 3961 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 5143 df-opab 5205 df-mpt 5226 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 7370 df-ov 7417 df-oprab 7418 df-mpo 7419 df-1st 7985 df-2nd 7986 df-map 8836 df-proset 18272 df-poset 18290 df-plt 18307 df-lub 18323 df-glb 18324 df-join 18325 df-meet 18326 df-p0 18402 df-p1 18403 df-lat 18409 df-clat 18476 df-oposet 38572 df-ol 38574 df-oml 38575 df-covers 38662 df-ats 38663 df-atl 38694 df-cvlat 38718 df-hlat 38747 df-llines 38895 df-psubsp 38900 df-pmap 38901 df-padd 39193 df-lhyp 39385 df-laut 39386 df-ldil 39501 df-ltrn 39502 df-trl 39556

This theorem is referenced by: cdlemg27b 40093 cdlemg33 40108

W3C validator