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 41645

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 2736	. . . . 5 ⊢ (+_g‘𝑈) = (+_g‘𝑈)
13	1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12	cdlemn4 41644	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → ⟨𝐺, ( I ↾ 𝑇)⟩ = (⟨𝐹, ( I ↾ 𝑇)⟩(+_g‘𝑈)⟨𝐽, 𝑂⟩))
14	13	sneqd 4579	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → {⟨𝐺, ( I ↾ 𝑇)⟩} = {(⟨𝐹, ( I ↾ 𝑇)⟩(+_g‘𝑈)⟨𝐽, 𝑂⟩)})
15	14	fveq2d 6844	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → (𝑁‘{⟨𝐺, ( I ↾ 𝑇)⟩}) = (𝑁‘{(⟨𝐹, ( I ↾ 𝑇)⟩(+_g‘𝑈)⟨𝐽, 𝑂⟩)}))
16		simp1 1137	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
17	5, 8, 16	dvhlmod 41556	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → 𝑈 ∈ LMod)
18	2, 3, 5, 4	lhpocnel2 40465	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))
19	18	3ad2ant1 1134	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))
20		simp2 1138	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊))
21	2, 3, 5, 6, 9	ltrniotacl 41025	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → 𝐹 ∈ 𝑇)
22	16, 19, 20, 21	syl3anc 1374	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → 𝐹 ∈ 𝑇)
23		eqid 2736	. . . . . 6 ⊢ ((TEndo‘𝐾)‘𝑊) = ((TEndo‘𝐾)‘𝑊)
24	5, 6, 23	tendoidcl 41215	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → ( I ↾ 𝑇) ∈ ((TEndo‘𝐾)‘𝑊))
25	24	3ad2ant1 1134	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → ( I ↾ 𝑇) ∈ ((TEndo‘𝐾)‘𝑊))
26		eqid 2736	. . . . 5 ⊢ (Base‘𝑈) = (Base‘𝑈)
27	5, 6, 23, 8, 26	dvhelvbasei 41534	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ ( I ↾ 𝑇) ∈ ((TEndo‘𝐾)‘𝑊))) → ⟨𝐹, ( I ↾ 𝑇)⟩ ∈ (Base‘𝑈))
28	16, 22, 25, 27	syl12anc 837	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → ⟨𝐹, ( I ↾ 𝑇)⟩ ∈ (Base‘𝑈))
29	2, 3, 5, 6, 11	ltrniotacl 41025	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → 𝐽 ∈ 𝑇)
30	1, 5, 6, 23, 7	tendo0cl 41236	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → 𝑂 ∈ ((TEndo‘𝐾)‘𝑊))
31	30	3ad2ant1 1134	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → 𝑂 ∈ ((TEndo‘𝐾)‘𝑊))
32	5, 6, 23, 8, 26	dvhelvbasei 41534	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐽 ∈ 𝑇 ∧ 𝑂 ∈ ((TEndo‘𝐾)‘𝑊))) → ⟨𝐽, 𝑂⟩ ∈ (Base‘𝑈))
33	16, 29, 31, 32	syl12anc 837	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → ⟨𝐽, 𝑂⟩ ∈ (Base‘𝑈))
34		cdlemn4a.n	. . . 4 ⊢ 𝑁 = (LSpan‘𝑈)
35		cdlemn4a.s	. . . 4 ⊢ ⊕ = (LSSum‘𝑈)
36	26, 12, 34, 35	lspsntri 21092	. . 3 ⊢ ((𝑈 ∈ LMod ∧ ⟨𝐹, ( I ↾ 𝑇)⟩ ∈ (Base‘𝑈) ∧ ⟨𝐽, 𝑂⟩ ∈ (Base‘𝑈)) → (𝑁‘{(⟨𝐹, ( I ↾ 𝑇)⟩(+_g‘𝑈)⟨𝐽, 𝑂⟩)}) ⊆ ((𝑁‘{⟨𝐹, ( I ↾ 𝑇)⟩}) ⊕ (𝑁‘{⟨𝐽, 𝑂⟩})))
37	17, 28, 33, 36	syl3anc 1374	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → (𝑁‘{(⟨𝐹, ( I ↾ 𝑇)⟩(+_g‘𝑈)⟨𝐽, 𝑂⟩)}) ⊆ ((𝑁‘{⟨𝐹, ( I ↾ 𝑇)⟩}) ⊕ (𝑁‘{⟨𝐽, 𝑂⟩})))
38	15, 37	eqsstrd 3956	1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) → (𝑁‘{⟨𝐺, ( I ↾ 𝑇)⟩}) ⊆ ((𝑁‘{⟨𝐹, ( I ↾ 𝑇)⟩}) ⊕ (𝑁‘{⟨𝐽, 𝑂⟩})))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ⊆ wss 3889 {csn 4567 ⟨cop 4573 class class class wbr 5085 ↦ cmpt 5166 I cid 5525 ↾ cres 5633 ‘cfv 6498 ℩crio 7323 (class class class)co 7367 Basecbs 17179 +_gcplusg 17220 lecple 17227 occoc 17228 LSSumclsm 19609 LModclmod 20855 LSpanclspn 20966 Atomscatm 39709 HLchlt 39796 LHypclh 40430 LTrncltrn 40547 TEndoctendo 41198 DVecHcdvh 41524

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 ax-riotaBAD 39399

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 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 3062 df-rmo 3342 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-pss 3909 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-tp 4572 df-op 4574 df-uni 4851 df-int 4890 df-iun 4935 df-iin 4936 df-br 5086 df-opab 5148 df-mpt 5167 df-tr 5193 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6265 df-ord 6326 df-on 6327 df-lim 6328 df-suc 6329 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-riota 7324 df-ov 7370 df-oprab 7371 df-mpo 7372 df-om 7818 df-1st 7942 df-2nd 7943 df-tpos 8176 df-undef 8223 df-frecs 8231 df-wrecs 8262 df-recs 8311 df-rdg 8349 df-1o 8405 df-er 8643 df-map 8775 df-en 8894 df-dom 8895 df-sdom 8896 df-fin 8897 df-pnf 11181 df-mnf 11182 df-xr 11183 df-ltxr 11184 df-le 11185 df-sub 11379 df-neg 11380 df-nn 12175 df-2 12244 df-3 12245 df-4 12246 df-5 12247 df-6 12248 df-n0 12438 df-z 12525 df-uz 12789 df-fz 13462 df-struct 17117 df-sets 17134 df-slot 17152 df-ndx 17164 df-base 17180 df-ress 17201 df-plusg 17233 df-mulr 17234 df-sca 17236 df-vsca 17237 df-0g 17404 df-proset 18260 df-poset 18279 df-plt 18294 df-lub 18310 df-glb 18311 df-join 18312 df-meet 18313 df-p0 18389 df-p1 18390 df-lat 18398 df-clat 18465 df-mgm 18608 df-sgrp 18687 df-mnd 18703 df-submnd 18752 df-grp 18912 df-minusg 18913 df-sbg 18914 df-subg 19099 df-cntz 19292 df-lsm 19611 df-cmn 19757 df-abl 19758 df-mgp 20122 df-rng 20134 df-ur 20163 df-ring 20216 df-oppr 20317 df-dvdsr 20337 df-unit 20338 df-invr 20368 df-dvr 20381 df-drng 20708 df-lmod 20857 df-lss 20927 df-lsp 20967 df-lvec 21098 df-oposet 39622 df-ol 39624 df-oml 39625 df-covers 39712 df-ats 39713 df-atl 39744 df-cvlat 39768 df-hlat 39797 df-llines 39944 df-lplanes 39945 df-lvols 39946 df-lines 39947 df-psubsp 39949 df-pmap 39950 df-padd 40242 df-lhyp 40434 df-laut 40435 df-ldil 40550 df-ltrn 40551 df-trl 40605 df-tendo 41201 df-edring 41203 df-dvech 41525

This theorem is referenced by: cdlemn5pre 41646

W3C validator