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 38340

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 1132	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑔 ∈ 𝑇)) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
2		simp3l 1197	. . . 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 37157	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))
8	1, 7	syl 17	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑔 ∈ 𝑇)) → (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))
9		simp2l 1195	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑔 ∈ 𝑇)) → (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊))
10		cdlemn8.t	. . . . . 6 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
11		cdlemn8.f	. . . . . 6 ⊢ 𝐹 = (℩ℎ ∈ 𝑇 (ℎ‘𝑃) = 𝑄)
12	3, 4, 5, 10, 11	ltrniotacl 37717	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → 𝐹 ∈ 𝑇)
13	1, 8, 9, 12	syl3anc 1367	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑔 ∈ 𝑇)) → 𝐹 ∈ 𝑇)
14		cdlemn8.e	. . . . 5 ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊)
15	5, 10, 14	tendocl 37905	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑠 ∈ 𝐸 ∧ 𝐹 ∈ 𝑇) → (𝑠‘𝐹) ∈ 𝑇)
16	1, 2, 13, 15	syl3anc 1367	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑔 ∈ 𝑇)) → (𝑠‘𝐹) ∈ 𝑇)
17		simp3r 1198	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑔 ∈ 𝑇)) → 𝑔 ∈ 𝑇)
18		cdlemn8.b	. . . . 5 ⊢ 𝐵 = (Base‘𝐾)
19		cdlemn8.o	. . . . 5 ⊢ 𝑂 = (ℎ ∈ 𝑇 ↦ ( I ↾ 𝐵))
20	18, 5, 10, 14, 19	tendo0cl 37928	. . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → 𝑂 ∈ 𝐸)
21	1, 20	syl 17	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑔 ∈ 𝑇)) → 𝑂 ∈ 𝐸)
22		cdlemn8.u	. . . 4 ⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊)
23		eqid 2823	. . . 4 ⊢ (Scalar‘𝑈) = (Scalar‘𝑈)
24		cdlemn8.s	. . . 4 ⊢ + = (+_g‘𝑈)
25		eqid 2823	. . . 4 ⊢ (+_g‘(Scalar‘𝑈)) = (+_g‘(Scalar‘𝑈))
26	5, 10, 14, 22, 23, 24, 25	dvhopvadd 38231	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑠‘𝐹) ∈ 𝑇 ∧ 𝑠 ∈ 𝐸) ∧ (𝑔 ∈ 𝑇 ∧ 𝑂 ∈ 𝐸)) → (⟨(𝑠‘𝐹), 𝑠⟩ + ⟨𝑔, 𝑂⟩) = ⟨((𝑠‘𝐹) ∘ 𝑔), (𝑠(+_g‘(Scalar‘𝑈))𝑂)⟩)
27	1, 16, 2, 17, 21, 26	syl122anc 1375	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑔 ∈ 𝑇)) → (⟨(𝑠‘𝐹), 𝑠⟩ + ⟨𝑔, 𝑂⟩) = ⟨((𝑠‘𝐹) ∘ 𝑔), (𝑠(+_g‘(Scalar‘𝑈))𝑂)⟩)
28		eqid 2823	. . . . . . 7 ⊢ (𝑡 ∈ 𝐸, 𝑢 ∈ 𝐸 ↦ (ℎ ∈ 𝑇 ↦ ((𝑡‘ℎ) ∘ (𝑢‘ℎ)))) = (𝑡 ∈ 𝐸, 𝑢 ∈ 𝐸 ↦ (ℎ ∈ 𝑇 ↦ ((𝑡‘ℎ) ∘ (𝑢‘ℎ))))
29	5, 10, 14, 22, 23, 28, 25	dvhfplusr 38222	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → (+_g‘(Scalar‘𝑈)) = (𝑡 ∈ 𝐸, 𝑢 ∈ 𝐸 ↦ (ℎ ∈ 𝑇 ↦ ((𝑡‘ℎ) ∘ (𝑢‘ℎ)))))
30	1, 29	syl 17	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑔 ∈ 𝑇)) → (+_g‘(Scalar‘𝑈)) = (𝑡 ∈ 𝐸, 𝑢 ∈ 𝐸 ↦ (ℎ ∈ 𝑇 ↦ ((𝑡‘ℎ) ∘ (𝑢‘ℎ)))))
31	30	oveqd 7175	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑔 ∈ 𝑇)) → (𝑠(+_g‘(Scalar‘𝑈))𝑂) = (𝑠(𝑡 ∈ 𝐸, 𝑢 ∈ 𝐸 ↦ (ℎ ∈ 𝑇 ↦ ((𝑡‘ℎ) ∘ (𝑢‘ℎ))))𝑂))
32	18, 5, 10, 14, 19, 28	tendo0plr 37930	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑠 ∈ 𝐸) → (𝑠(𝑡 ∈ 𝐸, 𝑢 ∈ 𝐸 ↦ (ℎ ∈ 𝑇 ↦ ((𝑡‘ℎ) ∘ (𝑢‘ℎ))))𝑂) = 𝑠)
33	1, 2, 32	syl2anc 586	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑔 ∈ 𝑇)) → (𝑠(𝑡 ∈ 𝐸, 𝑢 ∈ 𝐸 ↦ (ℎ ∈ 𝑇 ↦ ((𝑡‘ℎ) ∘ (𝑢‘ℎ))))𝑂) = 𝑠)
34	31, 33	eqtrd 2858	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑔 ∈ 𝑇)) → (𝑠(+_g‘(Scalar‘𝑈))𝑂) = 𝑠)
35	34	opeq2d 4812	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑔 ∈ 𝑇)) → ⟨((𝑠‘𝐹) ∘ 𝑔), (𝑠(+_g‘(Scalar‘𝑈))𝑂)⟩ = ⟨((𝑠‘𝐹) ∘ 𝑔), 𝑠⟩)
36	27, 35	eqtrd 2858	1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑔 ∈ 𝑇)) → (⟨(𝑠‘𝐹), 𝑠⟩ + ⟨𝑔, 𝑂⟩) = ⟨((𝑠‘𝐹) ∘ 𝑔), 𝑠⟩)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 398 ∧ w3a 1083 = wceq 1537 ∈ wcel 2114 ⟨cop 4575 class class class wbr 5068 ↦ cmpt 5148 I cid 5461 ↾ cres 5559 ∘ ccom 5561 ‘cfv 6357 ℩crio 7115 (class class class)co 7158 ∈ cmpo 7160 Basecbs 16485 +_gcplusg 16567 Scalarcsca 16570 lecple 16574 occoc 16575 Atomscatm 36401 HLchlt 36488 LHypclh 37122 LTrncltrn 37239 TEndoctendo 37890 DVecHcdvh 38216

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 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-rep 5192 ax-sep 5205 ax-nul 5212 ax-pow 5268 ax-pr 5332 ax-un 7463 ax-cnex 10595 ax-resscn 10596 ax-1cn 10597 ax-icn 10598 ax-addcl 10599 ax-addrcl 10600 ax-mulcl 10601 ax-mulrcl 10602 ax-mulcom 10603 ax-addass 10604 ax-mulass 10605 ax-distr 10606 ax-i2m1 10607 ax-1ne0 10608 ax-1rid 10609 ax-rnegex 10610 ax-rrecex 10611 ax-cnre 10612 ax-pre-lttri 10613 ax-pre-lttrn 10614 ax-pre-ltadd 10615 ax-pre-mulgt0 10616 ax-riotaBAD 36091

This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ne 3019 df-nel 3126 df-ral 3145 df-rex 3146 df-reu 3147 df-rmo 3148 df-rab 3149 df-v 3498 df-sbc 3775 df-csb 3886 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-pss 3956 df-nul 4294 df-if 4470 df-pw 4543 df-sn 4570 df-pr 4572 df-tp 4574 df-op 4576 df-uni 4841 df-int 4879 df-iun 4923 df-iin 4924 df-br 5069 df-opab 5131 df-mpt 5149 df-tr 5175 df-id 5462 df-eprel 5467 df-po 5476 df-so 5477 df-fr 5516 df-we 5518 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-rn 5568 df-res 5569 df-ima 5570 df-pred 6150 df-ord 6196 df-on 6197 df-lim 6198 df-suc 6199 df-iota 6316 df-fun 6359 df-fn 6360 df-f 6361 df-f1 6362 df-fo 6363 df-f1o 6364 df-fv 6365 df-riota 7116 df-ov 7161 df-oprab 7162 df-mpo 7163 df-om 7583 df-1st 7691 df-2nd 7692 df-undef 7941 df-wrecs 7949 df-recs 8010 df-rdg 8048 df-1o 8104 df-oadd 8108 df-er 8291 df-map 8410 df-en 8512 df-dom 8513 df-sdom 8514 df-fin 8515 df-pnf 10679 df-mnf 10680 df-xr 10681 df-ltxr 10682 df-le 10683 df-sub 10874 df-neg 10875 df-nn 11641 df-2 11703 df-3 11704 df-4 11705 df-5 11706 df-6 11707 df-n0 11901 df-z 11985 df-uz 12247 df-fz 12896 df-struct 16487 df-ndx 16488 df-slot 16489 df-base 16491 df-plusg 16580 df-mulr 16581 df-sca 16583 df-vsca 16584 df-proset 17540 df-poset 17558 df-plt 17570 df-lub 17586 df-glb 17587 df-join 17588 df-meet 17589 df-p0 17651 df-p1 17652 df-lat 17658 df-clat 17720 df-oposet 36314 df-ol 36316 df-oml 36317 df-covers 36404 df-ats 36405 df-atl 36436 df-cvlat 36460 df-hlat 36489 df-llines 36636 df-lplanes 36637 df-lvols 36638 df-lines 36639 df-psubsp 36641 df-pmap 36642 df-padd 36934 df-lhyp 37126 df-laut 37127 df-ldil 37242 df-ltrn 37243 df-trl 37297 df-tendo 37893 df-edring 37895 df-dvech 38217

This theorem is referenced by: cdlemn7 38341 dihordlem6 38351

W3C validator