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 42244

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 41056	. . . . . 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 41616	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑁 ∈ 𝐴 ∧ ¬ 𝑁 ≤ 𝑊)) → 𝐺 ∈ 𝑇)
12	1, 7, 8, 11	syl3anc 1398	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑁 ∈ 𝐴 ∧ ¬ 𝑁 ≤ 𝑊) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≤ 𝑊)) ∧ (𝐽‘𝑁) ⊆ ((𝐽‘𝑄) ⊕ (𝐼‘𝑋))) → 𝐺 ∈ 𝑇)
13		fvresi 7176	. . . 4 ⊢ (𝐺 ∈ 𝑇 → (( I ↾ 𝑇)‘𝐺) = 𝐺)
14	12, 13	syl 18	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑁 ∈ 𝐴 ∧ ¬ 𝑁 ≤ 𝑊) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≤ 𝑊)) ∧ (𝐽‘𝑁) ⊆ ((𝐽‘𝑄) ⊕ (𝐼‘𝑋))) → (( I ↾ 𝑇)‘𝐺) = 𝐺)
15	14	eqcomd 2767	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑁 ∈ 𝐴 ∧ ¬ 𝑁 ≤ 𝑊) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≤ 𝑊)) ∧ (𝐽‘𝑁) ⊆ ((𝐽‘𝑄) ⊕ (𝐼‘𝑋))) → 𝐺 = (( I ↾ 𝑇)‘𝐺))
16		cdlemn11a.e	. . . 4 ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊)
17	4, 9, 16	tendoidcl 41806	. . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → ( I ↾ 𝑇) ∈ 𝐸)
18	17	3ad2ant1 1151	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑁 ∈ 𝐴 ∧ ¬ 𝑁 ≤ 𝑊) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≤ 𝑊)) ∧ (𝐽‘𝑁) ⊆ ((𝐽‘𝑄) ⊕ (𝐼‘𝑋))) → ( I ↾ 𝑇) ∈ 𝐸)
19		cdlemn11a.J	. . . 4 ⊢ 𝐽 = ((DIsoC‘𝐾)‘𝑊)
20		riotaex 7379	. . . . 5 ⊢ (℩ℎ ∈ 𝑇 (ℎ‘𝑃) = 𝑁) ∈ V
21	10, 20	eqeltri 2857	. . . 4 ⊢ 𝐺 ∈ V
22	9	fvexi 6897	. . . . 5 ⊢ 𝑇 ∈ V
23		resiexg 7922	. . . . 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 42218	. . 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 2145 Vcvv 3451 ⊆ wss 3899 ⟨cop 4590 class class class wbr 5103 ↦ cmpt 5186 I cid 5545 ↾ cres 5653 ‘cfv 6537 ℩crio 7374 (class class class)co 7418 Basecbs 17380 +_gcplusg 17421 lecple 17428 occoc 17429 joincjn 18478 LSSumclsm 19841 Atomscatm 40300 HLchlt 40387 LHypclh 41021 LTrncltrn 41138 trLctrl 41195 TEndoctendo 41789 DVecHcdvh 42115 DIsoBcdib 42175 DIsoCcdic 42209

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 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7749 ax-riotaBAD 39990

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 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-iin 4954 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7375 df-ov 7421 df-oprab 7422 df-mpo 7423 df-1st 7999 df-2nd 8000 df-undef 8283 df-map 8842 df-proset 18461 df-poset 18480 df-plt 18495 df-lub 18511 df-glb 18512 df-join 18513 df-meet 18514 df-p0 18590 df-p1 18591 df-lat 18599 df-clat 18666 df-oposet 40213 df-ol 40215 df-oml 40216 df-covers 40303 df-ats 40304 df-atl 40335 df-cvlat 40359 df-hlat 40388 df-llines 40535 df-lplanes 40536 df-lvols 40537 df-lines 40538 df-psubsp 40540 df-pmap 40541 df-padd 40833 df-lhyp 41025 df-laut 41026 df-ldil 41141 df-ltrn 41142 df-trl 41196 df-tendo 41792 df-dic 42210

This theorem is used by: cdlemn11b 42245

W3C validator