cdleml9 - Mathbox for Norm Megill

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

Theorem cdleml9 36272

Description: Part of proof of Lemma L of [Crawley] p. 120. TODO: fix comment. (Contributed by NM, 11-Aug-2013.)

**Hypotheses**
Ref	Expression
cdleml6.b	⊢ 𝐵 = (Base‘𝐾)
cdleml6.j	⊢ ∨ = (join‘𝐾)
cdleml6.m	⊢ ∧ = (meet‘𝐾)
cdleml6.h	⊢ 𝐻 = (LHyp‘𝐾)
cdleml6.t	⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
cdleml6.r	⊢ 𝑅 = ((trL‘𝐾)‘𝑊)
cdleml6.p	⊢ 𝑄 = ((oc‘𝐾)‘𝑊)
cdleml6.z	⊢ 𝑍 = ((𝑄 ∨ (𝑅‘𝑏)) ∧ ((ℎ‘𝑄) ∨ (𝑅‘(𝑏 ∘ ^◡(𝑠‘ℎ)))))
cdleml6.y	⊢ 𝑌 = ((𝑄 ∨ (𝑅‘𝑔)) ∧ (𝑍 ∨ (𝑅‘(𝑔 ∘ ^◡𝑏))))
cdleml6.x	⊢ 𝑋 = (℩𝑧 ∈ 𝑇 ∀𝑏 ∈ 𝑇 ((𝑏 ≠ ( I ↾ 𝐵) ∧ (𝑅‘𝑏) ≠ (𝑅‘(𝑠‘ℎ)) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝑔)) → (𝑧‘𝑄) = 𝑌))
cdleml6.u	⊢ 𝑈 = (𝑔 ∈ 𝑇 ↦ if((𝑠‘ℎ) = ℎ, 𝑔, 𝑋))
cdleml6.e	⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊)
cdleml6.o	⊢ 0 = (𝑓 ∈ 𝑇 ↦ ( I ↾ 𝐵))

**Assertion**
Ref	Expression
cdleml9	⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (ℎ ∈ 𝑇 ∧ ℎ ≠ ( I ↾ 𝐵)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑠 ≠ 0 )) → 𝑈 ≠ 0 )

Distinct variable groups: 𝑔,𝑏,𝑧, ∧ ∨ ,𝑏,𝑔,𝑧 𝐵,𝑏,𝑓,𝑔,𝑧 ℎ,𝑏,𝑔,𝑧 𝑠,𝑏,𝑔,𝑧 𝐻,𝑏,𝑔,𝑧 𝐾,𝑏,𝑔,𝑧 𝑄,𝑏,𝑔,𝑧 𝑅,𝑏,𝑔,𝑧 𝑇,𝑏,𝑓,𝑔,𝑧 𝑊,𝑏,𝑔,𝑧 𝑧,𝑌 𝑔,𝑍 Allowed substitution hints: 𝐵(ℎ,𝑠) 𝑄(𝑓,ℎ,𝑠) 𝑅(𝑓,ℎ,𝑠) 𝑇(ℎ,𝑠) 𝑈(𝑧,𝑓,𝑔,ℎ,𝑠,𝑏) 𝐸(𝑧,𝑓,𝑔,ℎ,𝑠,𝑏) 𝐻(𝑓,ℎ,𝑠) ∨ (𝑓,ℎ,𝑠) 𝐾(𝑓,ℎ,𝑠) ∧ (𝑓,ℎ,𝑠) 𝑊(𝑓,ℎ,𝑠) 𝑋(𝑧,𝑓,𝑔,ℎ,𝑠,𝑏) 𝑌(𝑓,𝑔,ℎ,𝑠,𝑏) 0 (𝑧,𝑓,𝑔,ℎ,𝑠,𝑏) 𝑍(𝑧,𝑓,ℎ,𝑠,𝑏)

**Proof of Theorem cdleml9**
Step	Hyp	Ref	Expression
1		cdleml6.b	. . . 4 ⊢ 𝐵 = (Base‘𝐾)
2		cdleml6.h	. . . 4 ⊢ 𝐻 = (LHyp‘𝐾)
3		cdleml6.t	. . . 4 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
4		cdleml6.e	. . . 4 ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊)
5		cdleml6.o	. . . 4 ⊢ 0 = (𝑓 ∈ 𝑇 ↦ ( I ↾ 𝐵))
6	1, 2, 3, 4, 5	tendo1ne0 36116	. . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → ( I ↾ 𝑇) ≠ 0 )
7	6	3ad2ant1 1082	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (ℎ ∈ 𝑇 ∧ ℎ ≠ ( I ↾ 𝐵)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑠 ≠ 0 )) → ( I ↾ 𝑇) ≠ 0 )
8		cdleml6.j	. . . . . . 7 ⊢ ∨ = (join‘𝐾)
9		cdleml6.m	. . . . . . 7 ⊢ ∧ = (meet‘𝐾)
10		cdleml6.r	. . . . . . 7 ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)
11		cdleml6.p	. . . . . . 7 ⊢ 𝑄 = ((oc‘𝐾)‘𝑊)
12		cdleml6.z	. . . . . . 7 ⊢ 𝑍 = ((𝑄 ∨ (𝑅‘𝑏)) ∧ ((ℎ‘𝑄) ∨ (𝑅‘(𝑏 ∘ ^◡(𝑠‘ℎ)))))
13		cdleml6.y	. . . . . . 7 ⊢ 𝑌 = ((𝑄 ∨ (𝑅‘𝑔)) ∧ (𝑍 ∨ (𝑅‘(𝑔 ∘ ^◡𝑏))))
14		cdleml6.x	. . . . . . 7 ⊢ 𝑋 = (℩𝑧 ∈ 𝑇 ∀𝑏 ∈ 𝑇 ((𝑏 ≠ ( I ↾ 𝐵) ∧ (𝑅‘𝑏) ≠ (𝑅‘(𝑠‘ℎ)) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝑔)) → (𝑧‘𝑄) = 𝑌))
15		cdleml6.u	. . . . . . 7 ⊢ 𝑈 = (𝑔 ∈ 𝑇 ↦ if((𝑠‘ℎ) = ℎ, 𝑔, 𝑋))
16	1, 8, 9, 2, 3, 10, 11, 12, 13, 14, 15, 4, 5	cdleml8 36271	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (ℎ ∈ 𝑇 ∧ ℎ ≠ ( I ↾ 𝐵)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑠 ≠ 0 )) → (𝑈 ∘ 𝑠) = ( I ↾ 𝑇))
17	16	adantr 481	. . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (ℎ ∈ 𝑇 ∧ ℎ ≠ ( I ↾ 𝐵)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑠 ≠ 0 )) ∧ 𝑈 = 0 ) → (𝑈 ∘ 𝑠) = ( I ↾ 𝑇))
18		coeq1 5279	. . . . . 6 ⊢ (𝑈 = 0 → (𝑈 ∘ 𝑠) = ( 0 ∘ 𝑠))
19		simp1 1061	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (ℎ ∈ 𝑇 ∧ ℎ ≠ ( I ↾ 𝐵)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑠 ≠ 0 )) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
20		simp3l 1089	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (ℎ ∈ 𝑇 ∧ ℎ ≠ ( I ↾ 𝐵)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑠 ≠ 0 )) → 𝑠 ∈ 𝐸)
21	1, 2, 3, 4, 5	tendo0mul 36114	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑠 ∈ 𝐸) → ( 0 ∘ 𝑠) = 0 )
22	19, 20, 21	syl2anc 693	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (ℎ ∈ 𝑇 ∧ ℎ ≠ ( I ↾ 𝐵)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑠 ≠ 0 )) → ( 0 ∘ 𝑠) = 0 )
23	18, 22	sylan9eqr 2678	. . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (ℎ ∈ 𝑇 ∧ ℎ ≠ ( I ↾ 𝐵)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑠 ≠ 0 )) ∧ 𝑈 = 0 ) → (𝑈 ∘ 𝑠) = 0 )
24	17, 23	eqtr3d 2658	. . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (ℎ ∈ 𝑇 ∧ ℎ ≠ ( I ↾ 𝐵)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑠 ≠ 0 )) ∧ 𝑈 = 0 ) → ( I ↾ 𝑇) = 0 )
25	24	ex 450	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (ℎ ∈ 𝑇 ∧ ℎ ≠ ( I ↾ 𝐵)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑠 ≠ 0 )) → (𝑈 = 0 → ( I ↾ 𝑇) = 0 ))
26	25	necon3d 2815	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (ℎ ∈ 𝑇 ∧ ℎ ≠ ( I ↾ 𝐵)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑠 ≠ 0 )) → (( I ↾ 𝑇) ≠ 0 → 𝑈 ≠ 0 ))
27	7, 26	mpd 15	1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (ℎ ∈ 𝑇 ∧ ℎ ≠ ( I ↾ 𝐵)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑠 ≠ 0 )) → 𝑈 ≠ 0 )

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 384 ∧ w3a 1037 = wceq 1483 ∈ wcel 1990 ≠ wne 2794 ∀wral 2912 ifcif 4086 ↦ cmpt 4729 I cid 5023 ^◡ccnv 5113 ↾ cres 5116 ∘ ccom 5118 ‘cfv 5888 ℩crio 6610 (class class class)co 6650 Basecbs 15857 occoc 15949 joincjn 16944 meetcmee 16945 HLchlt 34637 LHypclh 35270 LTrncltrn 35387 trLctrl 35445 TEndoctendo 36040

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-rep 4771 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 ax-riotaBAD 34239

This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-fal 1489 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-nel 2898 df-ral 2917 df-rex 2918 df-reu 2919 df-rmo 2920 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-op 4184 df-uni 4437 df-iun 4522 df-iin 4523 df-br 4654 df-opab 4713 df-mpt 4730 df-id 5024 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-riota 6611 df-ov 6653 df-oprab 6654 df-mpt2 6655 df-1st 7168 df-2nd 7169 df-undef 7399 df-map 7859 df-preset 16928 df-poset 16946 df-plt 16958 df-lub 16974 df-glb 16975 df-join 16976 df-meet 16977 df-p0 17039 df-p1 17040 df-lat 17046 df-clat 17108 df-oposet 34463 df-ol 34465 df-oml 34466 df-covers 34553 df-ats 34554 df-atl 34585 df-cvlat 34609 df-hlat 34638 df-llines 34784 df-lplanes 34785 df-lvols 34786 df-lines 34787 df-psubsp 34789 df-pmap 34790 df-padd 35082 df-lhyp 35274 df-laut 35275 df-ldil 35390 df-ltrn 35391 df-trl 35446 df-tendo 36043

This theorem is referenced by: erngdvlem4 36279 erngdvlem4-rN 36287

W3C validator