cdlemn6 - Mathbox for Norm Megill

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

Theorem cdlemn6 41462

Description: Part of proof of Lemma N of [Crawley] p. 121 line 35. (Contributed by NM, 26-Feb-2014.)

**Hypotheses**
Ref	Expression
cdlemn8.b	⊢ 𝐵 = (Base‘𝐾)
cdlemn8.l	⊢ ≤ = (le‘𝐾)
cdlemn8.a	⊢ 𝐴 = (Atoms‘𝐾)
cdlemn8.h	⊢ 𝐻 = (LHyp‘𝐾)
cdlemn8.p	⊢ 𝑃 = ((oc‘𝐾)‘𝑊)
cdlemn8.o	⊢ 𝑂 = (ℎ ∈ 𝑇 ↦ ( I ↾ 𝐵))
cdlemn8.t	⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
cdlemn8.e	⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊)
cdlemn8.u	⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊)
cdlemn8.s	⊢ + = (+_g‘𝑈)
cdlemn8.f	⊢ 𝐹 = (℩ℎ ∈ 𝑇 (ℎ‘𝑃) = 𝑄)

**Assertion**
Ref	Expression
cdlemn6	⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑔 ∈ 𝑇)) → (⟨(𝑠‘𝐹), 𝑠⟩ + ⟨𝑔, 𝑂⟩) = ⟨((𝑠‘𝐹) ∘ 𝑔), 𝑠⟩)

Distinct variable groups: ≤ ,ℎ 𝐴,ℎ 𝐵,ℎ ℎ,𝐻 ℎ,𝐾 𝑇,ℎ 𝑃,ℎ 𝑄,ℎ ℎ,𝑊 Allowed substitution hints: 𝐴(𝑔,𝑠) 𝐵(𝑔,𝑠) 𝑃(𝑔,𝑠) + (𝑔,ℎ,𝑠) 𝑄(𝑔,𝑠) 𝑅(𝑔,ℎ,𝑠) 𝑇(𝑔,𝑠) 𝑈(𝑔,ℎ,𝑠) 𝐸(𝑔,ℎ,𝑠) 𝐹(𝑔,ℎ,𝑠) 𝐻(𝑔,𝑠) 𝐾(𝑔,𝑠) ≤ (𝑔,𝑠) 𝑂(𝑔,ℎ,𝑠) 𝑊(𝑔,𝑠)

Proof of Theorem cdlemn6 Dummy variables 𝑡 𝑢 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		simp1 1136	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑔 ∈ 𝑇)) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
2		simp3l 1202	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑔 ∈ 𝑇)) → 𝑠 ∈ 𝐸)
3		cdlemn8.l	. . . . . . 7 ⊢ ≤ = (le‘𝐾)
4		cdlemn8.a	. . . . . . 7 ⊢ 𝐴 = (Atoms‘𝐾)
5		cdlemn8.h	. . . . . . 7 ⊢ 𝐻 = (LHyp‘𝐾)
6		cdlemn8.p	. . . . . . 7 ⊢ 𝑃 = ((oc‘𝐾)‘𝑊)
7	3, 4, 5, 6	lhpocnel2 40279	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))
8	1, 7	syl 17	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑔 ∈ 𝑇)) → (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))
9		simp2l 1200	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑔 ∈ 𝑇)) → (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊))
10		cdlemn8.t	. . . . . 6 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
11		cdlemn8.f	. . . . . 6 ⊢ 𝐹 = (℩ℎ ∈ 𝑇 (ℎ‘𝑃) = 𝑄)
12	3, 4, 5, 10, 11	ltrniotacl 40839	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → 𝐹 ∈ 𝑇)
13	1, 8, 9, 12	syl3anc 1373	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑔 ∈ 𝑇)) → 𝐹 ∈ 𝑇)
14		cdlemn8.e	. . . . 5 ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊)
15	5, 10, 14	tendocl 41027	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑠 ∈ 𝐸 ∧ 𝐹 ∈ 𝑇) → (𝑠‘𝐹) ∈ 𝑇)
16	1, 2, 13, 15	syl3anc 1373	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑔 ∈ 𝑇)) → (𝑠‘𝐹) ∈ 𝑇)
17		simp3r 1203	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑔 ∈ 𝑇)) → 𝑔 ∈ 𝑇)
18		cdlemn8.b	. . . . 5 ⊢ 𝐵 = (Base‘𝐾)
19		cdlemn8.o	. . . . 5 ⊢ 𝑂 = (ℎ ∈ 𝑇 ↦ ( I ↾ 𝐵))
20	18, 5, 10, 14, 19	tendo0cl 41050	. . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → 𝑂 ∈ 𝐸)
21	1, 20	syl 17	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑔 ∈ 𝑇)) → 𝑂 ∈ 𝐸)
22		cdlemn8.u	. . . 4 ⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊)
23		eqid 2736	. . . 4 ⊢ (Scalar‘𝑈) = (Scalar‘𝑈)
24		cdlemn8.s	. . . 4 ⊢ + = (+_g‘𝑈)
25		eqid 2736	. . . 4 ⊢ (+_g‘(Scalar‘𝑈)) = (+_g‘(Scalar‘𝑈))
26	5, 10, 14, 22, 23, 24, 25	dvhopvadd 41353	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑠‘𝐹) ∈ 𝑇 ∧ 𝑠 ∈ 𝐸) ∧ (𝑔 ∈ 𝑇 ∧ 𝑂 ∈ 𝐸)) → (⟨(𝑠‘𝐹), 𝑠⟩ + ⟨𝑔, 𝑂⟩) = ⟨((𝑠‘𝐹) ∘ 𝑔), (𝑠(+_g‘(Scalar‘𝑈))𝑂)⟩)
27	1, 16, 2, 17, 21, 26	syl122anc 1381	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑔 ∈ 𝑇)) → (⟨(𝑠‘𝐹), 𝑠⟩ + ⟨𝑔, 𝑂⟩) = ⟨((𝑠‘𝐹) ∘ 𝑔), (𝑠(+_g‘(Scalar‘𝑈))𝑂)⟩)
28		eqid 2736	. . . . . . 7 ⊢ (𝑡 ∈ 𝐸, 𝑢 ∈ 𝐸 ↦ (ℎ ∈ 𝑇 ↦ ((𝑡‘ℎ) ∘ (𝑢‘ℎ)))) = (𝑡 ∈ 𝐸, 𝑢 ∈ 𝐸 ↦ (ℎ ∈ 𝑇 ↦ ((𝑡‘ℎ) ∘ (𝑢‘ℎ))))
29	5, 10, 14, 22, 23, 28, 25	dvhfplusr 41344	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → (+_g‘(Scalar‘𝑈)) = (𝑡 ∈ 𝐸, 𝑢 ∈ 𝐸 ↦ (ℎ ∈ 𝑇 ↦ ((𝑡‘ℎ) ∘ (𝑢‘ℎ)))))
30	1, 29	syl 17	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑔 ∈ 𝑇)) → (+_g‘(Scalar‘𝑈)) = (𝑡 ∈ 𝐸, 𝑢 ∈ 𝐸 ↦ (ℎ ∈ 𝑇 ↦ ((𝑡‘ℎ) ∘ (𝑢‘ℎ)))))
31	30	oveqd 7375	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑔 ∈ 𝑇)) → (𝑠(+_g‘(Scalar‘𝑈))𝑂) = (𝑠(𝑡 ∈ 𝐸, 𝑢 ∈ 𝐸 ↦ (ℎ ∈ 𝑇 ↦ ((𝑡‘ℎ) ∘ (𝑢‘ℎ))))𝑂))
32	18, 5, 10, 14, 19, 28	tendo0plr 41052	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑠 ∈ 𝐸) → (𝑠(𝑡 ∈ 𝐸, 𝑢 ∈ 𝐸 ↦ (ℎ ∈ 𝑇 ↦ ((𝑡‘ℎ) ∘ (𝑢‘ℎ))))𝑂) = 𝑠)
33	1, 2, 32	syl2anc 584	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑔 ∈ 𝑇)) → (𝑠(𝑡 ∈ 𝐸, 𝑢 ∈ 𝐸 ↦ (ℎ ∈ 𝑇 ↦ ((𝑡‘ℎ) ∘ (𝑢‘ℎ))))𝑂) = 𝑠)
34	31, 33	eqtrd 2771	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑔 ∈ 𝑇)) → (𝑠(+_g‘(Scalar‘𝑈))𝑂) = 𝑠)
35	34	opeq2d 4836	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑔 ∈ 𝑇)) → ⟨((𝑠‘𝐹) ∘ 𝑔), (𝑠(+_g‘(Scalar‘𝑈))𝑂)⟩ = ⟨((𝑠‘𝐹) ∘ 𝑔), 𝑠⟩)
36	27, 35	eqtrd 2771	1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑔 ∈ 𝑇)) → (⟨(𝑠‘𝐹), 𝑠⟩ + ⟨𝑔, 𝑂⟩) = ⟨((𝑠‘𝐹) ∘ 𝑔), 𝑠⟩)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1541 ∈ wcel 2113 ⟨cop 4586 class class class wbr 5098 ↦ cmpt 5179 I cid 5518 ↾ cres 5626 ∘ ccom 5628 ‘cfv 6492 ℩crio 7314 (class class class)co 7358 ∈ cmpo 7360 Basecbs 17136 +_gcplusg 17177 Scalarcsca 17180 lecple 17184 occoc 17185 Atomscatm 39523 HLchlt 39610 LHypclh 40244 LTrncltrn 40361 TEndoctendo 41012 DVecHcdvh 41338

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-rep 5224 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-cnex 11082 ax-resscn 11083 ax-1cn 11084 ax-icn 11085 ax-addcl 11086 ax-addrcl 11087 ax-mulcl 11088 ax-mulrcl 11089 ax-mulcom 11090 ax-addass 11091 ax-mulass 11092 ax-distr 11093 ax-i2m1 11094 ax-1ne0 11095 ax-1rid 11096 ax-rnegex 11097 ax-rrecex 11098 ax-cnre 11099 ax-pre-lttri 11100 ax-pre-lttrn 11101 ax-pre-ltadd 11102 ax-pre-mulgt0 11103 ax-riotaBAD 39213

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3350 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-tp 4585 df-op 4587 df-uni 4864 df-iun 4948 df-iin 4949 df-br 5099 df-opab 5161 df-mpt 5180 df-tr 5206 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 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 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-1st 7933 df-2nd 7934 df-undef 8215 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-1o 8397 df-er 8635 df-map 8765 df-en 8884 df-dom 8885 df-sdom 8886 df-fin 8887 df-pnf 11168 df-mnf 11169 df-xr 11170 df-ltxr 11171 df-le 11172 df-sub 11366 df-neg 11367 df-nn 12146 df-2 12208 df-3 12209 df-4 12210 df-5 12211 df-6 12212 df-n0 12402 df-z 12489 df-uz 12752 df-fz 13424 df-struct 17074 df-slot 17109 df-ndx 17121 df-base 17137 df-plusg 17190 df-mulr 17191 df-sca 17193 df-vsca 17194 df-proset 18217 df-poset 18236 df-plt 18251 df-lub 18267 df-glb 18268 df-join 18269 df-meet 18270 df-p0 18346 df-p1 18347 df-lat 18355 df-clat 18422 df-oposet 39436 df-ol 39438 df-oml 39439 df-covers 39526 df-ats 39527 df-atl 39558 df-cvlat 39582 df-hlat 39611 df-llines 39758 df-lplanes 39759 df-lvols 39760 df-lines 39761 df-psubsp 39763 df-pmap 39764 df-padd 40056 df-lhyp 40248 df-laut 40249 df-ldil 40364 df-ltrn 40365 df-trl 40419 df-tendo 41015 df-edring 41017 df-dvech 41339

This theorem is referenced by: cdlemn7 41463 dihordlem6 41473

W3C validator