cdlemn11a - Mathbox for Norm Megill

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

Theorem cdlemn11a 42014

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

**Hypotheses**
Ref	Expression
cdlemn11a.b	⊢ 𝐵 = (Base‘𝐾)
cdlemn11a.l	⊢ ≤ = (le‘𝐾)
cdlemn11a.j	⊢ ∨ = (join‘𝐾)
cdlemn11a.a	⊢ 𝐴 = (Atoms‘𝐾)
cdlemn11a.h	⊢ 𝐻 = (LHyp‘𝐾)
cdlemn11a.p	⊢ 𝑃 = ((oc‘𝐾)‘𝑊)
cdlemn11a.o	⊢ 𝑂 = (ℎ ∈ 𝑇 ↦ ( I ↾ 𝐵))
cdlemn11a.t	⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
cdlemn11a.r	⊢ 𝑅 = ((trL‘𝐾)‘𝑊)
cdlemn11a.e	⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊)
cdlemn11a.i	⊢ 𝐼 = ((DIsoB‘𝐾)‘𝑊)
cdlemn11a.J	⊢ 𝐽 = ((DIsoC‘𝐾)‘𝑊)
cdlemn11a.u	⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊)
cdlemn11a.d	⊢ + = (+_g‘𝑈)
cdlemn11a.s	⊢ ⊕ = (LSSum‘𝑈)
cdlemn11a.f	⊢ 𝐹 = (℩ℎ ∈ 𝑇 (ℎ‘𝑃) = 𝑄)
cdlemn11a.g	⊢ 𝐺 = (℩ℎ ∈ 𝑇 (ℎ‘𝑃) = 𝑁)

**Assertion**
Ref	Expression
cdlemn11a	⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑁 ∈ 𝐴 ∧ ¬ 𝑁 ≤ 𝑊) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≤ 𝑊)) ∧ (𝐽‘𝑁) ⊆ ((𝐽‘𝑄) ⊕ (𝐼‘𝑋))) → ⟨𝐺, ( I ↾ 𝑇)⟩ ∈ (𝐽‘𝑁))

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

**Proof of Theorem cdlemn11a**
Step	Hyp	Ref	Expression
1		simp1 1154	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑁 ∈ 𝐴 ∧ ¬ 𝑁 ≤ 𝑊) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≤ 𝑊)) ∧ (𝐽‘𝑁) ⊆ ((𝐽‘𝑄) ⊕ (𝐼‘𝑋))) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
2		cdlemn11a.l	. . . . . . 7 ⊢ ≤ = (le‘𝐾)
3		cdlemn11a.a	. . . . . . 7 ⊢ 𝐴 = (Atoms‘𝐾)
4		cdlemn11a.h	. . . . . . 7 ⊢ 𝐻 = (LHyp‘𝐾)
5		cdlemn11a.p	. . . . . . 7 ⊢ 𝑃 = ((oc‘𝐾)‘𝑊)
6	2, 3, 4, 5	lhpocnel2 40826	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))
7	6	3ad2ant1 1151	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑁 ∈ 𝐴 ∧ ¬ 𝑁 ≤ 𝑊) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≤ 𝑊)) ∧ (𝐽‘𝑁) ⊆ ((𝐽‘𝑄) ⊕ (𝐼‘𝑋))) → (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))
8		simp22 1226	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑁 ∈ 𝐴 ∧ ¬ 𝑁 ≤ 𝑊) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≤ 𝑊)) ∧ (𝐽‘𝑁) ⊆ ((𝐽‘𝑄) ⊕ (𝐼‘𝑋))) → (𝑁 ∈ 𝐴 ∧ ¬ 𝑁 ≤ 𝑊))
9		cdlemn11a.t	. . . . . 6 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
10		cdlemn11a.g	. . . . . 6 ⊢ 𝐺 = (℩ℎ ∈ 𝑇 (ℎ‘𝑃) = 𝑁)
11	2, 3, 4, 9, 10	ltrniotacl 41386	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑁 ∈ 𝐴 ∧ ¬ 𝑁 ≤ 𝑊)) → 𝐺 ∈ 𝑇)
12	1, 7, 8, 11	syl3anc 1398	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑁 ∈ 𝐴 ∧ ¬ 𝑁 ≤ 𝑊) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≤ 𝑊)) ∧ (𝐽‘𝑁) ⊆ ((𝐽‘𝑄) ⊕ (𝐼‘𝑋))) → 𝐺 ∈ 𝑇)
13		fvresi 7175	. . . 4 ⊢ (𝐺 ∈ 𝑇 → (( I ↾ 𝑇)‘𝐺) = 𝐺)
14	12, 13	syl 18	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑁 ∈ 𝐴 ∧ ¬ 𝑁 ≤ 𝑊) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≤ 𝑊)) ∧ (𝐽‘𝑁) ⊆ ((𝐽‘𝑄) ⊕ (𝐼‘𝑋))) → (( I ↾ 𝑇)‘𝐺) = 𝐺)
15	14	eqcomd 2771	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑁 ∈ 𝐴 ∧ ¬ 𝑁 ≤ 𝑊) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≤ 𝑊)) ∧ (𝐽‘𝑁) ⊆ ((𝐽‘𝑄) ⊕ (𝐼‘𝑋))) → 𝐺 = (( I ↾ 𝑇)‘𝐺))
16		cdlemn11a.e	. . . 4 ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊)
17	4, 9, 16	tendoidcl 41576	. . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → ( I ↾ 𝑇) ∈ 𝐸)
18	17	3ad2ant1 1151	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑁 ∈ 𝐴 ∧ ¬ 𝑁 ≤ 𝑊) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≤ 𝑊)) ∧ (𝐽‘𝑁) ⊆ ((𝐽‘𝑄) ⊕ (𝐼‘𝑋))) → ( I ↾ 𝑇) ∈ 𝐸)
19		cdlemn11a.J	. . . 4 ⊢ 𝐽 = ((DIsoC‘𝐾)‘𝑊)
20		riotaex 7377	. . . . 5 ⊢ (℩ℎ ∈ 𝑇 (ℎ‘𝑃) = 𝑁) ∈ V
21	10, 20	eqeltri 2861	. . . 4 ⊢ 𝐺 ∈ V
22	9	fvexi 6899	. . . . 5 ⊢ 𝑇 ∈ V
23		resiexg 7911	. . . . 5 ⊢ (𝑇 ∈ V → ( I ↾ 𝑇) ∈ V)
24	22, 23	ax-mp 5	. . . 4 ⊢ ( I ↾ 𝑇) ∈ V
25	2, 3, 4, 5, 9, 16, 19, 10, 21, 24	dicopelval2 41988	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑁 ∈ 𝐴 ∧ ¬ 𝑁 ≤ 𝑊)) → (⟨𝐺, ( I ↾ 𝑇)⟩ ∈ (𝐽‘𝑁) ↔ (𝐺 = (( I ↾ 𝑇)‘𝐺) ∧ ( I ↾ 𝑇) ∈ 𝐸)))
26	1, 8, 25	syl2anc 596	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑁 ∈ 𝐴 ∧ ¬ 𝑁 ≤ 𝑊) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≤ 𝑊)) ∧ (𝐽‘𝑁) ⊆ ((𝐽‘𝑄) ⊕ (𝐼‘𝑋))) → (⟨𝐺, ( I ↾ 𝑇)⟩ ∈ (𝐽‘𝑁) ↔ (𝐺 = (( I ↾ 𝑇)‘𝐺) ∧ ( I ↾ 𝑇) ∈ 𝐸)))
27	15, 18, 26	mpbir2and 726	1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑁 ∈ 𝐴 ∧ ¬ 𝑁 ≤ 𝑊) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≤ 𝑊)) ∧ (𝐽‘𝑁) ⊆ ((𝐽‘𝑄) ⊕ (𝐼‘𝑋))) → ⟨𝐺, ( I ↾ 𝑇)⟩ ∈ (𝐽‘𝑁))

Colors of variables: wff setvar class

This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2146 Vcvv 3457 ⊆ wss 3906 ⟨cop 4597 class class class wbr 5111 ↦ cmpt 5194 I cid 5557 ↾ cres 5665 ‘cfv 6540 ℩crio 7372 (class class class)co 7416 Basecbs 17286 +_gcplusg 17327 lecple 17334 occoc 17335 joincjn 18384 LSSumclsm 19727 Atomscatm 40070 HLchlt 40157 LHypclh 40791 LTrncltrn 40908 trLctrl 40965 TEndoctendo 41559 DVecHcdvh 41885 DIsoBcdib 41945 DIsoCcdic 41979

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7738 ax-riotaBAD 39760

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3082 df-rex 3092 df-rmo 3371 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-iun 4960 df-iin 4961 df-br 5112 df-opab 5176 df-mpt 5195 df-id 5558 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7373 df-ov 7419 df-oprab 7420 df-mpo 7421 df-1st 7988 df-2nd 7989 df-undef 8271 df-map 8828 df-proset 18367 df-poset 18386 df-plt 18401 df-lub 18417 df-glb 18418 df-join 18419 df-meet 18420 df-p0 18496 df-p1 18497 df-lat 18505 df-clat 18572 df-oposet 39983 df-ol 39985 df-oml 39986 df-covers 40073 df-ats 40074 df-atl 40105 df-cvlat 40129 df-hlat 40158 df-llines 40305 df-lplanes 40306 df-lvols 40307 df-lines 40308 df-psubsp 40310 df-pmap 40311 df-padd 40603 df-lhyp 40795 df-laut 40796 df-ldil 40911 df-ltrn 40912 df-trl 40966 df-tendo 41562 df-dic 41980

This theorem is used by: cdlemn11b 42015

W3C validator