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 41580

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 1154	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
2		trlcocnv.h	. . . . . 6 ⊢ 𝐻 = (LHyp‘𝐾)
3		trlcocnv.t	. . . . . 6 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
4	2, 3	ltrncnv 41006	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐺 ∈ 𝑇) → ^◡𝐺 ∈ 𝑇)
5	4	3adant2 1149	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) → ^◡𝐺 ∈ 𝑇)
6	2, 3	ltrnco 41579	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ ^◡𝐺 ∈ 𝑇) → (𝐹 ∘ ^◡𝐺) ∈ 𝑇)
7	5, 6	syld3an3 1436	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) → (𝐹 ∘ ^◡𝐺) ∈ 𝑇)
8		trlcocnv.r	. . . 4 ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)
9	2, 3, 8	trlcnv 41025	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∘ ^◡𝐺) ∈ 𝑇) → (𝑅‘^◡(𝐹 ∘ ^◡𝐺)) = (𝑅‘(𝐹 ∘ ^◡𝐺)))
10	1, 7, 9	syl2anc 596	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) → (𝑅‘^◡(𝐹 ∘ ^◡𝐺)) = (𝑅‘(𝐹 ∘ ^◡𝐺)))
11		cnvco 5873	. . . 4 ⊢ ^◡(𝐹 ∘ ^◡𝐺) = (^◡^◡𝐺 ∘ ^◡𝐹)
12		cocnvcnv1 6258	. . . 4 ⊢ (^◡^◡𝐺 ∘ ^◡𝐹) = (𝐺 ∘ ^◡𝐹)
13	11, 12	eqtri 2785	. . 3 ⊢ ^◡(𝐹 ∘ ^◡𝐺) = (𝐺 ∘ ^◡𝐹)
14	13	fveq2i 6885	. 2 ⊢ (𝑅‘^◡(𝐹 ∘ ^◡𝐺)) = (𝑅‘(𝐺 ∘ ^◡𝐹))
15	10, 14	eqtr3di 2812	1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) → (𝑅‘(𝐹 ∘ ^◡𝐺)) = (𝑅‘(𝐺 ∘ ^◡𝐹)))

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 ^◡ccnv 5658 ∘ ccom 5663 ‘cfv 6537 HLchlt 40210 LHypclh 40844 LTrncltrn 40961 trLctrl 41018

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 2215 ax-ext 2734 ax-rep 5236 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7739 ax-riotaBAD 39813

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 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 3367 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-iun 4956 df-iin 4957 df-br 5108 df-opab 5172 df-mpt 5191 df-id 5554 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 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 7373 df-ov 7419 df-oprab 7420 df-mpo 7421 df-1st 7989 df-2nd 7990 df-undef 8274 df-map 8831 df-proset 18386 df-poset 18405 df-plt 18420 df-lub 18436 df-glb 18437 df-join 18438 df-meet 18439 df-p0 18515 df-p1 18516 df-lat 18524 df-clat 18591 df-oposet 40036 df-ol 40038 df-oml 40039 df-covers 40126 df-ats 40127 df-atl 40158 df-cvlat 40182 df-hlat 40211 df-llines 40358 df-lplanes 40359 df-lvols 40360 df-lines 40361 df-psubsp 40363 df-pmap 40364 df-padd 40656 df-lhyp 40848 df-laut 40849 df-ldil 40964 df-ltrn 40965 df-trl 41019

This theorem is used by: cdlemk9bN 41700 cdlemk14 41714 cdlemk21N 41733 cdlemk20 41734 cdlemk22 41753 cdlemkfid1N 41781

W3C validator