Theorem sectrcl2 49936

Description: Reverse closure for section relations. (Contributed by Zhi Wang, 14-Nov-2025.)

Hypotheses

Ref	Expression
sectrcl.s	⊢ 𝑆 = (Sect‘𝐶)
sectrcl.f	⊢ (𝜑 → 𝐹(𝑋𝑆𝑌)𝐺)
sectrcl2.b	⊢ 𝐵 = (Base‘𝐶)

Assertion

Ref	Expression
sectrcl2	⊢ (𝜑 → (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵))

Proof of Theorem sectrcl2

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

Step	Hyp	Ref	Expression
1		sectrcl.f	. . . 4 ⊢ (𝜑 → 𝐹(𝑋𝑆𝑌)𝐺)
2		df-br 5108	. . . 4 ⊢ (𝐹(𝑋𝑆𝑌)𝐺 ↔ ⟨𝐹, 𝐺⟩ ∈ (𝑋𝑆𝑌))
3	1, 2	sylib 221	. . 3 ⊢ (𝜑 → ⟨𝐹, 𝐺⟩ ∈ (𝑋𝑆𝑌))
4		sectrcl2.b	. . . . 5 ⊢ 𝐵 = (Base‘𝐶)
5		eqid 2762	. . . . 5 ⊢ (Hom ‘𝐶) = (Hom ‘𝐶)
6		eqid 2762	. . . . 5 ⊢ (comp‘𝐶) = (comp‘𝐶)
7		eqid 2762	. . . . 5 ⊢ (Id‘𝐶) = (Id‘𝐶)
8		sectrcl.s	. . . . 5 ⊢ 𝑆 = (Sect‘𝐶)
9	8, 1	sectrcl 49935	. . . . 5 ⊢ (𝜑 → 𝐶 ∈ Cat)
10	4, 5, 6, 7, 8, 9	sectffval 17843	. . . 4 ⊢ (𝜑 → 𝑆 = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ {⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦) ∧ 𝑔 ∈ (𝑦(Hom ‘𝐶)𝑥)) ∧ (𝑔(⟨𝑥, 𝑦⟩(comp‘𝐶)𝑥)𝑓) = ((Id‘𝐶)‘𝑥))}))
11	10	oveqd 7433	. . 3 ⊢ (𝜑 → (𝑋𝑆𝑌) = (𝑋(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ {⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦) ∧ 𝑔 ∈ (𝑦(Hom ‘𝐶)𝑥)) ∧ (𝑔(⟨𝑥, 𝑦⟩(comp‘𝐶)𝑥)𝑓) = ((Id‘𝐶)‘𝑥))})𝑌))
12	3, 11	eleqtrd 2864	. 2 ⊢ (𝜑 → ⟨𝐹, 𝐺⟩ ∈ (𝑋(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ {⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦) ∧ 𝑔 ∈ (𝑦(Hom ‘𝐶)𝑥)) ∧ (𝑔(⟨𝑥, 𝑦⟩(comp‘𝐶)𝑥)𝑓) = ((Id‘𝐶)‘𝑥))})𝑌))
13		eqid 2762	. . 3 ⊢ (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ {⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦) ∧ 𝑔 ∈ (𝑦(Hom ‘𝐶)𝑥)) ∧ (𝑔(⟨𝑥, 𝑦⟩(comp‘𝐶)𝑥)𝑓) = ((Id‘𝐶)‘𝑥))}) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ {⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦) ∧ 𝑔 ∈ (𝑦(Hom ‘𝐶)𝑥)) ∧ (𝑔(⟨𝑥, 𝑦⟩(comp‘𝐶)𝑥)𝑓) = ((Id‘𝐶)‘𝑥))})
14	13	elmpocl 7658	. 2 ⊢ (⟨𝐹, 𝐺⟩ ∈ (𝑋(𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ {⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ (𝑥(Hom ‘𝐶)𝑦) ∧ 𝑔 ∈ (𝑦(Hom ‘𝐶)𝑥)) ∧ (𝑔(⟨𝑥, 𝑦⟩(comp‘𝐶)𝑥)𝑓) = ((Id‘𝐶)‘𝑥))})𝑌) → (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵))
15	12, 14	syl 18	1 ⊢ (𝜑 → (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ⟨cop 4593   class class class wbr 5107  {copab 5171  ‘cfv 6537  (class class class)co 7416   ∈ cmpo 7418  Basecbs 17305  Hom chom 17357  compcco 17358  Idccid 17757  Sectcsect 17837

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 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7739

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 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7419  df-oprab 7420  df-mpo 7421  df-1st 7989  df-2nd 7990  df-sect 17840

This theorem is used by:  isinv2  49939  catcsect  50311