Theorem thincsect 50497

Description: In a thin category, one morphism is a section of another iff they are pointing towards each other. (Contributed by Zhi Wang, 24-Sep-2024.)

Hypotheses

Ref	Expression
thincsect.c	⊢ (𝜑 → 𝐶 ∈ ThinCat)
thincsect.b	⊢ 𝐵 = (Base‘𝐶)
thincsect.x	⊢ (𝜑 → 𝑋 ∈ 𝐵)
thincsect.y	⊢ (𝜑 → 𝑌 ∈ 𝐵)
thincsect.s	⊢ 𝑆 = (Sect‘𝐶)
thincsect.h	⊢ 𝐻 = (Hom ‘𝐶)

Assertion

Ref	Expression
thincsect	⊢ (𝜑 → (𝐹(𝑋𝑆𝑌)𝐺 ↔ (𝐹 ∈ (𝑋𝐻𝑌) ∧ 𝐺 ∈ (𝑌𝐻𝑋))))

Proof of Theorem thincsect

Step	Hyp	Ref	Expression
1		thincsect.b	. . . 4 ⊢ 𝐵 = (Base‘𝐶)
2		thincsect.h	. . . 4 ⊢ 𝐻 = (Hom ‘𝐶)
3		eqid 2760	. . . 4 ⊢ (comp‘𝐶) = (comp‘𝐶)
4		eqid 2760	. . . 4 ⊢ (Id‘𝐶) = (Id‘𝐶)
5		thincsect.s	. . . 4 ⊢ 𝑆 = (Sect‘𝐶)
6		thincsect.c	. . . . 5 ⊢ (𝜑 → 𝐶 ∈ ThinCat)
7	6	thinccatd 50453	. . . 4 ⊢ (𝜑 → 𝐶 ∈ Cat)
8		thincsect.x	. . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
9		thincsect.y	. . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝐵)
10	1, 2, 3, 4, 5, 7, 8, 9	issect 17889	. . 3 ⊢ (𝜑 → (𝐹(𝑋𝑆𝑌)𝐺 ↔ (𝐹 ∈ (𝑋𝐻𝑌) ∧ 𝐺 ∈ (𝑌𝐻𝑋) ∧ (𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋))))
11		df-3an 1105	. . 3 ⊢ ((𝐹 ∈ (𝑋𝐻𝑌) ∧ 𝐺 ∈ (𝑌𝐻𝑋) ∧ (𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋)) ↔ ((𝐹 ∈ (𝑋𝐻𝑌) ∧ 𝐺 ∈ (𝑌𝐻𝑋)) ∧ (𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋)))
12	10, 11	bitrdi 290	. 2 ⊢ (𝜑 → (𝐹(𝑋𝑆𝑌)𝐺 ↔ ((𝐹 ∈ (𝑋𝐻𝑌) ∧ 𝐺 ∈ (𝑌𝐻𝑋)) ∧ (𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋))))
13	6	adantr 486	. . 3 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝑋𝐻𝑌) ∧ 𝐺 ∈ (𝑌𝐻𝑋))) → 𝐶 ∈ ThinCat)
14	8	adantr 486	. . 3 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝑋𝐻𝑌) ∧ 𝐺 ∈ (𝑌𝐻𝑋))) → 𝑋 ∈ 𝐵)
15	7	adantr 486	. . . 4 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝑋𝐻𝑌) ∧ 𝐺 ∈ (𝑌𝐻𝑋))) → 𝐶 ∈ Cat)
16	9	adantr 486	. . . 4 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝑋𝐻𝑌) ∧ 𝐺 ∈ (𝑌𝐻𝑋))) → 𝑌 ∈ 𝐵)
17		simprl 783	. . . 4 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝑋𝐻𝑌) ∧ 𝐺 ∈ (𝑌𝐻𝑋))) → 𝐹 ∈ (𝑋𝐻𝑌))
18		simprr 785	. . . 4 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝑋𝐻𝑌) ∧ 𝐺 ∈ (𝑌𝐻𝑋))) → 𝐺 ∈ (𝑌𝐻𝑋))
19	1, 2, 3, 15, 14, 16, 14, 17, 18	catcocl 17820	. . 3 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝑋𝐻𝑌) ∧ 𝐺 ∈ (𝑌𝐻𝑋))) → (𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) ∈ (𝑋𝐻𝑋))
20	13, 1, 2, 14, 4, 19	thincid 50462	. 2 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝑋𝐻𝑌) ∧ 𝐺 ∈ (𝑌𝐻𝑋))) → (𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋))
21	12, 20	mpbiran3d 49829	1 ⊢ (𝜑 → (𝐹(𝑋𝑆𝑌)𝐺 ↔ (𝐹 ∈ (𝑋𝐻𝑌) ∧ 𝐺 ∈ (𝑌𝐻𝑋))))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ⟨cop 4589   class class class wbr 5102  ‘cfv 6527  (class class class)co 7408  Basecbs 17348  Hom chom 17400  compcco 17401  Catccat 17799  Idccid 17800  Sectcsect 17880  ThinCatcthinc 50447

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7734

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5542  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-iota 6483  df-fun 6529  df-fn 6530  df-f 6531  df-f1 6532  df-fo 6533  df-f1o 6534  df-fv 6535  df-riota 7365  df-ov 7411  df-oprab 7412  df-mpo 7413  df-1st 7984  df-2nd 7985  df-cat 17803  df-cid 17804  df-sect 17883  df-thinc 50448

This theorem is used by:  thincsect2  50498  thinciso  50500