Theorem homarcl 18110

Description: Reverse closure for an arrow. (Contributed by Mario Carneiro, 11-Jan-2017.)

Hypothesis

Ref	Expression
homarcl.h	⊢ 𝐻 = (Homa‘𝐶)

Assertion

Ref	Expression
homarcl	⊢ (𝐹 ∈ (𝑋𝐻𝑌) → 𝐶 ∈ Cat)

Proof of Theorem homarcl

Dummy variables 𝑥 𝑐 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		n0i 4296	. 2 ⊢ (𝐹 ∈ (𝑋𝐻𝑌) → ¬ (𝑋𝐻𝑌) = ∅)
2		homarcl.h	. . . . 5 ⊢ 𝐻 = (Homa‘𝐶)
3		df-homa 18108	. . . . . 6 ⊢ Homa = (𝑐 ∈ Cat ↦ (𝑥 ∈ ((Base‘𝑐) × (Base‘𝑐)) ↦ ({𝑥} × ((Hom ‘𝑐)‘𝑥))))
4	3	fvmptndm 7028	. . . . 5 ⊢ (¬ 𝐶 ∈ Cat → (Homa‘𝐶) = ∅)
5	2, 4	eqtrid 2813	. . . 4 ⊢ (¬ 𝐶 ∈ Cat → 𝐻 = ∅)
6	5	oveqd 7440	. . 3 ⊢ (¬ 𝐶 ∈ Cat → (𝑋𝐻𝑌) = (𝑋∅𝑌))
7		0ov 7460	. . 3 ⊢ (𝑋∅𝑌) = ∅
8	6, 7	eqtrdi 2817	. 2 ⊢ (¬ 𝐶 ∈ Cat → (𝑋𝐻𝑌) = ∅)
9	1, 8	nsyl2 142	1 ⊢ (𝐹 ∈ (𝑋𝐻𝑌) → 𝐶 ∈ Cat)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   = wceq 1570   ∈ wcel 2146  ∅c0 4289  {csn 4594   ↦ cmpt 5197   × cxp 5664  ‘cfv 6543  (class class class)co 7423  Basecbs 17294  Hom chom 17346  Catccat 17745  Hom_achoma 18105

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-sep 5262  ax-nul 5274  ax-pr 5409

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 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-rab 3420  df-v 3460  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-br 5115  df-opab 5179  df-mpt 5198  df-dm 5676  df-iota 6499  df-fv 6551  df-ov 7426  df-homa 18108

This theorem is used by:  homarcl2  18117  homarel  18118  homa1  18119  homahom2  18120  coahom  18152  arwlid  18154  arwrid  18155  arwass  18156