cdlemkuat - Mathbox for Norm Megill

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

Theorem cdlemkuat 42063

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

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

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

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

**Proof of Theorem cdlemkuat**
Step	Hyp	Ref	Expression
1		simp11 1222	. 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑅‘𝐹) = (𝑅‘𝑁) ∧ 𝐺 ∈ 𝑇) ∧ (𝐹 ∈ 𝑇 ∧ 𝐷 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ (((𝑅‘𝐷) ≠ (𝑅‘𝐹) ∧ (𝑅‘𝐷) ≠ (𝑅‘𝐺)) ∧ (𝐹 ≠ ( I ↾ 𝐵) ∧ 𝐺 ≠ ( I ↾ 𝐵) ∧ 𝐷 ≠ ( I ↾ 𝐵)) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
2		cdlemk1.b	. . 3 ⊢ 𝐵 = (Base‘𝐾)
3		cdlemk1.l	. . 3 ⊢ ≤ = (le‘𝐾)
4		cdlemk1.j	. . 3 ⊢ ∨ = (join‘𝐾)
5		cdlemk1.m	. . 3 ⊢ ∧ = (meet‘𝐾)
6		cdlemk1.a	. . 3 ⊢ 𝐴 = (Atoms‘𝐾)
7		cdlemk1.h	. . 3 ⊢ 𝐻 = (LHyp‘𝐾)
8		cdlemk1.t	. . 3 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
9		cdlemk1.r	. . 3 ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)
10		cdlemk1.s	. . 3 ⊢ 𝑆 = (𝑓 ∈ 𝑇 ↦ (℩𝑖 ∈ 𝑇 (𝑖‘𝑃) = ((𝑃 ∨ (𝑅‘𝑓)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝑓 ∘ ^◡𝐹))))))
11		cdlemk1.o	. . 3 ⊢ 𝑂 = (𝑆‘𝐷)
12		cdlemk1.u	. . 3 ⊢ 𝑈 = (𝑒 ∈ 𝑇 ↦ (℩𝑗 ∈ 𝑇 (𝑗‘𝑃) = ((𝑃 ∨ (𝑅‘𝑒)) ∧ ((𝑂‘𝑃) ∨ (𝑅‘(𝑒 ∘ ^◡𝐷))))))
13	2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12	cdlemkuel 42062	. 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑅‘𝐹) = (𝑅‘𝑁) ∧ 𝐺 ∈ 𝑇) ∧ (𝐹 ∈ 𝑇 ∧ 𝐷 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ (((𝑅‘𝐷) ≠ (𝑅‘𝐹) ∧ (𝑅‘𝐷) ≠ (𝑅‘𝐺)) ∧ (𝐹 ≠ ( I ↾ 𝐵) ∧ 𝐺 ≠ ( I ↾ 𝐵) ∧ 𝐷 ≠ ( I ↾ 𝐵)) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))) → (𝑈‘𝐺) ∈ 𝑇)
14		simp33l 1319	. 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑅‘𝐹) = (𝑅‘𝑁) ∧ 𝐺 ∈ 𝑇) ∧ (𝐹 ∈ 𝑇 ∧ 𝐷 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ (((𝑅‘𝐷) ≠ (𝑅‘𝐹) ∧ (𝑅‘𝐷) ≠ (𝑅‘𝐺)) ∧ (𝐹 ≠ ( I ↾ 𝐵) ∧ 𝐺 ≠ ( I ↾ 𝐵) ∧ 𝐷 ≠ ( I ↾ 𝐵)) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))) → 𝑃 ∈ 𝐴)
15	3, 6, 7, 8	ltrnat 41337	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑈‘𝐺) ∈ 𝑇 ∧ 𝑃 ∈ 𝐴) → ((𝑈‘𝐺)‘𝑃) ∈ 𝐴)
16	1, 13, 14, 15	syl3anc 1398	1 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑅‘𝐹) = (𝑅‘𝑁) ∧ 𝐺 ∈ 𝑇) ∧ (𝐹 ∈ 𝑇 ∧ 𝐷 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ (((𝑅‘𝐷) ≠ (𝑅‘𝐹) ∧ (𝑅‘𝐷) ≠ (𝑅‘𝐺)) ∧ (𝐹 ≠ ( I ↾ 𝐵) ∧ 𝐺 ≠ ( I ↾ 𝐵) ∧ 𝐷 ≠ ( I ↾ 𝐵)) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))) → ((𝑈‘𝐺)‘𝑃) ∈ 𝐴)

Colors of variables: wff setvar class

This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1569 ∈ wcel 2146 ≠ wne 2958 class class class wbr 5105 ↦ cmpt 5188 I cid 5548 ^◡ccnv 5653 ↾ cres 5656 ∘ ccom 5658 ‘cfv 6546 ℩crio 7383 (class class class)co 7427 Basecbs 17399 lecple 17447 joincjn 18497 meetcmee 18498 Atomscatm 40460 HLchlt 40547 LHypclh 41181 LTrncltrn 41298 trLctrl 41355

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2196 ax-12 2215 ax-ext 2735 ax-rep 5234 ax-sep 5251 ax-nul 5262 ax-pow 5330 ax-pr 5394 ax-un 7758 ax-riotaBAD 40150

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2101 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-op 4838 df-uni 4870 df-iun 4955 df-iin 4956 df-br 5106 df-opab 5170 df-mpt 5189 df-id 5549 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-rn 5665 df-res 5666 df-ima 5667 df-iota 6500 df-fun 6548 df-fn 6549 df-f 6550 df-f1 6551 df-fo 6552 df-f1o 6553 df-fv 6554 df-riota 7384 df-ov 7430 df-oprab 7431 df-mpo 7432 df-1st 8008 df-2nd 8009 df-undef 8301 df-map 8860 df-proset 18480 df-poset 18499 df-plt 18514 df-lub 18530 df-glb 18531 df-join 18532 df-meet 18533 df-p0 18609 df-p1 18610 df-lat 18618 df-clat 18685 df-oposet 40373 df-ol 40375 df-oml 40376 df-covers 40463 df-ats 40464 df-atl 40495 df-cvlat 40519 df-hlat 40548 df-llines 40695 df-lplanes 40696 df-lvols 40697 df-lines 40698 df-psubsp 40700 df-pmap 40701 df-padd 40993 df-lhyp 41185 df-laut 41186 df-ldil 41301 df-ltrn 41302 df-trl 41356

This theorem is used by: cdlemk7u 42067 cdlemk11u 42068 cdlemk12u 42069

W3C validator