Theorem issect 17722

Description: The property "𝐹 is a section of 𝐺". (Contributed by Mario Carneiro, 2-Jan-2017.)

Hypotheses

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	⊢ (𝜑 → 𝑌 ∈ 𝐵)

Assertion

Ref	Expression
issect	⊢ (𝜑 → (𝐹(𝑋𝑆𝑌)𝐺 ↔ (𝐹 ∈ (𝑋𝐻𝑌) ∧ 𝐺 ∈ (𝑌𝐻𝑋) ∧ (𝐺(⟨𝑋, 𝑌⟩ · 𝑋)𝐹) = ( 1 ‘𝑋))))

Proof of Theorem issect

Dummy variables 𝑓 𝑔 are mutually distinct and distinct from all other variables.

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 17720	. . 3 ⊢ (𝜑 → (𝑋𝑆𝑌) = {⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ (𝑋𝐻𝑌) ∧ 𝑔 ∈ (𝑌𝐻𝑋)) ∧ (𝑔(⟨𝑋, 𝑌⟩ · 𝑋)𝑓) = ( 1 ‘𝑋))})
10	9	breqd 5121	. 2 ⊢ (𝜑 → (𝐹(𝑋𝑆𝑌)𝐺 ↔ 𝐹{⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ (𝑋𝐻𝑌) ∧ 𝑔 ∈ (𝑌𝐻𝑋)) ∧ (𝑔(⟨𝑋, 𝑌⟩ · 𝑋)𝑓) = ( 1 ‘𝑋))}𝐺))
11		oveq12 7399	. . . . . 6 ⊢ ((𝑔 = 𝐺 ∧ 𝑓 = 𝐹) → (𝑔(⟨𝑋, 𝑌⟩ · 𝑋)𝑓) = (𝐺(⟨𝑋, 𝑌⟩ · 𝑋)𝐹))
12	11	ancoms 458	. . . . 5 ⊢ ((𝑓 = 𝐹 ∧ 𝑔 = 𝐺) → (𝑔(⟨𝑋, 𝑌⟩ · 𝑋)𝑓) = (𝐺(⟨𝑋, 𝑌⟩ · 𝑋)𝐹))
13	12	eqeq1d 2732	. . . 4 ⊢ ((𝑓 = 𝐹 ∧ 𝑔 = 𝐺) → ((𝑔(⟨𝑋, 𝑌⟩ · 𝑋)𝑓) = ( 1 ‘𝑋) ↔ (𝐺(⟨𝑋, 𝑌⟩ · 𝑋)𝐹) = ( 1 ‘𝑋)))
14		eqid 2730	. . . 4 ⊢ {⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ (𝑋𝐻𝑌) ∧ 𝑔 ∈ (𝑌𝐻𝑋)) ∧ (𝑔(⟨𝑋, 𝑌⟩ · 𝑋)𝑓) = ( 1 ‘𝑋))} = {⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ (𝑋𝐻𝑌) ∧ 𝑔 ∈ (𝑌𝐻𝑋)) ∧ (𝑔(⟨𝑋, 𝑌⟩ · 𝑋)𝑓) = ( 1 ‘𝑋))}
15	13, 14	brab2a 5735	. . 3 ⊢ (𝐹{⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ (𝑋𝐻𝑌) ∧ 𝑔 ∈ (𝑌𝐻𝑋)) ∧ (𝑔(⟨𝑋, 𝑌⟩ · 𝑋)𝑓) = ( 1 ‘𝑋))}𝐺 ↔ ((𝐹 ∈ (𝑋𝐻𝑌) ∧ 𝐺 ∈ (𝑌𝐻𝑋)) ∧ (𝐺(⟨𝑋, 𝑌⟩ · 𝑋)𝐹) = ( 1 ‘𝑋)))
16		df-3an 1088	. . 3 ⊢ ((𝐹 ∈ (𝑋𝐻𝑌) ∧ 𝐺 ∈ (𝑌𝐻𝑋) ∧ (𝐺(⟨𝑋, 𝑌⟩ · 𝑋)𝐹) = ( 1 ‘𝑋)) ↔ ((𝐹 ∈ (𝑋𝐻𝑌) ∧ 𝐺 ∈ (𝑌𝐻𝑋)) ∧ (𝐺(⟨𝑋, 𝑌⟩ · 𝑋)𝐹) = ( 1 ‘𝑋)))
17	15, 16	bitr4i 278	. 2 ⊢ (𝐹{⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ (𝑋𝐻𝑌) ∧ 𝑔 ∈ (𝑌𝐻𝑋)) ∧ (𝑔(⟨𝑋, 𝑌⟩ · 𝑋)𝑓) = ( 1 ‘𝑋))}𝐺 ↔ (𝐹 ∈ (𝑋𝐻𝑌) ∧ 𝐺 ∈ (𝑌𝐻𝑋) ∧ (𝐺(⟨𝑋, 𝑌⟩ · 𝑋)𝐹) = ( 1 ‘𝑋)))
18	10, 17	bitrdi 287	1 ⊢ (𝜑 → (𝐹(𝑋𝑆𝑌)𝐺 ↔ (𝐹 ∈ (𝑋𝐻𝑌) ∧ 𝐺 ∈ (𝑌𝐻𝑋) ∧ (𝐺(⟨𝑋, 𝑌⟩ · 𝑋)𝐹) = ( 1 ‘𝑋))))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1540   ∈ wcel 2109  ⟨cop 4598   class class class wbr 5110  {copab 5172  ‘cfv 6514  (class class class)co 7390  Basecbs 17186  Hom chom 17238  compcco 17239  Catccat 17632  Idccid 17633  Sectcsect 17713

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 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2702  ax-rep 5237  ax-sep 5254  ax-nul 5264  ax-pow 5323  ax-pr 5390  ax-un 7714

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-ral 3046  df-rex 3055  df-reu 3357  df-rab 3409  df-v 3452  df-sbc 3757  df-csb 3866  df-dif 3920  df-un 3922  df-in 3924  df-ss 3934  df-nul 4300  df-if 4492  df-pw 4568  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-iun 4960  df-br 5111  df-opab 5173  df-mpt 5192  df-id 5536  df-xp 5647  df-rel 5648  df-cnv 5649  df-co 5650  df-dm 5651  df-rn 5652  df-res 5653  df-ima 5654  df-iota 6467  df-fun 6516  df-fn 6517  df-f 6518  df-f1 6519  df-fo 6520  df-f1o 6521  df-fv 6522  df-ov 7393  df-oprab 7394  df-mpo 7395  df-1st 7971  df-2nd 7972  df-sect 17716

This theorem is referenced by:  issect2  17723  sectcan  17724  sectco  17725  oppcsect  17747  sectmon  17751  monsect  17752  funcsect  17841  fucsect  17944  invfuc  17946  setcsect  18058  catciso  18080  rngcsect  20552  ringcsect  20586  rngcsectALTV  48267  ringcsectALTV  48301  catcsect  49391  thincsect  49460