cdlemkyu - Mathbox for Norm Megill

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

Theorem cdlemkyu 40965

Description: Convert between function and explicit forms. 𝐶 represents 𝑍 in cdlemkuu 40933. TODO: Clean all this up. (Contributed by NM, 21-Jul-2013.)

**Hypotheses**
Ref	Expression
cdlemk5.b	⊢ 𝐵 = (Base‘𝐾)
cdlemk5.l	⊢ ≤ = (le‘𝐾)
cdlemk5.j	⊢ ∨ = (join‘𝐾)
cdlemk5.m	⊢ ∧ = (meet‘𝐾)
cdlemk5.a	⊢ 𝐴 = (Atoms‘𝐾)
cdlemk5.h	⊢ 𝐻 = (LHyp‘𝐾)
cdlemk5.t	⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
cdlemk5.r	⊢ 𝑅 = ((trL‘𝐾)‘𝑊)
cdlemk5.z	⊢ 𝑍 = ((𝑃 ∨ (𝑅‘𝑏)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝑏 ∘ ^◡𝐹))))
cdlemk5.y	⊢ 𝑌 = ((𝑃 ∨ (𝑅‘𝑔)) ∧ (𝑍 ∨ (𝑅‘(𝑔 ∘ ^◡𝑏))))
cdlemk5b.s	⊢ 𝑆 = (𝑓 ∈ 𝑇 ↦ (℩𝑖 ∈ 𝑇 (𝑖‘𝑃) = ((𝑃 ∨ (𝑅‘𝑓)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝑓 ∘ ^◡𝐹))))))
cdlemk5b.u1	⊢ 𝑉 = (𝑑 ∈ 𝑇, 𝑒 ∈ 𝑇 ↦ (℩𝑗 ∈ 𝑇 (𝑗‘𝑃) = ((𝑃 ∨ (𝑅‘𝑒)) ∧ (((𝑆‘𝑑)‘𝑃) ∨ (𝑅‘(𝑒 ∘ ^◡𝑑))))))
cdlemk5.o2	⊢ 𝑄 = (𝑆‘𝑏)
cdlemk5.u2	⊢ 𝐶 = (𝑒 ∈ 𝑇 ↦ (℩𝑗 ∈ 𝑇 (𝑗‘𝑃) = ((𝑃 ∨ (𝑅‘𝑒)) ∧ ((𝑄‘𝑃) ∨ (𝑅‘(𝑒 ∘ ^◡𝑏))))))

**Assertion**
Ref	Expression
cdlemkyu	⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐹 ≠ ( I ↾ 𝐵)) ∧ (𝐺 ∈ 𝑇 ∧ 𝐺 ≠ ( I ↾ 𝐵))) ∧ (𝑁 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) ∧ (𝑏 ∈ 𝑇 ∧ (𝑏 ≠ ( I ↾ 𝐵) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝐹) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝐺)))) → ⦋𝐺 / 𝑔⦌𝑌 = ((𝐶‘𝐺)‘𝑃))

Distinct variable groups: ∧ ,𝑔 ∨ ,𝑔 𝐵,𝑔 𝑃,𝑔 𝑅,𝑔 𝑇,𝑔 𝑔,𝑍 𝑔,𝑏 𝑔,𝐺,𝑑,𝑒 𝑓,𝑔,𝑖,𝑗 𝑒,𝑑,𝑓,𝑖,𝑗, ∧ ≤ ,𝑖,𝑗 ∨ ,𝑑,𝑒,𝑓,𝑖,𝑗 𝐴,𝑖,𝑗 𝑓,𝐹,𝑖,𝑗 𝐺,𝑑,𝑒,𝑗 𝑖,𝐻,𝑗 𝑖,𝐾,𝑗 𝑓,𝑁,𝑖,𝑗 𝑃,𝑑,𝑒,𝑓,𝑖,𝑗 𝑅,𝑑,𝑒,𝑓,𝑖,𝑗 𝑏,𝑑,𝑒,𝑗,𝑆 𝑇,𝑑,𝑒,𝑓,𝑖,𝑗 𝑊,𝑑,𝑒,𝑓,𝑖,𝑗 𝑓,𝑏,𝑖 𝑄,𝑑,𝑒 Allowed substitution hints: 𝐴(𝑒,𝑓,𝑔,𝑏,𝑑) 𝐵(𝑒,𝑓,𝑖,𝑗,𝑏,𝑑) 𝐶(𝑒,𝑓,𝑔,𝑖,𝑗,𝑏,𝑑) 𝑃(𝑏) 𝑄(𝑓,𝑔,𝑖,𝑗,𝑏) 𝑅(𝑏) 𝑆(𝑓,𝑔,𝑖) 𝑇(𝑏) 𝐹(𝑒,𝑔,𝑏,𝑑) 𝐺(𝑓,𝑖,𝑏) 𝐻(𝑒,𝑓,𝑔,𝑏,𝑑) ∨ (𝑏) 𝐾(𝑒,𝑓,𝑔,𝑏,𝑑) ≤ (𝑒,𝑓,𝑔,𝑏,𝑑) ∧ (𝑏) 𝑁(𝑒,𝑔,𝑏,𝑑) 𝑉(𝑒,𝑓,𝑔,𝑖,𝑗,𝑏,𝑑) 𝑊(𝑔,𝑏) 𝑌(𝑒,𝑓,𝑔,𝑖,𝑗,𝑏,𝑑) 𝑍(𝑒,𝑓,𝑖,𝑗,𝑏,𝑑)

**Proof of Theorem cdlemkyu**
Step	Hyp	Ref	Expression
1		cdlemk5.b	. . 3 ⊢ 𝐵 = (Base‘𝐾)
2		cdlemk5.l	. . 3 ⊢ ≤ = (le‘𝐾)
3		cdlemk5.j	. . 3 ⊢ ∨ = (join‘𝐾)
4		cdlemk5.m	. . 3 ⊢ ∧ = (meet‘𝐾)
5		cdlemk5.a	. . 3 ⊢ 𝐴 = (Atoms‘𝐾)
6		cdlemk5.h	. . 3 ⊢ 𝐻 = (LHyp‘𝐾)
7		cdlemk5.t	. . 3 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
8		cdlemk5.r	. . 3 ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)
9		cdlemk5.z	. . 3 ⊢ 𝑍 = ((𝑃 ∨ (𝑅‘𝑏)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝑏 ∘ ^◡𝐹))))
10		cdlemk5.y	. . 3 ⊢ 𝑌 = ((𝑃 ∨ (𝑅‘𝑔)) ∧ (𝑍 ∨ (𝑅‘(𝑔 ∘ ^◡𝑏))))
11		cdlemk5b.s	. . 3 ⊢ 𝑆 = (𝑓 ∈ 𝑇 ↦ (℩𝑖 ∈ 𝑇 (𝑖‘𝑃) = ((𝑃 ∨ (𝑅‘𝑓)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝑓 ∘ ^◡𝐹))))))
12		cdlemk5b.u1	. . 3 ⊢ 𝑉 = (𝑑 ∈ 𝑇, 𝑒 ∈ 𝑇 ↦ (℩𝑗 ∈ 𝑇 (𝑗‘𝑃) = ((𝑃 ∨ (𝑅‘𝑒)) ∧ (((𝑆‘𝑑)‘𝑃) ∨ (𝑅‘(𝑒 ∘ ^◡𝑑))))))
13	1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12	cdlemky 40964	. 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐹 ≠ ( I ↾ 𝐵)) ∧ (𝐺 ∈ 𝑇 ∧ 𝐺 ≠ ( I ↾ 𝐵))) ∧ (𝑁 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) ∧ (𝑏 ∈ 𝑇 ∧ (𝑏 ≠ ( I ↾ 𝐵) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝐹) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝐺)))) → ⦋𝐺 / 𝑔⦌𝑌 = ((𝑏𝑉𝐺)‘𝑃))
14		simp3l 1202	. . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐹 ≠ ( I ↾ 𝐵)) ∧ (𝐺 ∈ 𝑇 ∧ 𝐺 ≠ ( I ↾ 𝐵))) ∧ (𝑁 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) ∧ (𝑏 ∈ 𝑇 ∧ (𝑏 ≠ ( I ↾ 𝐵) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝐹) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝐺)))) → 𝑏 ∈ 𝑇)
15		simp13l 1289	. . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐹 ≠ ( I ↾ 𝐵)) ∧ (𝐺 ∈ 𝑇 ∧ 𝐺 ≠ ( I ↾ 𝐵))) ∧ (𝑁 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) ∧ (𝑏 ∈ 𝑇 ∧ (𝑏 ≠ ( I ↾ 𝐵) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝐹) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝐺)))) → 𝐺 ∈ 𝑇)
16		cdlemk5.o2	. . . . 5 ⊢ 𝑄 = (𝑆‘𝑏)
17		cdlemk5.u2	. . . . 5 ⊢ 𝐶 = (𝑒 ∈ 𝑇 ↦ (℩𝑗 ∈ 𝑇 (𝑗‘𝑃) = ((𝑃 ∨ (𝑅‘𝑒)) ∧ ((𝑄‘𝑃) ∨ (𝑅‘(𝑒 ∘ ^◡𝑏))))))
18	1, 2, 3, 4, 5, 6, 7, 8, 11, 12, 16, 17	cdlemkuu 40933	. . . 4 ⊢ ((𝑏 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) → (𝑏𝑉𝐺) = (𝐶‘𝐺))
19	14, 15, 18	syl2anc 584	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐹 ≠ ( I ↾ 𝐵)) ∧ (𝐺 ∈ 𝑇 ∧ 𝐺 ≠ ( I ↾ 𝐵))) ∧ (𝑁 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) ∧ (𝑏 ∈ 𝑇 ∧ (𝑏 ≠ ( I ↾ 𝐵) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝐹) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝐺)))) → (𝑏𝑉𝐺) = (𝐶‘𝐺))
20	19	fveq1d 6824	. 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐹 ≠ ( I ↾ 𝐵)) ∧ (𝐺 ∈ 𝑇 ∧ 𝐺 ≠ ( I ↾ 𝐵))) ∧ (𝑁 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) ∧ (𝑏 ∈ 𝑇 ∧ (𝑏 ≠ ( I ↾ 𝐵) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝐹) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝐺)))) → ((𝑏𝑉𝐺)‘𝑃) = ((𝐶‘𝐺)‘𝑃))
21	13, 20	eqtrd 2766	1 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐹 ≠ ( I ↾ 𝐵)) ∧ (𝐺 ∈ 𝑇 ∧ 𝐺 ≠ ( I ↾ 𝐵))) ∧ (𝑁 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) ∧ (𝑏 ∈ 𝑇 ∧ (𝑏 ≠ ( I ↾ 𝐵) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝐹) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝐺)))) → ⦋𝐺 / 𝑔⦌𝑌 = ((𝐶‘𝐺)‘𝑃))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1541 ∈ wcel 2111 ≠ wne 2928 ⦋csb 3850 class class class wbr 5091 ↦ cmpt 5172 I cid 5510 ^◡ccnv 5615 ↾ cres 5618 ∘ ccom 5620 ‘cfv 6481 ℩crio 7302 (class class class)co 7346 ∈ cmpo 7348 Basecbs 17117 lecple 17165 joincjn 18214 meetcmee 18215 Atomscatm 39301 HLchlt 39388 LHypclh 40022 LTrncltrn 40139 trLctrl 40196

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-10 2144 ax-11 2160 ax-12 2180 ax-ext 2703 ax-rep 5217 ax-sep 5234 ax-nul 5244 ax-pow 5303 ax-pr 5370 ax-un 7668 ax-riotaBAD 38991

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2535 df-eu 2564 df-clab 2710 df-cleq 2723 df-clel 2806 df-nfc 2881 df-ne 2929 df-ral 3048 df-rex 3057 df-rmo 3346 df-reu 3347 df-rab 3396 df-v 3438 df-sbc 3742 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4284 df-if 4476 df-pw 4552 df-sn 4577 df-pr 4579 df-op 4583 df-uni 4860 df-iun 4943 df-iin 4944 df-br 5092 df-opab 5154 df-mpt 5173 df-id 5511 df-xp 5622 df-rel 5623 df-cnv 5624 df-co 5625 df-dm 5626 df-rn 5627 df-res 5628 df-ima 5629 df-iota 6437 df-fun 6483 df-fn 6484 df-f 6485 df-f1 6486 df-fo 6487 df-f1o 6488 df-fv 6489 df-riota 7303 df-ov 7349 df-oprab 7350 df-mpo 7351 df-1st 7921 df-2nd 7922 df-undef 8203 df-map 8752 df-proset 18197 df-poset 18216 df-plt 18231 df-lub 18247 df-glb 18248 df-join 18249 df-meet 18250 df-p0 18326 df-p1 18327 df-lat 18335 df-clat 18402 df-oposet 39214 df-ol 39216 df-oml 39217 df-covers 39304 df-ats 39305 df-atl 39336 df-cvlat 39360 df-hlat 39389 df-llines 39536 df-lplanes 39537 df-lvols 39538 df-lines 39539 df-psubsp 39541 df-pmap 39542 df-padd 39834 df-lhyp 40026 df-laut 40027 df-ldil 40142 df-ltrn 40143 df-trl 40197

This theorem is referenced by: cdlemkyuu 40966

W3C validator