| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > funcinv | Structured version Visualization version GIF version | ||
| Description: The image of an inverse under a functor is an inverse. (Contributed by Mario Carneiro, 3-Jan-2017.) |
| Ref | Expression |
|---|---|
| funcinv.b | ⊢ 𝐵 = (Base‘𝐷) |
| funcinv.s | ⊢ 𝐼 = (Inv‘𝐷) |
| funcinv.t | ⊢ 𝐽 = (Inv‘𝐸) |
| funcinv.f | ⊢ (𝜑 → 𝐹(𝐷 Func 𝐸)𝐺) |
| funcinv.x | ⊢ (𝜑 → 𝑋 ∈ 𝐵) |
| funcinv.y | ⊢ (𝜑 → 𝑌 ∈ 𝐵) |
| funcinv.m | ⊢ (𝜑 → 𝑀(𝑋𝐼𝑌)𝑁) |
| Ref | Expression |
|---|---|
| funcinv | ⊢ (𝜑 → ((𝑋𝐺𝑌)‘𝑀)((𝐹‘𝑋)𝐽(𝐹‘𝑌))((𝑌𝐺𝑋)‘𝑁)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | funcinv.b | . . 3 ⊢ 𝐵 = (Base‘𝐷) | |
| 2 | eqid 2737 | . . 3 ⊢ (Sect‘𝐷) = (Sect‘𝐷) | |
| 3 | eqid 2737 | . . 3 ⊢ (Sect‘𝐸) = (Sect‘𝐸) | |
| 4 | funcinv.f | . . 3 ⊢ (𝜑 → 𝐹(𝐷 Func 𝐸)𝐺) | |
| 5 | funcinv.x | . . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
| 6 | funcinv.y | . . 3 ⊢ (𝜑 → 𝑌 ∈ 𝐵) | |
| 7 | funcinv.m | . . . . 5 ⊢ (𝜑 → 𝑀(𝑋𝐼𝑌)𝑁) | |
| 8 | funcinv.s | . . . . . 6 ⊢ 𝐼 = (Inv‘𝐷) | |
| 9 | df-br 5100 | . . . . . . . . 9 ⊢ (𝐹(𝐷 Func 𝐸)𝐺 ↔ 〈𝐹, 𝐺〉 ∈ (𝐷 Func 𝐸)) | |
| 10 | 4, 9 | sylib 218 | . . . . . . . 8 ⊢ (𝜑 → 〈𝐹, 𝐺〉 ∈ (𝐷 Func 𝐸)) |
| 11 | funcrcl 17791 | . . . . . . . 8 ⊢ (〈𝐹, 𝐺〉 ∈ (𝐷 Func 𝐸) → (𝐷 ∈ Cat ∧ 𝐸 ∈ Cat)) | |
| 12 | 10, 11 | syl 17 | . . . . . . 7 ⊢ (𝜑 → (𝐷 ∈ Cat ∧ 𝐸 ∈ Cat)) |
| 13 | 12 | simpld 494 | . . . . . 6 ⊢ (𝜑 → 𝐷 ∈ Cat) |
| 14 | 1, 8, 13, 5, 6, 2 | isinv 17688 | . . . . 5 ⊢ (𝜑 → (𝑀(𝑋𝐼𝑌)𝑁 ↔ (𝑀(𝑋(Sect‘𝐷)𝑌)𝑁 ∧ 𝑁(𝑌(Sect‘𝐷)𝑋)𝑀))) |
| 15 | 7, 14 | mpbid 232 | . . . 4 ⊢ (𝜑 → (𝑀(𝑋(Sect‘𝐷)𝑌)𝑁 ∧ 𝑁(𝑌(Sect‘𝐷)𝑋)𝑀)) |
| 16 | 15 | simpld 494 | . . 3 ⊢ (𝜑 → 𝑀(𝑋(Sect‘𝐷)𝑌)𝑁) |
| 17 | 1, 2, 3, 4, 5, 6, 16 | funcsect 17800 | . 2 ⊢ (𝜑 → ((𝑋𝐺𝑌)‘𝑀)((𝐹‘𝑋)(Sect‘𝐸)(𝐹‘𝑌))((𝑌𝐺𝑋)‘𝑁)) |
| 18 | 15 | simprd 495 | . . 3 ⊢ (𝜑 → 𝑁(𝑌(Sect‘𝐷)𝑋)𝑀) |
| 19 | 1, 2, 3, 4, 6, 5, 18 | funcsect 17800 | . 2 ⊢ (𝜑 → ((𝑌𝐺𝑋)‘𝑁)((𝐹‘𝑌)(Sect‘𝐸)(𝐹‘𝑋))((𝑋𝐺𝑌)‘𝑀)) |
| 20 | eqid 2737 | . . 3 ⊢ (Base‘𝐸) = (Base‘𝐸) | |
| 21 | funcinv.t | . . 3 ⊢ 𝐽 = (Inv‘𝐸) | |
| 22 | 12 | simprd 495 | . . 3 ⊢ (𝜑 → 𝐸 ∈ Cat) |
| 23 | 1, 20, 4 | funcf1 17794 | . . . 4 ⊢ (𝜑 → 𝐹:𝐵⟶(Base‘𝐸)) |
| 24 | 23, 5 | ffvelcdmd 7032 | . . 3 ⊢ (𝜑 → (𝐹‘𝑋) ∈ (Base‘𝐸)) |
| 25 | 23, 6 | ffvelcdmd 7032 | . . 3 ⊢ (𝜑 → (𝐹‘𝑌) ∈ (Base‘𝐸)) |
| 26 | 20, 21, 22, 24, 25, 3 | isinv 17688 | . 2 ⊢ (𝜑 → (((𝑋𝐺𝑌)‘𝑀)((𝐹‘𝑋)𝐽(𝐹‘𝑌))((𝑌𝐺𝑋)‘𝑁) ↔ (((𝑋𝐺𝑌)‘𝑀)((𝐹‘𝑋)(Sect‘𝐸)(𝐹‘𝑌))((𝑌𝐺𝑋)‘𝑁) ∧ ((𝑌𝐺𝑋)‘𝑁)((𝐹‘𝑌)(Sect‘𝐸)(𝐹‘𝑋))((𝑋𝐺𝑌)‘𝑀)))) |
| 27 | 17, 19, 26 | mpbir2and 714 | 1 ⊢ (𝜑 → ((𝑋𝐺𝑌)‘𝑀)((𝐹‘𝑋)𝐽(𝐹‘𝑌))((𝑌𝐺𝑋)‘𝑁)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 〈cop 4587 class class class wbr 5099 ‘cfv 6493 (class class class)co 7360 Basecbs 17140 Catccat 17591 Sectcsect 17672 Invcinv 17673 Func cfunc 17782 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5225 ax-sep 5242 ax-nul 5252 ax-pow 5311 ax-pr 5378 ax-un 7682 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3062 df-reu 3352 df-rab 3401 df-v 3443 df-sbc 3742 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4287 df-if 4481 df-pw 4557 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-iun 4949 df-br 5100 df-opab 5162 df-mpt 5181 df-id 5520 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-ov 7363 df-oprab 7364 df-mpo 7365 df-1st 7935 df-2nd 7936 df-map 8769 df-ixp 8840 df-sect 17675 df-inv 17676 df-func 17786 |
| This theorem is referenced by: funciso 17802 |
| Copyright terms: Public domain | W3C validator |