trlcocnv - Mathbox for Norm Megill

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

Theorem trlcocnv 41522

Description: Swap the arguments of the trace of a composition with converse. (Contributed by NM, 1-Jul-2013.)

**Hypotheses**
Ref	Expression
trlcocnv.h	⊢ 𝐻 = (LHyp‘𝐾)
trlcocnv.t	⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
trlcocnv.r	⊢ 𝑅 = ((trL‘𝐾)‘𝑊)

**Assertion**
Ref	Expression
trlcocnv	⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) → (𝑅‘(𝐹 ∘ ^◡𝐺)) = (𝑅‘(𝐺 ∘ ^◡𝐹)))

**Proof of Theorem trlcocnv**
Step	Hyp	Ref	Expression
1		simp1 1153	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
2		trlcocnv.h	. . . . . 6 ⊢ 𝐻 = (LHyp‘𝐾)
3		trlcocnv.t	. . . . . 6 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
4	2, 3	ltrncnv 40948	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐺 ∈ 𝑇) → ^◡𝐺 ∈ 𝑇)
5	4	3adant2 1148	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) → ^◡𝐺 ∈ 𝑇)
6	2, 3	ltrnco 41521	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ ^◡𝐺 ∈ 𝑇) → (𝐹 ∘ ^◡𝐺) ∈ 𝑇)
7	5, 6	syld3an3 1435	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) → (𝐹 ∘ ^◡𝐺) ∈ 𝑇)
8		trlcocnv.r	. . . 4 ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)
9	2, 3, 8	trlcnv 40967	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∘ ^◡𝐺) ∈ 𝑇) → (𝑅‘^◡(𝐹 ∘ ^◡𝐺)) = (𝑅‘(𝐹 ∘ ^◡𝐺)))
10	1, 7, 9	syl2anc 595	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) → (𝑅‘^◡(𝐹 ∘ ^◡𝐺)) = (𝑅‘(𝐹 ∘ ^◡𝐺)))
11		cnvco 5874	. . . 4 ⊢ ^◡(𝐹 ∘ ^◡𝐺) = (^◡^◡𝐺 ∘ ^◡𝐹)
12		cocnvcnv1 6258	. . . 4 ⊢ (^◡^◡𝐺 ∘ ^◡𝐹) = (𝐺 ∘ ^◡𝐹)
13	11, 12	eqtri 2785	. . 3 ⊢ ^◡(𝐹 ∘ ^◡𝐺) = (𝐺 ∘ ^◡𝐹)
14	13	fveq2i 6884	. 2 ⊢ (𝑅‘^◡(𝐹 ∘ ^◡𝐺)) = (𝑅‘(𝐺 ∘ ^◡𝐹))
15	10, 14	eqtr3di 2812	1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) → (𝑅‘(𝐹 ∘ ^◡𝐺)) = (𝑅‘(𝐺 ∘ ^◡𝐹)))

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ∧ wa 400 ∧ w3a 1102 = wceq 1569 ∈ wcel 2142 ^◡ccnv 5659 ∘ ccom 5664 ‘cfv 6536 HLchlt 40152 LHypclh 40786 LTrncltrn 40903 trLctrl 40960

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-rep 5237 ax-sep 5256 ax-nul 5268 ax-pow 5335 ax-pr 5403 ax-un 7734 ax-riotaBAD 39755

This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1103 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-nf 1813 df-sb 2096 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3456 df-sbc 3744 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-iun 4957 df-iin 4958 df-br 5109 df-opab 5173 df-mpt 5192 df-id 5555 df-xp 5666 df-rel 5667 df-cnv 5668 df-co 5669 df-dm 5670 df-rn 5671 df-res 5672 df-ima 5673 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-1st 7984 df-2nd 7985 df-undef 8267 df-map 8824 df-proset 18356 df-poset 18375 df-plt 18390 df-lub 18406 df-glb 18407 df-join 18408 df-meet 18409 df-p0 18485 df-p1 18486 df-lat 18494 df-clat 18561 df-oposet 39978 df-ol 39980 df-oml 39981 df-covers 40068 df-ats 40069 df-atl 40100 df-cvlat 40124 df-hlat 40153 df-llines 40300 df-lplanes 40301 df-lvols 40302 df-lines 40303 df-psubsp 40305 df-pmap 40306 df-padd 40598 df-lhyp 40790 df-laut 40791 df-ldil 40906 df-ltrn 40907 df-trl 40961

This theorem is used by: cdlemk9bN 41642 cdlemk14 41656 cdlemk21N 41675 cdlemk20 41676 cdlemk22 41695 cdlemkfid1N 41723

W3C validator