cdlemn4a - Mathbox for Norm Megill

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

Theorem cdlemn4a 41371

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

**Hypotheses**
Ref	Expression
cdlemn4.b	⊢ 𝐵 = (Base‘𝐾)
cdlemn4.l	⊢ ≤ = (le‘𝐾)
cdlemn4.a	⊢ 𝐴 = (Atoms‘𝐾)
cdlemn4.p	⊢ 𝑃 = ((oc‘𝐾)‘𝑊)
cdlemn4.h	⊢ 𝐻 = (LHyp‘𝐾)
cdlemn4.t	⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
cdlemn4.o	⊢ 𝑂 = (ℎ ∈ 𝑇 ↦ ( I ↾ 𝐵))
cdlemn4.u	⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊)
cdlemn4.f	⊢ 𝐹 = (℩ℎ ∈ 𝑇 (ℎ‘𝑃) = 𝑄)
cdlemn4.g	⊢ 𝐺 = (℩ℎ ∈ 𝑇 (ℎ‘𝑃) = 𝑅)
cdlemn4.j	⊢ 𝐽 = (℩ℎ ∈ 𝑇 (ℎ‘𝑄) = 𝑅)
cdlemn4a.n	⊢ 𝑁 = (LSpan‘𝑈)
cdlemn4a.s	⊢ ⊕ = (LSSum‘𝑈)

**Assertion**
Ref	Expression
cdlemn4a	⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → (𝑁‘{⟨𝐺, ( I ↾ 𝑇)⟩}) ⊆ ((𝑁‘{⟨𝐹, ( I ↾ 𝑇)⟩}) ⊕ (𝑁‘{⟨𝐽, 𝑂⟩})))

Distinct variable groups: ≤ ,ℎ 𝐴,ℎ 𝐵,ℎ ℎ,𝐻 ℎ,𝐾 𝑃,ℎ 𝑄,ℎ 𝑅,ℎ 𝑇,ℎ ℎ,𝑊 Allowed substitution hints: ⊕ (ℎ) 𝑈(ℎ) 𝐹(ℎ) 𝐺(ℎ) 𝐽(ℎ) 𝑁(ℎ) 𝑂(ℎ)

**Proof of Theorem cdlemn4a**
Step	Hyp	Ref	Expression
1		cdlemn4.b	. . . . 5 ⊢ 𝐵 = (Base‘𝐾)
2		cdlemn4.l	. . . . 5 ⊢ ≤ = (le‘𝐾)
3		cdlemn4.a	. . . . 5 ⊢ 𝐴 = (Atoms‘𝐾)
4		cdlemn4.p	. . . . 5 ⊢ 𝑃 = ((oc‘𝐾)‘𝑊)
5		cdlemn4.h	. . . . 5 ⊢ 𝐻 = (LHyp‘𝐾)
6		cdlemn4.t	. . . . 5 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
7		cdlemn4.o	. . . . 5 ⊢ 𝑂 = (ℎ ∈ 𝑇 ↦ ( I ↾ 𝐵))
8		cdlemn4.u	. . . . 5 ⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊)
9		cdlemn4.f	. . . . 5 ⊢ 𝐹 = (℩ℎ ∈ 𝑇 (ℎ‘𝑃) = 𝑄)
10		cdlemn4.g	. . . . 5 ⊢ 𝐺 = (℩ℎ ∈ 𝑇 (ℎ‘𝑃) = 𝑅)
11		cdlemn4.j	. . . . 5 ⊢ 𝐽 = (℩ℎ ∈ 𝑇 (ℎ‘𝑄) = 𝑅)
12		eqid 2733	. . . . 5 ⊢ (+_g‘𝑈) = (+_g‘𝑈)
13	1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12	cdlemn4 41370	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → ⟨𝐺, ( I ↾ 𝑇)⟩ = (⟨𝐹, ( I ↾ 𝑇)⟩(+_g‘𝑈)⟨𝐽, 𝑂⟩))
14	13	sneqd 4589	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → {⟨𝐺, ( I ↾ 𝑇)⟩} = {(⟨𝐹, ( I ↾ 𝑇)⟩(+_g‘𝑈)⟨𝐽, 𝑂⟩)})
15	14	fveq2d 6835	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → (𝑁‘{⟨𝐺, ( I ↾ 𝑇)⟩}) = (𝑁‘{(⟨𝐹, ( I ↾ 𝑇)⟩(+_g‘𝑈)⟨𝐽, 𝑂⟩)}))
16		simp1 1136	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
17	5, 8, 16	dvhlmod 41282	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → 𝑈 ∈ LMod)
18	2, 3, 5, 4	lhpocnel2 40191	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))
19	18	3ad2ant1 1133	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))
20		simp2 1137	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊))
21	2, 3, 5, 6, 9	ltrniotacl 40751	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → 𝐹 ∈ 𝑇)
22	16, 19, 20, 21	syl3anc 1373	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → 𝐹 ∈ 𝑇)
23		eqid 2733	. . . . . 6 ⊢ ((TEndo‘𝐾)‘𝑊) = ((TEndo‘𝐾)‘𝑊)
24	5, 6, 23	tendoidcl 40941	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → ( I ↾ 𝑇) ∈ ((TEndo‘𝐾)‘𝑊))
25	24	3ad2ant1 1133	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → ( I ↾ 𝑇) ∈ ((TEndo‘𝐾)‘𝑊))
26		eqid 2733	. . . . 5 ⊢ (Base‘𝑈) = (Base‘𝑈)
27	5, 6, 23, 8, 26	dvhelvbasei 41260	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ ( I ↾ 𝑇) ∈ ((TEndo‘𝐾)‘𝑊))) → ⟨𝐹, ( I ↾ 𝑇)⟩ ∈ (Base‘𝑈))
28	16, 22, 25, 27	syl12anc 836	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → ⟨𝐹, ( I ↾ 𝑇)⟩ ∈ (Base‘𝑈))
29	2, 3, 5, 6, 11	ltrniotacl 40751	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → 𝐽 ∈ 𝑇)
30	1, 5, 6, 23, 7	tendo0cl 40962	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → 𝑂 ∈ ((TEndo‘𝐾)‘𝑊))
31	30	3ad2ant1 1133	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → 𝑂 ∈ ((TEndo‘𝐾)‘𝑊))
32	5, 6, 23, 8, 26	dvhelvbasei 41260	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐽 ∈ 𝑇 ∧ 𝑂 ∈ ((TEndo‘𝐾)‘𝑊))) → ⟨𝐽, 𝑂⟩ ∈ (Base‘𝑈))
33	16, 29, 31, 32	syl12anc 836	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → ⟨𝐽, 𝑂⟩ ∈ (Base‘𝑈))
34		cdlemn4a.n	. . . 4 ⊢ 𝑁 = (LSpan‘𝑈)
35		cdlemn4a.s	. . . 4 ⊢ ⊕ = (LSSum‘𝑈)
36	26, 12, 34, 35	lspsntri 21040	. . 3 ⊢ ((𝑈 ∈ LMod ∧ ⟨𝐹, ( I ↾ 𝑇)⟩ ∈ (Base‘𝑈) ∧ ⟨𝐽, 𝑂⟩ ∈ (Base‘𝑈)) → (𝑁‘{(⟨𝐹, ( I ↾ 𝑇)⟩(+_g‘𝑈)⟨𝐽, 𝑂⟩)}) ⊆ ((𝑁‘{⟨𝐹, ( I ↾ 𝑇)⟩}) ⊕ (𝑁‘{⟨𝐽, 𝑂⟩})))
37	17, 28, 33, 36	syl3anc 1373	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → (𝑁‘{(⟨𝐹, ( I ↾ 𝑇)⟩(+_g‘𝑈)⟨𝐽, 𝑂⟩)}) ⊆ ((𝑁‘{⟨𝐹, ( I ↾ 𝑇)⟩}) ⊕ (𝑁‘{⟨𝐽, 𝑂⟩})))
38	15, 37	eqsstrd 3965	1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → (𝑁‘{⟨𝐺, ( I ↾ 𝑇)⟩}) ⊆ ((𝑁‘{⟨𝐹, ( I ↾ 𝑇)⟩}) ⊕ (𝑁‘{⟨𝐽, 𝑂⟩})))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1541 ∈ wcel 2113 ⊆ wss 3898 {csn 4577 ⟨cop 4583 class class class wbr 5095 ↦ cmpt 5176 I cid 5515 ↾ cres 5623 ‘cfv 6489 ℩crio 7311 (class class class)co 7355 Basecbs 17127 +_gcplusg 17168 lecple 17175 occoc 17176 LSSumclsm 19554 LModclmod 20802 LSpanclspn 20913 Atomscatm 39435 HLchlt 39522 LHypclh 40156 LTrncltrn 40273 TEndoctendo 40924 DVecHcdvh 41250

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 2182 ax-ext 2705 ax-rep 5221 ax-sep 5238 ax-nul 5248 ax-pow 5307 ax-pr 5374 ax-un 7677 ax-cnex 11073 ax-resscn 11074 ax-1cn 11075 ax-icn 11076 ax-addcl 11077 ax-addrcl 11078 ax-mulcl 11079 ax-mulrcl 11080 ax-mulcom 11081 ax-addass 11082 ax-mulass 11083 ax-distr 11084 ax-i2m1 11085 ax-1ne0 11086 ax-1rid 11087 ax-rnegex 11088 ax-rrecex 11089 ax-cnre 11090 ax-pre-lttri 11091 ax-pre-lttrn 11092 ax-pre-ltadd 11093 ax-pre-mulgt0 11094 ax-riotaBAD 39125

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 2537 df-eu 2566 df-clab 2712 df-cleq 2725 df-clel 2808 df-nfc 2882 df-ne 2930 df-nel 3034 df-ral 3049 df-rex 3058 df-rmo 3347 df-reu 3348 df-rab 3397 df-v 3439 df-sbc 3738 df-csb 3847 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-pss 3918 df-nul 4283 df-if 4477 df-pw 4553 df-sn 4578 df-pr 4580 df-tp 4582 df-op 4584 df-uni 4861 df-int 4900 df-iun 4945 df-iin 4946 df-br 5096 df-opab 5158 df-mpt 5177 df-tr 5203 df-id 5516 df-eprel 5521 df-po 5529 df-so 5530 df-fr 5574 df-we 5576 df-xp 5627 df-rel 5628 df-cnv 5629 df-co 5630 df-dm 5631 df-rn 5632 df-res 5633 df-ima 5634 df-pred 6256 df-ord 6317 df-on 6318 df-lim 6319 df-suc 6320 df-iota 6445 df-fun 6491 df-fn 6492 df-f 6493 df-f1 6494 df-fo 6495 df-f1o 6496 df-fv 6497 df-riota 7312 df-ov 7358 df-oprab 7359 df-mpo 7360 df-om 7806 df-1st 7930 df-2nd 7931 df-tpos 8165 df-undef 8212 df-frecs 8220 df-wrecs 8251 df-recs 8300 df-rdg 8338 df-1o 8394 df-er 8631 df-map 8761 df-en 8880 df-dom 8881 df-sdom 8882 df-fin 8883 df-pnf 11159 df-mnf 11160 df-xr 11161 df-ltxr 11162 df-le 11163 df-sub 11357 df-neg 11358 df-nn 12137 df-2 12199 df-3 12200 df-4 12201 df-5 12202 df-6 12203 df-n0 12393 df-z 12480 df-uz 12743 df-fz 13415 df-struct 17065 df-sets 17082 df-slot 17100 df-ndx 17112 df-base 17128 df-ress 17149 df-plusg 17181 df-mulr 17182 df-sca 17184 df-vsca 17185 df-0g 17352 df-proset 18208 df-poset 18227 df-plt 18242 df-lub 18258 df-glb 18259 df-join 18260 df-meet 18261 df-p0 18337 df-p1 18338 df-lat 18346 df-clat 18413 df-mgm 18556 df-sgrp 18635 df-mnd 18651 df-submnd 18700 df-grp 18857 df-minusg 18858 df-sbg 18859 df-subg 19044 df-cntz 19237 df-lsm 19556 df-cmn 19702 df-abl 19703 df-mgp 20067 df-rng 20079 df-ur 20108 df-ring 20161 df-oppr 20264 df-dvdsr 20284 df-unit 20285 df-invr 20315 df-dvr 20328 df-drng 20655 df-lmod 20804 df-lss 20874 df-lsp 20914 df-lvec 21046 df-oposet 39348 df-ol 39350 df-oml 39351 df-covers 39438 df-ats 39439 df-atl 39470 df-cvlat 39494 df-hlat 39523 df-llines 39670 df-lplanes 39671 df-lvols 39672 df-lines 39673 df-psubsp 39675 df-pmap 39676 df-padd 39968 df-lhyp 40160 df-laut 40161 df-ldil 40276 df-ltrn 40277 df-trl 40331 df-tendo 40927 df-edring 40929 df-dvech 41251

This theorem is referenced by: cdlemn5pre 41372

W3C validator