| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > trlcocnv | Structured version Visualization version GIF version | ||
| Description: Swap the arguments of the trace of a composition with converse. (Contributed by NM, 1-Jul-2013.) |
| Ref | Expression |
|---|---|
| trlcocnv.h | ⊢ 𝐻 = (LHyp‘𝐾) |
| trlcocnv.t | ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) |
| trlcocnv.r | ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) |
| Ref | Expression |
|---|---|
| trlcocnv | ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) → (𝑅‘(𝐹 ∘ ◡𝐺)) = (𝑅‘(𝐺 ∘ ◡𝐹))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simp1 1154 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻)) | |
| 2 | trlcocnv.h | . . . . . 6 ⊢ 𝐻 = (LHyp‘𝐾) | |
| 3 | trlcocnv.t | . . . . . 6 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) | |
| 4 | 2, 3 | ltrncnv 41123 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐺 ∈ 𝑇) → ◡𝐺 ∈ 𝑇) |
| 5 | 4 | 3adant2 1149 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) → ◡𝐺 ∈ 𝑇) |
| 6 | 2, 3 | ltrnco 41696 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ ◡𝐺 ∈ 𝑇) → (𝐹 ∘ ◡𝐺) ∈ 𝑇) |
| 7 | 5, 6 | syld3an3 1436 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) → (𝐹 ∘ ◡𝐺) ∈ 𝑇) |
| 8 | trlcocnv.r | . . . 4 ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) | |
| 9 | 2, 3, 8 | trlcnv 41142 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∘ ◡𝐺) ∈ 𝑇) → (𝑅‘◡(𝐹 ∘ ◡𝐺)) = (𝑅‘(𝐹 ∘ ◡𝐺))) |
| 10 | 1, 7, 9 | syl2anc 596 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) → (𝑅‘◡(𝐹 ∘ ◡𝐺)) = (𝑅‘(𝐹 ∘ ◡𝐺))) |
| 11 | cnvco 5863 | . . . 4 ⊢ ◡(𝐹 ∘ ◡𝐺) = (◡◡𝐺 ∘ ◡𝐹) | |
| 12 | cocnvcnv1 6248 | . . . 4 ⊢ (◡◡𝐺 ∘ ◡𝐹) = (𝐺 ∘ ◡𝐹) | |
| 13 | 11, 12 | eqtri 2783 | . . 3 ⊢ ◡(𝐹 ∘ ◡𝐺) = (𝐺 ∘ ◡𝐹) |
| 14 | 13 | fveq2i 6876 | . 2 ⊢ (𝑅‘◡(𝐹 ∘ ◡𝐺)) = (𝑅‘(𝐺 ∘ ◡𝐹)) |
| 15 | 10, 14 | eqtr3di 2810 | 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 5646 ∘ ccom 5651 ‘cfv 6527 HLchlt 40327 LHypclh 40961 LTrncltrn 41078 trLctrl 41135 |
| 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 2213 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7734 ax-riotaBAD 39930 |
| 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 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-iun 4952 df-iin 4953 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5542 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-iota 6483 df-fun 6529 df-fn 6530 df-f 6531 df-f1 6532 df-fo 6533 df-f1o 6534 df-fv 6535 df-riota 7365 df-ov 7411 df-oprab 7412 df-mpo 7413 df-1st 7984 df-2nd 7985 df-undef 8268 df-map 8827 df-proset 18429 df-poset 18448 df-plt 18463 df-lub 18479 df-glb 18480 df-join 18481 df-meet 18482 df-p0 18558 df-p1 18559 df-lat 18567 df-clat 18634 df-oposet 40153 df-ol 40155 df-oml 40156 df-covers 40243 df-ats 40244 df-atl 40275 df-cvlat 40299 df-hlat 40328 df-llines 40475 df-lplanes 40476 df-lvols 40477 df-lines 40478 df-psubsp 40480 df-pmap 40481 df-padd 40773 df-lhyp 40965 df-laut 40966 df-ldil 41081 df-ltrn 41082 df-trl 41136 |
| This theorem is used by: cdlemk9bN 41817 cdlemk14 41831 cdlemk21N 41850 cdlemk20 41851 cdlemk22 41870 cdlemkfid1N 41898 |
| Copyright terms: Public domain | W3C validator |