![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > inveq | Structured version Visualization version GIF version |
Description: If there are two inverses of a morphism, these inverses are equal. Corollary 3.11 of [Adamek] p. 28. (Contributed by AV, 10-Apr-2020.) (Revised by AV, 3-Jul-2022.) |
Ref | Expression |
---|---|
inveq.b | ⊢ 𝐵 = (Base‘𝐶) |
inveq.n | ⊢ 𝑁 = (Inv‘𝐶) |
inveq.c | ⊢ (𝜑 → 𝐶 ∈ Cat) |
inveq.x | ⊢ (𝜑 → 𝑋 ∈ 𝐵) |
inveq.y | ⊢ (𝜑 → 𝑌 ∈ 𝐵) |
Ref | Expression |
---|---|
inveq | ⊢ (𝜑 → ((𝐹(𝑋𝑁𝑌)𝐺 ∧ 𝐹(𝑋𝑁𝑌)𝐾) → 𝐺 = 𝐾)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | inveq.b | . . 3 ⊢ 𝐵 = (Base‘𝐶) | |
2 | eqid 2798 | . . 3 ⊢ (Sect‘𝐶) = (Sect‘𝐶) | |
3 | inveq.c | . . . 4 ⊢ (𝜑 → 𝐶 ∈ Cat) | |
4 | 3 | adantr 484 | . . 3 ⊢ ((𝜑 ∧ (𝐹(𝑋𝑁𝑌)𝐺 ∧ 𝐹(𝑋𝑁𝑌)𝐾)) → 𝐶 ∈ Cat) |
5 | inveq.y | . . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝐵) | |
6 | 5 | adantr 484 | . . 3 ⊢ ((𝜑 ∧ (𝐹(𝑋𝑁𝑌)𝐺 ∧ 𝐹(𝑋𝑁𝑌)𝐾)) → 𝑌 ∈ 𝐵) |
7 | inveq.x | . . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
8 | 7 | adantr 484 | . . 3 ⊢ ((𝜑 ∧ (𝐹(𝑋𝑁𝑌)𝐺 ∧ 𝐹(𝑋𝑁𝑌)𝐾)) → 𝑋 ∈ 𝐵) |
9 | inveq.n | . . . . . . . 8 ⊢ 𝑁 = (Inv‘𝐶) | |
10 | 1, 9, 3, 7, 5, 2 | isinv 17022 | . . . . . . 7 ⊢ (𝜑 → (𝐹(𝑋𝑁𝑌)𝐺 ↔ (𝐹(𝑋(Sect‘𝐶)𝑌)𝐺 ∧ 𝐺(𝑌(Sect‘𝐶)𝑋)𝐹))) |
11 | simpr 488 | . . . . . . 7 ⊢ ((𝐹(𝑋(Sect‘𝐶)𝑌)𝐺 ∧ 𝐺(𝑌(Sect‘𝐶)𝑋)𝐹) → 𝐺(𝑌(Sect‘𝐶)𝑋)𝐹) | |
12 | 10, 11 | syl6bi 256 | . . . . . 6 ⊢ (𝜑 → (𝐹(𝑋𝑁𝑌)𝐺 → 𝐺(𝑌(Sect‘𝐶)𝑋)𝐹)) |
13 | 12 | com12 32 | . . . . 5 ⊢ (𝐹(𝑋𝑁𝑌)𝐺 → (𝜑 → 𝐺(𝑌(Sect‘𝐶)𝑋)𝐹)) |
14 | 13 | adantr 484 | . . . 4 ⊢ ((𝐹(𝑋𝑁𝑌)𝐺 ∧ 𝐹(𝑋𝑁𝑌)𝐾) → (𝜑 → 𝐺(𝑌(Sect‘𝐶)𝑋)𝐹)) |
15 | 14 | impcom 411 | . . 3 ⊢ ((𝜑 ∧ (𝐹(𝑋𝑁𝑌)𝐺 ∧ 𝐹(𝑋𝑁𝑌)𝐾)) → 𝐺(𝑌(Sect‘𝐶)𝑋)𝐹) |
16 | 1, 9, 3, 7, 5, 2 | isinv 17022 | . . . . . 6 ⊢ (𝜑 → (𝐹(𝑋𝑁𝑌)𝐾 ↔ (𝐹(𝑋(Sect‘𝐶)𝑌)𝐾 ∧ 𝐾(𝑌(Sect‘𝐶)𝑋)𝐹))) |
17 | simpl 486 | . . . . . 6 ⊢ ((𝐹(𝑋(Sect‘𝐶)𝑌)𝐾 ∧ 𝐾(𝑌(Sect‘𝐶)𝑋)𝐹) → 𝐹(𝑋(Sect‘𝐶)𝑌)𝐾) | |
18 | 16, 17 | syl6bi 256 | . . . . 5 ⊢ (𝜑 → (𝐹(𝑋𝑁𝑌)𝐾 → 𝐹(𝑋(Sect‘𝐶)𝑌)𝐾)) |
19 | 18 | adantld 494 | . . . 4 ⊢ (𝜑 → ((𝐹(𝑋𝑁𝑌)𝐺 ∧ 𝐹(𝑋𝑁𝑌)𝐾) → 𝐹(𝑋(Sect‘𝐶)𝑌)𝐾)) |
20 | 19 | imp 410 | . . 3 ⊢ ((𝜑 ∧ (𝐹(𝑋𝑁𝑌)𝐺 ∧ 𝐹(𝑋𝑁𝑌)𝐾)) → 𝐹(𝑋(Sect‘𝐶)𝑌)𝐾) |
21 | 1, 2, 4, 6, 8, 15, 20 | sectcan 17017 | . 2 ⊢ ((𝜑 ∧ (𝐹(𝑋𝑁𝑌)𝐺 ∧ 𝐹(𝑋𝑁𝑌)𝐾)) → 𝐺 = 𝐾) |
22 | 21 | ex 416 | 1 ⊢ (𝜑 → ((𝐹(𝑋𝑁𝑌)𝐺 ∧ 𝐹(𝑋𝑁𝑌)𝐾) → 𝐺 = 𝐾)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 399 = wceq 1538 ∈ wcel 2111 class class class wbr 5030 ‘cfv 6324 (class class class)co 7135 Basecbs 16475 Catccat 16927 Sectcsect 17006 Invcinv 17007 |
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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-rep 5154 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-ral 3111 df-rex 3112 df-reu 3113 df-rmo 3114 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4801 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-id 5425 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-1st 7671 df-2nd 7672 df-cat 16931 df-cid 16932 df-sect 17009 df-inv 17010 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |