MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  cicer Structured version   Visualization version   GIF version

Theorem cicer 18010
Description: Isomorphism is an equivalence relation on objects of a category. Remark 3.16 in [Adamek] p. 29. (Contributed by AV, 5-Apr-2020.)
Assertion
Ref Expression
cicer (𝐶 ∈ Cat → ( ≃𝑐 ‘𝐶) Er (Base‘𝐶))

Proof of Theorem cicer
Dummy variables 𝑓 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 relopab 5808 . . . . . 6 Rel {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶) ∧ ((Iso‘𝐶)‘⟨𝑥, 𝑦⟩) ≠ ∅)}
21a1i 11 . . . . 5 (𝐶 ∈ Cat → Rel {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶) ∧ ((Iso‘𝐶)‘⟨𝑥, 𝑦⟩) ≠ ∅)})
3 fveq2 6908 . . . . . . . . 9 (𝑓 = ⟨𝑥, 𝑦⟩ → ((Iso‘𝐶)‘𝑓) = ((Iso‘𝐶)‘⟨𝑥, 𝑦⟩))
43neeq1d 3018 . . . . . . . 8 (𝑓 = ⟨𝑥, 𝑦⟩ → (((Iso‘𝐶)‘𝑓) ≠ ∅ ↔ ((Iso‘𝐶)‘⟨𝑥, 𝑦⟩) ≠ ∅))
54rabxp 5703 . . . . . . 7 {𝑓 ∈ ((Base‘𝐶) × (Base‘𝐶)) ∣ ((Iso‘𝐶)‘𝑓) ≠ ∅} = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶) ∧ ((Iso‘𝐶)‘⟨𝑥, 𝑦⟩) ≠ ∅)}
65a1i 11 . . . . . 6 (𝐶 ∈ Cat → {𝑓 ∈ ((Base‘𝐶) × (Base‘𝐶)) ∣ ((Iso‘𝐶)‘𝑓) ≠ ∅} = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶) ∧ ((Iso‘𝐶)‘⟨𝑥, 𝑦⟩) ≠ ∅)})
76releqd 5760 . . . . 5 (𝐶 ∈ Cat → (Rel {𝑓 ∈ ((Base‘𝐶) × (Base‘𝐶)) ∣ ((Iso‘𝐶)‘𝑓) ≠ ∅} ↔ Rel {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶) ∧ ((Iso‘𝐶)‘⟨𝑥, 𝑦⟩) ≠ ∅)}))
82, 7mpbird 260 . . . 4 (𝐶 ∈ Cat → Rel {𝑓 ∈ ((Base‘𝐶) × (Base‘𝐶)) ∣ ((Iso‘𝐶)‘𝑓) ≠ ∅})
9 isofn 17979 . . . . . 6 (𝐶 ∈ Cat → (Iso‘𝐶) Fn ((Base‘𝐶) × (Base‘𝐶)))
10 fvex 6921 . . . . . . 7 (Base‘𝐶) ∈ V
11 sqxpexg 7793 . . . . . . 7 ((Base‘𝐶) ∈ V → ((Base‘𝐶) × (Base‘𝐶)) ∈ V)
1210, 11mp1i 14 . . . . . 6 (𝐶 ∈ Cat → ((Base‘𝐶) × (Base‘𝐶)) ∈ V)
13 0ex 5264 . . . . . . 7 ∅ ∈ V
1413a1i 11 . . . . . 6 (𝐶 ∈ Cat → ∅ ∈ V)
15 suppvalfn 8213 . . . . . 6 (((Iso‘𝐶) Fn ((Base‘𝐶) × (Base‘𝐶)) ∧ ((Base‘𝐶) × (Base‘𝐶)) ∈ V ∧ ∅ ∈ V) → ((Iso‘𝐶) supp ∅) = {𝑓 ∈ ((Base‘𝐶) × (Base‘𝐶)) ∣ ((Iso‘𝐶)‘𝑓) ≠ ∅})
169, 12, 14, 15syl3anc 1399 . . . . 5 (𝐶 ∈ Cat → ((Iso‘𝐶) supp ∅) = {𝑓 ∈ ((Base‘𝐶) × (Base‘𝐶)) ∣ ((Iso‘𝐶)‘𝑓) ≠ ∅})
1716releqd 5760 . . . 4 (𝐶 ∈ Cat → (Rel ((Iso‘𝐶) supp ∅) ↔ Rel {𝑓 ∈ ((Base‘𝐶) × (Base‘𝐶)) ∣ ((Iso‘𝐶)‘𝑓) ≠ ∅}))
188, 17mpbird 260 . . 3 (𝐶 ∈ Cat → Rel ((Iso‘𝐶) supp ∅))
19 cicfval 18001 . . . 4 (𝐶 ∈ Cat → ( ≃𝑐 ‘𝐶) = ((Iso‘𝐶) supp ∅))
2019releqd 5760 . . 3 (𝐶 ∈ Cat → (Rel ( ≃𝑐 ‘𝐶) ↔ Rel ((Iso‘𝐶) supp ∅)))
2118, 20mpbird 260 . 2 (𝐶 ∈ Cat → Rel ( ≃𝑐 ‘𝐶))
22 cicsym 18008 . 2 ((𝐶 ∈ Cat ∧ 𝑥( ≃𝑐 ‘𝐶)𝑦) → 𝑦( ≃𝑐 ‘𝐶)𝑥)
23 cictr 18009 . . 3 ((𝐶 ∈ Cat ∧ 𝑥( ≃𝑐 ‘𝐶)𝑦 ∧ 𝑦( ≃𝑐 ‘𝐶)𝑧) → 𝑥( ≃𝑐 ‘𝐶)𝑧)
24233expb 1138 . 2 ((𝐶 ∈ Cat ∧ (𝑥( ≃𝑐 ‘𝐶)𝑦 ∧ 𝑦( ≃𝑐 ‘𝐶)𝑧)) → 𝑥( ≃𝑐 ‘𝐶)𝑧)
25 cicref 18005 . . 3 ((𝐶 ∈ Cat ∧ 𝑥 ∈ (Base‘𝐶)) → 𝑥( ≃𝑐 ‘𝐶)𝑥)
26 ciclcl 18006 . . 3 ((𝐶 ∈ Cat ∧ 𝑥( ≃𝑐 ‘𝐶)𝑥) → 𝑥 ∈ (Base‘𝐶))
2725, 26impbida 813 . 2 (𝐶 ∈ Cat → (𝑥 ∈ (Base‘𝐶) ↔ 𝑥( ≃𝑐 ‘𝐶)𝑥))
2821, 22, 24, 27iserd 8772 1 (𝐶 ∈ Cat → ( ≃𝑐 ‘𝐶) Er (Base‘𝐶))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147   ≠ wne 2959  {crab 3416  Vcvv 3454  ∅c0 4281  ⟨cop 4838   class class class wbr 5106  {copab 5170   × cxp 5653  Rel wrel 5660   Fn wfn 6553  ‘cfv 6558  (class class class)co 7443   supp csupp 8204   Er wer 8742  Basecbs 17416  Catccat 17867  Isociso 17950   ≃𝑐 ccic 17999
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7775
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-f1 6563  df-fo 6564  df-f1o 6565  df-fv 6566  df-riota 7400  df-ov 7446  df-oprab 7447  df-mpo 7448  df-1st 8025  df-2nd 8026  df-supp 8205  df-er 8745  df-cat 17871  df-cid 17872  df-sect 17951  df-inv 17952  df-iso 17953  df-cic 18000
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator