![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > issect | Structured version Visualization version GIF version |
Description: The property "𝐹 is a section of 𝐺". (Contributed by Mario Carneiro, 2-Jan-2017.) |
Ref | Expression |
---|---|
issect.b | ⊢ 𝐵 = (Base‘𝐶) |
issect.h | ⊢ 𝐻 = (Hom ‘𝐶) |
issect.o | ⊢ · = (comp‘𝐶) |
issect.i | ⊢ 1 = (Id‘𝐶) |
issect.s | ⊢ 𝑆 = (Sect‘𝐶) |
issect.c | ⊢ (𝜑 → 𝐶 ∈ Cat) |
issect.x | ⊢ (𝜑 → 𝑋 ∈ 𝐵) |
issect.y | ⊢ (𝜑 → 𝑌 ∈ 𝐵) |
Ref | Expression |
---|---|
issect | ⊢ (𝜑 → (𝐹(𝑋𝑆𝑌)𝐺 ↔ (𝐹 ∈ (𝑋𝐻𝑌) ∧ 𝐺 ∈ (𝑌𝐻𝑋) ∧ (𝐺(〈𝑋, 𝑌〉 · 𝑋)𝐹) = ( 1 ‘𝑋)))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | issect.b | . . . 4 ⊢ 𝐵 = (Base‘𝐶) | |
2 | issect.h | . . . 4 ⊢ 𝐻 = (Hom ‘𝐶) | |
3 | issect.o | . . . 4 ⊢ · = (comp‘𝐶) | |
4 | issect.i | . . . 4 ⊢ 1 = (Id‘𝐶) | |
5 | issect.s | . . . 4 ⊢ 𝑆 = (Sect‘𝐶) | |
6 | issect.c | . . . 4 ⊢ (𝜑 → 𝐶 ∈ Cat) | |
7 | issect.x | . . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
8 | issect.y | . . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝐵) | |
9 | 1, 2, 3, 4, 5, 6, 7, 8 | sectfval 16725 | . . 3 ⊢ (𝜑 → (𝑋𝑆𝑌) = {〈𝑓, 𝑔〉 ∣ ((𝑓 ∈ (𝑋𝐻𝑌) ∧ 𝑔 ∈ (𝑌𝐻𝑋)) ∧ (𝑔(〈𝑋, 𝑌〉 · 𝑋)𝑓) = ( 1 ‘𝑋))}) |
10 | 9 | breqd 4854 | . 2 ⊢ (𝜑 → (𝐹(𝑋𝑆𝑌)𝐺 ↔ 𝐹{〈𝑓, 𝑔〉 ∣ ((𝑓 ∈ (𝑋𝐻𝑌) ∧ 𝑔 ∈ (𝑌𝐻𝑋)) ∧ (𝑔(〈𝑋, 𝑌〉 · 𝑋)𝑓) = ( 1 ‘𝑋))}𝐺)) |
11 | oveq12 6887 | . . . . . 6 ⊢ ((𝑔 = 𝐺 ∧ 𝑓 = 𝐹) → (𝑔(〈𝑋, 𝑌〉 · 𝑋)𝑓) = (𝐺(〈𝑋, 𝑌〉 · 𝑋)𝐹)) | |
12 | 11 | ancoms 451 | . . . . 5 ⊢ ((𝑓 = 𝐹 ∧ 𝑔 = 𝐺) → (𝑔(〈𝑋, 𝑌〉 · 𝑋)𝑓) = (𝐺(〈𝑋, 𝑌〉 · 𝑋)𝐹)) |
13 | 12 | eqeq1d 2801 | . . . 4 ⊢ ((𝑓 = 𝐹 ∧ 𝑔 = 𝐺) → ((𝑔(〈𝑋, 𝑌〉 · 𝑋)𝑓) = ( 1 ‘𝑋) ↔ (𝐺(〈𝑋, 𝑌〉 · 𝑋)𝐹) = ( 1 ‘𝑋))) |
14 | eqid 2799 | . . . 4 ⊢ {〈𝑓, 𝑔〉 ∣ ((𝑓 ∈ (𝑋𝐻𝑌) ∧ 𝑔 ∈ (𝑌𝐻𝑋)) ∧ (𝑔(〈𝑋, 𝑌〉 · 𝑋)𝑓) = ( 1 ‘𝑋))} = {〈𝑓, 𝑔〉 ∣ ((𝑓 ∈ (𝑋𝐻𝑌) ∧ 𝑔 ∈ (𝑌𝐻𝑋)) ∧ (𝑔(〈𝑋, 𝑌〉 · 𝑋)𝑓) = ( 1 ‘𝑋))} | |
15 | 13, 14 | brab2a 5399 | . . 3 ⊢ (𝐹{〈𝑓, 𝑔〉 ∣ ((𝑓 ∈ (𝑋𝐻𝑌) ∧ 𝑔 ∈ (𝑌𝐻𝑋)) ∧ (𝑔(〈𝑋, 𝑌〉 · 𝑋)𝑓) = ( 1 ‘𝑋))}𝐺 ↔ ((𝐹 ∈ (𝑋𝐻𝑌) ∧ 𝐺 ∈ (𝑌𝐻𝑋)) ∧ (𝐺(〈𝑋, 𝑌〉 · 𝑋)𝐹) = ( 1 ‘𝑋))) |
16 | df-3an 1110 | . . 3 ⊢ ((𝐹 ∈ (𝑋𝐻𝑌) ∧ 𝐺 ∈ (𝑌𝐻𝑋) ∧ (𝐺(〈𝑋, 𝑌〉 · 𝑋)𝐹) = ( 1 ‘𝑋)) ↔ ((𝐹 ∈ (𝑋𝐻𝑌) ∧ 𝐺 ∈ (𝑌𝐻𝑋)) ∧ (𝐺(〈𝑋, 𝑌〉 · 𝑋)𝐹) = ( 1 ‘𝑋))) | |
17 | 15, 16 | bitr4i 270 | . 2 ⊢ (𝐹{〈𝑓, 𝑔〉 ∣ ((𝑓 ∈ (𝑋𝐻𝑌) ∧ 𝑔 ∈ (𝑌𝐻𝑋)) ∧ (𝑔(〈𝑋, 𝑌〉 · 𝑋)𝑓) = ( 1 ‘𝑋))}𝐺 ↔ (𝐹 ∈ (𝑋𝐻𝑌) ∧ 𝐺 ∈ (𝑌𝐻𝑋) ∧ (𝐺(〈𝑋, 𝑌〉 · 𝑋)𝐹) = ( 1 ‘𝑋))) |
18 | 10, 17 | syl6bb 279 | 1 ⊢ (𝜑 → (𝐹(𝑋𝑆𝑌)𝐺 ↔ (𝐹 ∈ (𝑋𝐻𝑌) ∧ 𝐺 ∈ (𝑌𝐻𝑋) ∧ (𝐺(〈𝑋, 𝑌〉 · 𝑋)𝐹) = ( 1 ‘𝑋)))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 198 ∧ wa 385 ∧ w3a 1108 = wceq 1653 ∈ wcel 2157 〈cop 4374 class class class wbr 4843 {copab 4905 ‘cfv 6101 (class class class)co 6878 Basecbs 16184 Hom chom 16278 compcco 16279 Catccat 16639 Idccid 16640 Sectcsect 16718 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1891 ax-4 1905 ax-5 2006 ax-6 2072 ax-7 2107 ax-8 2159 ax-9 2166 ax-10 2185 ax-11 2200 ax-12 2213 ax-13 2377 ax-ext 2777 ax-rep 4964 ax-sep 4975 ax-nul 4983 ax-pow 5035 ax-pr 5097 ax-un 7183 |
This theorem depends on definitions: df-bi 199 df-an 386 df-or 875 df-3an 1110 df-tru 1657 df-ex 1876 df-nf 1880 df-sb 2065 df-mo 2591 df-eu 2609 df-clab 2786 df-cleq 2792 df-clel 2795 df-nfc 2930 df-ne 2972 df-ral 3094 df-rex 3095 df-reu 3096 df-rab 3098 df-v 3387 df-sbc 3634 df-csb 3729 df-dif 3772 df-un 3774 df-in 3776 df-ss 3783 df-nul 4116 df-if 4278 df-pw 4351 df-sn 4369 df-pr 4371 df-op 4375 df-uni 4629 df-iun 4712 df-br 4844 df-opab 4906 df-mpt 4923 df-id 5220 df-xp 5318 df-rel 5319 df-cnv 5320 df-co 5321 df-dm 5322 df-rn 5323 df-res 5324 df-ima 5325 df-iota 6064 df-fun 6103 df-fn 6104 df-f 6105 df-f1 6106 df-fo 6107 df-f1o 6108 df-fv 6109 df-ov 6881 df-oprab 6882 df-mpt2 6883 df-1st 7401 df-2nd 7402 df-sect 16721 |
This theorem is referenced by: issect2 16728 sectcan 16729 sectco 16730 oppcsect 16752 sectmon 16756 monsect 16757 funcsect 16846 fucsect 16946 invfuc 16948 setcsect 17053 catciso 17071 rngcsect 42779 rngcsectALTV 42791 ringcsect 42830 ringcsectALTV 42854 |
Copyright terms: Public domain | W3C validator |