cdlemksat - Mathbox for Norm Megill

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

Theorem cdlemksat 36920

Description: Part of proof of Lemma K of [Crawley] p. 118. (Contributed by NM, 27-Jun-2013.)

**Hypotheses**
Ref	Expression
cdlemk.b	⊢ 𝐵 = (Base‘𝐾)
cdlemk.l	⊢ ≤ = (le‘𝐾)
cdlemk.j	⊢ ∨ = (join‘𝐾)
cdlemk.a	⊢ 𝐴 = (Atoms‘𝐾)
cdlemk.h	⊢ 𝐻 = (LHyp‘𝐾)
cdlemk.t	⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
cdlemk.r	⊢ 𝑅 = ((trL‘𝐾)‘𝑊)
cdlemk.m	⊢ ∧ = (meet‘𝐾)
cdlemk.s	⊢ 𝑆 = (𝑓 ∈ 𝑇 ↦ (℩𝑖 ∈ 𝑇 (𝑖‘𝑃) = ((𝑃 ∨ (𝑅‘𝑓)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝑓 ∘ ^◡𝐹))))))

**Assertion**
Ref	Expression
cdlemksat	⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑁 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) ∧ (𝐹 ≠ ( I ↾ 𝐵) ∧ 𝐺 ≠ ( I ↾ 𝐵) ∧ (𝑅‘𝐺) ≠ (𝑅‘𝐹))) → ((𝑆‘𝐺)‘𝑃) ∈ 𝐴)

Distinct variable groups: ∧ ,𝑓 ∨ ,𝑓 𝑓,𝐹,𝑖 𝑓,𝐺,𝑖 𝑓,𝑁 𝑃,𝑓 𝑅,𝑓 𝑇,𝑓 𝑓,𝑊 ∧ ,𝑖 ≤ ,𝑖 ∨ ,𝑖 𝐴,𝑖 𝑖,𝐹 𝑖,𝐻 𝑖,𝐾 𝑖,𝑁 𝑃,𝑖 𝑅,𝑖 𝑇,𝑖 𝑖,𝑊 Allowed substitution hints: 𝐴(𝑓) 𝐵(𝑓,𝑖) 𝑆(𝑓,𝑖) 𝐻(𝑓) 𝐾(𝑓) ≤ (𝑓)

**Proof of Theorem cdlemksat**
Step	Hyp	Ref	Expression
1		simp11 1264	. 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑁 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) ∧ (𝐹 ≠ ( I ↾ 𝐵) ∧ 𝐺 ≠ ( I ↾ 𝐵) ∧ (𝑅‘𝐺) ≠ (𝑅‘𝐹))) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
2		cdlemk.b	. . 3 ⊢ 𝐵 = (Base‘𝐾)
3		cdlemk.l	. . 3 ⊢ ≤ = (le‘𝐾)
4		cdlemk.j	. . 3 ⊢ ∨ = (join‘𝐾)
5		cdlemk.a	. . 3 ⊢ 𝐴 = (Atoms‘𝐾)
6		cdlemk.h	. . 3 ⊢ 𝐻 = (LHyp‘𝐾)
7		cdlemk.t	. . 3 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
8		cdlemk.r	. . 3 ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)
9		cdlemk.m	. . 3 ⊢ ∧ = (meet‘𝐾)
10		cdlemk.s	. . 3 ⊢ 𝑆 = (𝑓 ∈ 𝑇 ↦ (℩𝑖 ∈ 𝑇 (𝑖‘𝑃) = ((𝑃 ∨ (𝑅‘𝑓)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝑓 ∘ ^◡𝐹))))))
11	2, 3, 4, 5, 6, 7, 8, 9, 10	cdlemksel 36919	. 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑁 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) ∧ (𝐹 ≠ ( I ↾ 𝐵) ∧ 𝐺 ≠ ( I ↾ 𝐵) ∧ (𝑅‘𝐺) ≠ (𝑅‘𝐹))) → (𝑆‘𝐺) ∈ 𝑇)
12		simp22l 1395	. 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑁 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) ∧ (𝐹 ≠ ( I ↾ 𝐵) ∧ 𝐺 ≠ ( I ↾ 𝐵) ∧ (𝑅‘𝐺) ≠ (𝑅‘𝐹))) → 𝑃 ∈ 𝐴)
13	3, 5, 6, 7	ltrnat 36214	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆‘𝐺) ∈ 𝑇 ∧ 𝑃 ∈ 𝐴) → ((𝑆‘𝐺)‘𝑃) ∈ 𝐴)
14	1, 11, 12, 13	syl3anc 1494	1 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑁 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) ∧ (𝐹 ≠ ( I ↾ 𝐵) ∧ 𝐺 ≠ ( I ↾ 𝐵) ∧ (𝑅‘𝐺) ≠ (𝑅‘𝐹))) → ((𝑆‘𝐺)‘𝑃) ∈ 𝐴)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 386 ∧ w3a 1111 = wceq 1656 ∈ wcel 2164 ≠ wne 2999 class class class wbr 4875 ↦ cmpt 4954 I cid 5251 ^◡ccnv 5345 ↾ cres 5348 ∘ ccom 5350 ‘cfv 6127 ℩crio 6870 (class class class)co 6910 Basecbs 16229 lecple 16319 joincjn 17304 meetcmee 17305 Atomscatm 35337 HLchlt 35424 LHypclh 36058 LTrncltrn 36175 trLctrl 36232

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1894 ax-4 1908 ax-5 2009 ax-6 2075 ax-7 2112 ax-8 2166 ax-9 2173 ax-10 2192 ax-11 2207 ax-12 2220 ax-13 2389 ax-ext 2803 ax-rep 4996 ax-sep 5007 ax-nul 5015 ax-pow 5067 ax-pr 5129 ax-un 7214 ax-riotaBAD 35027

This theorem depends on definitions: df-bi 199 df-an 387 df-or 879 df-3or 1112 df-3an 1113 df-tru 1660 df-ex 1879 df-nf 1883 df-sb 2068 df-mo 2605 df-eu 2640 df-clab 2812 df-cleq 2818 df-clel 2821 df-nfc 2958 df-ne 3000 df-nel 3103 df-ral 3122 df-rex 3123 df-reu 3124 df-rmo 3125 df-rab 3126 df-v 3416 df-sbc 3663 df-csb 3758 df-dif 3801 df-un 3803 df-in 3805 df-ss 3812 df-nul 4147 df-if 4309 df-pw 4382 df-sn 4400 df-pr 4402 df-op 4406 df-uni 4661 df-iun 4744 df-iin 4745 df-br 4876 df-opab 4938 df-mpt 4955 df-id 5252 df-xp 5352 df-rel 5353 df-cnv 5354 df-co 5355 df-dm 5356 df-rn 5357 df-res 5358 df-ima 5359 df-iota 6090 df-fun 6129 df-fn 6130 df-f 6131 df-f1 6132 df-fo 6133 df-f1o 6134 df-fv 6135 df-riota 6871 df-ov 6913 df-oprab 6914 df-mpt2 6915 df-1st 7433 df-2nd 7434 df-undef 7669 df-map 8129 df-proset 17288 df-poset 17306 df-plt 17318 df-lub 17334 df-glb 17335 df-join 17336 df-meet 17337 df-p0 17399 df-p1 17400 df-lat 17406 df-clat 17468 df-oposet 35250 df-ol 35252 df-oml 35253 df-covers 35340 df-ats 35341 df-atl 35372 df-cvlat 35396 df-hlat 35425 df-llines 35572 df-lplanes 35573 df-lvols 35574 df-lines 35575 df-psubsp 35577 df-pmap 35578 df-padd 35870 df-lhyp 36062 df-laut 36063 df-ldil 36178 df-ltrn 36179 df-trl 36233

This theorem is referenced by: cdlemk7 36922 cdlemk11 36923 cdlemk12 36924 cdlemk14 36928 cdlemk15 36929

W3C validator