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 2824 | . . 3 ⊢ (Sect‘𝐶) = (Sect‘𝐶) | |
3 | inveq.c | . . . 4 ⊢ (𝜑 → 𝐶 ∈ Cat) | |
4 | 3 | adantr 483 | . . 3 ⊢ ((𝜑 ∧ (𝐹(𝑋𝑁𝑌)𝐺 ∧ 𝐹(𝑋𝑁𝑌)𝐾)) → 𝐶 ∈ Cat) |
5 | inveq.y | . . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝐵) | |
6 | 5 | adantr 483 | . . 3 ⊢ ((𝜑 ∧ (𝐹(𝑋𝑁𝑌)𝐺 ∧ 𝐹(𝑋𝑁𝑌)𝐾)) → 𝑌 ∈ 𝐵) |
7 | inveq.x | . . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
8 | 7 | adantr 483 | . . 3 ⊢ ((𝜑 ∧ (𝐹(𝑋𝑁𝑌)𝐺 ∧ 𝐹(𝑋𝑁𝑌)𝐾)) → 𝑋 ∈ 𝐵) |
9 | inveq.n | . . . . . . . 8 ⊢ 𝑁 = (Inv‘𝐶) | |
10 | 1, 9, 3, 7, 5, 2 | isinv 17033 | . . . . . . 7 ⊢ (𝜑 → (𝐹(𝑋𝑁𝑌)𝐺 ↔ (𝐹(𝑋(Sect‘𝐶)𝑌)𝐺 ∧ 𝐺(𝑌(Sect‘𝐶)𝑋)𝐹))) |
11 | simpr 487 | . . . . . . 7 ⊢ ((𝐹(𝑋(Sect‘𝐶)𝑌)𝐺 ∧ 𝐺(𝑌(Sect‘𝐶)𝑋)𝐹) → 𝐺(𝑌(Sect‘𝐶)𝑋)𝐹) | |
12 | 10, 11 | syl6bi 255 | . . . . . 6 ⊢ (𝜑 → (𝐹(𝑋𝑁𝑌)𝐺 → 𝐺(𝑌(Sect‘𝐶)𝑋)𝐹)) |
13 | 12 | com12 32 | . . . . 5 ⊢ (𝐹(𝑋𝑁𝑌)𝐺 → (𝜑 → 𝐺(𝑌(Sect‘𝐶)𝑋)𝐹)) |
14 | 13 | adantr 483 | . . . 4 ⊢ ((𝐹(𝑋𝑁𝑌)𝐺 ∧ 𝐹(𝑋𝑁𝑌)𝐾) → (𝜑 → 𝐺(𝑌(Sect‘𝐶)𝑋)𝐹)) |
15 | 14 | impcom 410 | . . 3 ⊢ ((𝜑 ∧ (𝐹(𝑋𝑁𝑌)𝐺 ∧ 𝐹(𝑋𝑁𝑌)𝐾)) → 𝐺(𝑌(Sect‘𝐶)𝑋)𝐹) |
16 | 1, 9, 3, 7, 5, 2 | isinv 17033 | . . . . . 6 ⊢ (𝜑 → (𝐹(𝑋𝑁𝑌)𝐾 ↔ (𝐹(𝑋(Sect‘𝐶)𝑌)𝐾 ∧ 𝐾(𝑌(Sect‘𝐶)𝑋)𝐹))) |
17 | simpl 485 | . . . . . 6 ⊢ ((𝐹(𝑋(Sect‘𝐶)𝑌)𝐾 ∧ 𝐾(𝑌(Sect‘𝐶)𝑋)𝐹) → 𝐹(𝑋(Sect‘𝐶)𝑌)𝐾) | |
18 | 16, 17 | syl6bi 255 | . . . . 5 ⊢ (𝜑 → (𝐹(𝑋𝑁𝑌)𝐾 → 𝐹(𝑋(Sect‘𝐶)𝑌)𝐾)) |
19 | 18 | adantld 493 | . . . 4 ⊢ (𝜑 → ((𝐹(𝑋𝑁𝑌)𝐺 ∧ 𝐹(𝑋𝑁𝑌)𝐾) → 𝐹(𝑋(Sect‘𝐶)𝑌)𝐾)) |
20 | 19 | imp 409 | . . 3 ⊢ ((𝜑 ∧ (𝐹(𝑋𝑁𝑌)𝐺 ∧ 𝐹(𝑋𝑁𝑌)𝐾)) → 𝐹(𝑋(Sect‘𝐶)𝑌)𝐾) |
21 | 1, 2, 4, 6, 8, 15, 20 | sectcan 17028 | . 2 ⊢ ((𝜑 ∧ (𝐹(𝑋𝑁𝑌)𝐺 ∧ 𝐹(𝑋𝑁𝑌)𝐾)) → 𝐺 = 𝐾) |
22 | 21 | ex 415 | 1 ⊢ (𝜑 → ((𝐹(𝑋𝑁𝑌)𝐺 ∧ 𝐹(𝑋𝑁𝑌)𝐾) → 𝐺 = 𝐾)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 = wceq 1536 ∈ wcel 2113 class class class wbr 5069 ‘cfv 6358 (class class class)co 7159 Basecbs 16486 Catccat 16938 Sectcsect 17017 Invcinv 17018 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2796 ax-rep 5193 ax-sep 5206 ax-nul 5213 ax-pow 5269 ax-pr 5333 ax-un 7464 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-mo 2621 df-eu 2653 df-clab 2803 df-cleq 2817 df-clel 2896 df-nfc 2966 df-ne 3020 df-ral 3146 df-rex 3147 df-reu 3148 df-rmo 3149 df-rab 3150 df-v 3499 df-sbc 3776 df-csb 3887 df-dif 3942 df-un 3944 df-in 3946 df-ss 3955 df-nul 4295 df-if 4471 df-pw 4544 df-sn 4571 df-pr 4573 df-op 4577 df-uni 4842 df-iun 4924 df-br 5070 df-opab 5132 df-mpt 5150 df-id 5463 df-xp 5564 df-rel 5565 df-cnv 5566 df-co 5567 df-dm 5568 df-rn 5569 df-res 5570 df-ima 5571 df-iota 6317 df-fun 6360 df-fn 6361 df-f 6362 df-f1 6363 df-fo 6364 df-f1o 6365 df-fv 6366 df-riota 7117 df-ov 7162 df-oprab 7163 df-mpo 7164 df-1st 7692 df-2nd 7693 df-cat 16942 df-cid 16943 df-sect 17020 df-inv 17021 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |