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

Theorem curfpropd 18457
Description: If two categories have the same set of objects, morphisms, and compositions, then they curry the same functor to the same result. (Contributed by Mario Carneiro, 26-Jan-2017.)
Hypotheses
Ref Expression
curfpropd.1 (𝜑 → (Homf ‘𝐴) = (Homf ‘𝐵))
curfpropd.2 (𝜑 → (compf‘𝐴) = (compf‘𝐵))
curfpropd.3 (𝜑 → (Homf ‘𝐶) = (Homf ‘𝐷))
curfpropd.4 (𝜑 → (compf‘𝐶) = (compf‘𝐷))
curfpropd.a (𝜑 → 𝐴 ∈ Cat)
curfpropd.b (𝜑 → 𝐵 ∈ Cat)
curfpropd.c (𝜑 → 𝐶 ∈ Cat)
curfpropd.d (𝜑 → 𝐷 ∈ Cat)
curfpropd.f (𝜑 → 𝐹 ∈ ((𝐴 ×c 𝐶) Func 𝐸))
Assertion
Ref Expression
curfpropd (𝜑 → (⟨𝐴, 𝐶⟩ curryF 𝐹) = (⟨𝐵, 𝐷⟩ curryF 𝐹))

Proof of Theorem curfpropd
Dummy variables 𝑥 𝑔 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 curfpropd.1 . . . . 5 (𝜑 → (Homf ‘𝐴) = (Homf ‘𝐵))
21homfeqbas 17920 . . . 4 (𝜑 → (Base‘𝐴) = (Base‘𝐵))
3 curfpropd.3 . . . . . . . 8 (𝜑 → (Homf ‘𝐶) = (Homf ‘𝐷))
43homfeqbas 17920 . . . . . . 7 (𝜑 → (Base‘𝐶) = (Base‘𝐷))
54adantr 486 . . . . . 6 ((𝜑 ∧ 𝑥 ∈ (Base‘𝐴)) → (Base‘𝐶) = (Base‘𝐷))
65mpteq1d 5201 . . . . 5 ((𝜑 ∧ 𝑥 ∈ (Base‘𝐴)) → (𝑦 ∈ (Base‘𝐶) ↦ (𝑥(1st ‘𝐹)𝑦)) = (𝑦 ∈ (Base‘𝐷) ↦ (𝑥(1st ‘𝐹)𝑦)))
75adantr 486 . . . . . 6 (((𝜑 ∧ 𝑥 ∈ (Base‘𝐴)) ∧ 𝑦 ∈ (Base‘𝐶)) → (Base‘𝐶) = (Base‘𝐷))
8 eqid 2763 . . . . . . . 8 (Base‘𝐶) = (Base‘𝐶)
9 eqid 2763 . . . . . . . 8 (Hom ‘𝐶) = (Hom ‘𝐶)
10 eqid 2763 . . . . . . . 8 (Hom ‘𝐷) = (Hom ‘𝐷)
113ad2antrr 739 . . . . . . . 8 (((𝜑 ∧ 𝑥 ∈ (Base‘𝐴)) ∧ (𝑦 ∈ (Base‘𝐶) ∧ 𝑧 ∈ (Base‘𝐶))) → (Homf ‘𝐶) = (Homf ‘𝐷))
12 simprl 783 . . . . . . . 8 (((𝜑 ∧ 𝑥 ∈ (Base‘𝐴)) ∧ (𝑦 ∈ (Base‘𝐶) ∧ 𝑧 ∈ (Base‘𝐶))) → 𝑦 ∈ (Base‘𝐶))
13 simprr 785 . . . . . . . 8 (((𝜑 ∧ 𝑥 ∈ (Base‘𝐴)) ∧ (𝑦 ∈ (Base‘𝐶) ∧ 𝑧 ∈ (Base‘𝐶))) → 𝑧 ∈ (Base‘𝐶))
148, 9, 10, 11, 12, 13homfeqval 17921 . . . . . . 7 (((𝜑 ∧ 𝑥 ∈ (Base‘𝐴)) ∧ (𝑦 ∈ (Base‘𝐶) ∧ 𝑧 ∈ (Base‘𝐶))) → (𝑦(Hom ‘𝐶)𝑧) = (𝑦(Hom ‘𝐷)𝑧))
15 curfpropd.2 . . . . . . . . . . 11 (𝜑 → (compf‘𝐴) = (compf‘𝐵))
16 curfpropd.a . . . . . . . . . . 11 (𝜑 → 𝐴 ∈ Cat)
17 curfpropd.b . . . . . . . . . . 11 (𝜑 → 𝐵 ∈ Cat)
181, 15, 16, 17cidpropd 17934 . . . . . . . . . 10 (𝜑 → (Id‘𝐴) = (Id‘𝐵))
1918ad2antrr 739 . . . . . . . . 9 (((𝜑 ∧ 𝑥 ∈ (Base‘𝐴)) ∧ (𝑦 ∈ (Base‘𝐶) ∧ 𝑧 ∈ (Base‘𝐶))) → (Id‘𝐴) = (Id‘𝐵))
2019fveq1d 6918 . . . . . . . 8 (((𝜑 ∧ 𝑥 ∈ (Base‘𝐴)) ∧ (𝑦 ∈ (Base‘𝐶) ∧ 𝑧 ∈ (Base‘𝐶))) → ((Id‘𝐴)‘𝑥) = ((Id‘𝐵)‘𝑥))
2120oveq1d 7466 . . . . . . 7 (((𝜑 ∧ 𝑥 ∈ (Base‘𝐴)) ∧ (𝑦 ∈ (Base‘𝐶) ∧ 𝑧 ∈ (Base‘𝐶))) → (((Id‘𝐴)‘𝑥)(⟨𝑥, 𝑦⟩(2nd ‘𝐹)⟨𝑥, 𝑧⟩)𝑔) = (((Id‘𝐵)‘𝑥)(⟨𝑥, 𝑦⟩(2nd ‘𝐹)⟨𝑥, 𝑧⟩)𝑔))
2214, 21mpteq12dv 5198 . . . . . 6 (((𝜑 ∧ 𝑥 ∈ (Base‘𝐴)) ∧ (𝑦 ∈ (Base‘𝐶) ∧ 𝑧 ∈ (Base‘𝐶))) → (𝑔 ∈ (𝑦(Hom ‘𝐶)𝑧) ↦ (((Id‘𝐴)‘𝑥)(⟨𝑥, 𝑦⟩(2nd ‘𝐹)⟨𝑥, 𝑧⟩)𝑔)) = (𝑔 ∈ (𝑦(Hom ‘𝐷)𝑧) ↦ (((Id‘𝐵)‘𝑥)(⟨𝑥, 𝑦⟩(2nd ‘𝐹)⟨𝑥, 𝑧⟩)𝑔)))
235, 7, 22mpoeq123dva 7525 . . . . 5 ((𝜑 ∧ 𝑥 ∈ (Base‘𝐴)) → (𝑦 ∈ (Base‘𝐶), 𝑧 ∈ (Base‘𝐶) ↦ (𝑔 ∈ (𝑦(Hom ‘𝐶)𝑧) ↦ (((Id‘𝐴)‘𝑥)(⟨𝑥, 𝑦⟩(2nd ‘𝐹)⟨𝑥, 𝑧⟩)𝑔))) = (𝑦 ∈ (Base‘𝐷), 𝑧 ∈ (Base‘𝐷) ↦ (𝑔 ∈ (𝑦(Hom ‘𝐷)𝑧) ↦ (((Id‘𝐵)‘𝑥)(⟨𝑥, 𝑦⟩(2nd ‘𝐹)⟨𝑥, 𝑧⟩)𝑔))))
246, 23opeq12d 4853 . . . 4 ((𝜑 ∧ 𝑥 ∈ (Base‘𝐴)) → ⟨(𝑦 ∈ (Base‘𝐶) ↦ (𝑥(1st ‘𝐹)𝑦)), (𝑦 ∈ (Base‘𝐶), 𝑧 ∈ (Base‘𝐶) ↦ (𝑔 ∈ (𝑦(Hom ‘𝐶)𝑧) ↦ (((Id‘𝐴)‘𝑥)(⟨𝑥, 𝑦⟩(2nd ‘𝐹)⟨𝑥, 𝑧⟩)𝑔)))⟩ = ⟨(𝑦 ∈ (Base‘𝐷) ↦ (𝑥(1st ‘𝐹)𝑦)), (𝑦 ∈ (Base‘𝐷), 𝑧 ∈ (Base‘𝐷) ↦ (𝑔 ∈ (𝑦(Hom ‘𝐷)𝑧) ↦ (((Id‘𝐵)‘𝑥)(⟨𝑥, 𝑦⟩(2nd ‘𝐹)⟨𝑥, 𝑧⟩)𝑔)))⟩)
252, 24mpteq12dva 5197 . . 3 (𝜑 → (𝑥 ∈ (Base‘𝐴) ↦ ⟨(𝑦 ∈ (Base‘𝐶) ↦ (𝑥(1st ‘𝐹)𝑦)), (𝑦 ∈ (Base‘𝐶), 𝑧 ∈ (Base‘𝐶) ↦ (𝑔 ∈ (𝑦(Hom ‘𝐶)𝑧) ↦ (((Id‘𝐴)‘𝑥)(⟨𝑥, 𝑦⟩(2nd ‘𝐹)⟨𝑥, 𝑧⟩)𝑔)))⟩) = (𝑥 ∈ (Base‘𝐵) ↦ ⟨(𝑦 ∈ (Base‘𝐷) ↦ (𝑥(1st ‘𝐹)𝑦)), (𝑦 ∈ (Base‘𝐷), 𝑧 ∈ (Base‘𝐷) ↦ (𝑔 ∈ (𝑦(Hom ‘𝐷)𝑧) ↦ (((Id‘𝐵)‘𝑥)(⟨𝑥, 𝑦⟩(2nd ‘𝐹)⟨𝑥, 𝑧⟩)𝑔)))⟩))
262adantr 486 . . . 4 ((𝜑 ∧ 𝑥 ∈ (Base‘𝐴)) → (Base‘𝐴) = (Base‘𝐵))
27 eqid 2763 . . . . . 6 (Base‘𝐴) = (Base‘𝐴)
28 eqid 2763 . . . . . 6 (Hom ‘𝐴) = (Hom ‘𝐴)
29 eqid 2763 . . . . . 6 (Hom ‘𝐵) = (Hom ‘𝐵)
301adantr 486 . . . . . 6 ((𝜑 ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑦 ∈ (Base‘𝐴))) → (Homf ‘𝐴) = (Homf ‘𝐵))
31 simprl 783 . . . . . 6 ((𝜑 ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑦 ∈ (Base‘𝐴))) → 𝑥 ∈ (Base‘𝐴))
32 simprr 785 . . . . . 6 ((𝜑 ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑦 ∈ (Base‘𝐴))) → 𝑦 ∈ (Base‘𝐴))
3327, 28, 29, 30, 31, 32homfeqval 17921 . . . . 5 ((𝜑 ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑦 ∈ (Base‘𝐴))) → (𝑥(Hom ‘𝐴)𝑦) = (𝑥(Hom ‘𝐵)𝑦))
344ad2antrr 739 . . . . . 6 (((𝜑 ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑦 ∈ (Base‘𝐴))) ∧ 𝑔 ∈ (𝑥(Hom ‘𝐴)𝑦)) → (Base‘𝐶) = (Base‘𝐷))
35 curfpropd.4 . . . . . . . . . 10 (𝜑 → (compf‘𝐶) = (compf‘𝐷))
36 curfpropd.c . . . . . . . . . 10 (𝜑 → 𝐶 ∈ Cat)
37 curfpropd.d . . . . . . . . . 10 (𝜑 → 𝐷 ∈ Cat)
383, 35, 36, 37cidpropd 17934 . . . . . . . . 9 (𝜑 → (Id‘𝐶) = (Id‘𝐷))
3938ad3antrrr 743 . . . . . . . 8 ((((𝜑 ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑦 ∈ (Base‘𝐴))) ∧ 𝑔 ∈ (𝑥(Hom ‘𝐴)𝑦)) ∧ 𝑧 ∈ (Base‘𝐶)) → (Id‘𝐶) = (Id‘𝐷))
4039fveq1d 6918 . . . . . . 7 ((((𝜑 ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑦 ∈ (Base‘𝐴))) ∧ 𝑔 ∈ (𝑥(Hom ‘𝐴)𝑦)) ∧ 𝑧 ∈ (Base‘𝐶)) → ((Id‘𝐶)‘𝑧) = ((Id‘𝐷)‘𝑧))
4140oveq2d 7467 . . . . . 6 ((((𝜑 ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑦 ∈ (Base‘𝐴))) ∧ 𝑔 ∈ (𝑥(Hom ‘𝐴)𝑦)) ∧ 𝑧 ∈ (Base‘𝐶)) → (𝑔(⟨𝑥, 𝑧⟩(2nd ‘𝐹)⟨𝑦, 𝑧⟩)((Id‘𝐶)‘𝑧)) = (𝑔(⟨𝑥, 𝑧⟩(2nd ‘𝐹)⟨𝑦, 𝑧⟩)((Id‘𝐷)‘𝑧)))
4234, 41mpteq12dva 5197 . . . . 5 (((𝜑 ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑦 ∈ (Base‘𝐴))) ∧ 𝑔 ∈ (𝑥(Hom ‘𝐴)𝑦)) → (𝑧 ∈ (Base‘𝐶) ↦ (𝑔(⟨𝑥, 𝑧⟩(2nd ‘𝐹)⟨𝑦, 𝑧⟩)((Id‘𝐶)‘𝑧))) = (𝑧 ∈ (Base‘𝐷) ↦ (𝑔(⟨𝑥, 𝑧⟩(2nd ‘𝐹)⟨𝑦, 𝑧⟩)((Id‘𝐷)‘𝑧))))
4333, 42mpteq12dva 5197 . . . 4 ((𝜑 ∧ (𝑥 ∈ (Base‘𝐴) ∧ 𝑦 ∈ (Base‘𝐴))) → (𝑔 ∈ (𝑥(Hom ‘𝐴)𝑦) ↦ (𝑧 ∈ (Base‘𝐶) ↦ (𝑔(⟨𝑥, 𝑧⟩(2nd ‘𝐹)⟨𝑦, 𝑧⟩)((Id‘𝐶)‘𝑧)))) = (𝑔 ∈ (𝑥(Hom ‘𝐵)𝑦) ↦ (𝑧 ∈ (Base‘𝐷) ↦ (𝑔(⟨𝑥, 𝑧⟩(2nd ‘𝐹)⟨𝑦, 𝑧⟩)((Id‘𝐷)‘𝑧)))))
442, 26, 43mpoeq123dva 7525 . . 3 (𝜑 → (𝑥 ∈ (Base‘𝐴), 𝑦 ∈ (Base‘𝐴) ↦ (𝑔 ∈ (𝑥(Hom ‘𝐴)𝑦) ↦ (𝑧 ∈ (Base‘𝐶) ↦ (𝑔(⟨𝑥, 𝑧⟩(2nd ‘𝐹)⟨𝑦, 𝑧⟩)((Id‘𝐶)‘𝑧))))) = (𝑥 ∈ (Base‘𝐵), 𝑦 ∈ (Base‘𝐵) ↦ (𝑔 ∈ (𝑥(Hom ‘𝐵)𝑦) ↦ (𝑧 ∈ (Base‘𝐷) ↦ (𝑔(⟨𝑥, 𝑧⟩(2nd ‘𝐹)⟨𝑦, 𝑧⟩)((Id‘𝐷)‘𝑧))))))
4525, 44opeq12d 4853 . 2 (𝜑 → ⟨(𝑥 ∈ (Base‘𝐴) ↦ ⟨(𝑦 ∈ (Base‘𝐶) ↦ (𝑥(1st ‘𝐹)𝑦)), (𝑦 ∈ (Base‘𝐶), 𝑧 ∈ (Base‘𝐶) ↦ (𝑔 ∈ (𝑦(Hom ‘𝐶)𝑧) ↦ (((Id‘𝐴)‘𝑥)(⟨𝑥, 𝑦⟩(2nd ‘𝐹)⟨𝑥, 𝑧⟩)𝑔)))⟩), (𝑥 ∈ (Base‘𝐴), 𝑦 ∈ (Base‘𝐴) ↦ (𝑔 ∈ (𝑥(Hom ‘𝐴)𝑦) ↦ (𝑧 ∈ (Base‘𝐶) ↦ (𝑔(⟨𝑥, 𝑧⟩(2nd ‘𝐹)⟨𝑦, 𝑧⟩)((Id‘𝐶)‘𝑧)))))⟩ = ⟨(𝑥 ∈ (Base‘𝐵) ↦ ⟨(𝑦 ∈ (Base‘𝐷) ↦ (𝑥(1st ‘𝐹)𝑦)), (𝑦 ∈ (Base‘𝐷), 𝑧 ∈ (Base‘𝐷) ↦ (𝑔 ∈ (𝑦(Hom ‘𝐷)𝑧) ↦ (((Id‘𝐵)‘𝑥)(⟨𝑥, 𝑦⟩(2nd ‘𝐹)⟨𝑥, 𝑧⟩)𝑔)))⟩), (𝑥 ∈ (Base‘𝐵), 𝑦 ∈ (Base‘𝐵) ↦ (𝑔 ∈ (𝑥(Hom ‘𝐵)𝑦) ↦ (𝑧 ∈ (Base‘𝐷) ↦ (𝑔(⟨𝑥, 𝑧⟩(2nd ‘𝐹)⟨𝑦, 𝑧⟩)((Id‘𝐷)‘𝑧)))))⟩)
46 eqid 2763 . . 3 (⟨𝐴, 𝐶⟩ curryF 𝐹) = (⟨𝐴, 𝐶⟩ curryF 𝐹)
47 curfpropd.f . . 3 (𝜑 → 𝐹 ∈ ((𝐴 ×c 𝐶) Func 𝐸))
48 eqid 2763 . . 3 (Id‘𝐴) = (Id‘𝐴)
49 eqid 2763 . . 3 (Id‘𝐶) = (Id‘𝐶)
5046, 27, 16, 36, 47, 8, 9, 48, 28, 49curfval 18447 . 2 (𝜑 → (⟨𝐴, 𝐶⟩ curryF 𝐹) = ⟨(𝑥 ∈ (Base‘𝐴) ↦ ⟨(𝑦 ∈ (Base‘𝐶) ↦ (𝑥(1st ‘𝐹)𝑦)), (𝑦 ∈ (Base‘𝐶), 𝑧 ∈ (Base‘𝐶) ↦ (𝑔 ∈ (𝑦(Hom ‘𝐶)𝑧) ↦ (((Id‘𝐴)‘𝑥)(⟨𝑥, 𝑦⟩(2nd ‘𝐹)⟨𝑥, 𝑧⟩)𝑔)))⟩), (𝑥 ∈ (Base‘𝐴), 𝑦 ∈ (Base‘𝐴) ↦ (𝑔 ∈ (𝑥(Hom ‘𝐴)𝑦) ↦ (𝑧 ∈ (Base‘𝐶) ↦ (𝑔(⟨𝑥, 𝑧⟩(2nd ‘𝐹)⟨𝑦, 𝑧⟩)((Id‘𝐶)‘𝑧)))))⟩)
51 eqid 2763 . . 3 (⟨𝐵, 𝐷⟩ curryF 𝐹) = (⟨𝐵, 𝐷⟩ curryF 𝐹)
52 eqid 2763 . . 3 (Base‘𝐵) = (Base‘𝐵)
531, 15, 3, 35, 16, 17, 36, 37xpcpropd 18432 . . . . 5 (𝜑 → (𝐴 ×c 𝐶) = (𝐵 ×c 𝐷))
5453oveq1d 7466 . . . 4 (𝜑 → ((𝐴 ×c 𝐶) Func 𝐸) = ((𝐵 ×c 𝐷) Func 𝐸))
5547, 54eleqtrd 2866 . . 3 (𝜑 → 𝐹 ∈ ((𝐵 ×c 𝐷) Func 𝐸))
56 eqid 2763 . . 3 (Base‘𝐷) = (Base‘𝐷)
57 eqid 2763 . . 3 (Id‘𝐵) = (Id‘𝐵)
58 eqid 2763 . . 3 (Id‘𝐷) = (Id‘𝐷)
5951, 52, 17, 37, 55, 56, 10, 57, 29, 58curfval 18447 . 2 (𝜑 → (⟨𝐵, 𝐷⟩ curryF 𝐹) = ⟨(𝑥 ∈ (Base‘𝐵) ↦ ⟨(𝑦 ∈ (Base‘𝐷) ↦ (𝑥(1st ‘𝐹)𝑦)), (𝑦 ∈ (Base‘𝐷), 𝑧 ∈ (Base‘𝐷) ↦ (𝑔 ∈ (𝑦(Hom ‘𝐷)𝑧) ↦ (((Id‘𝐵)‘𝑥)(⟨𝑥, 𝑦⟩(2nd ‘𝐹)⟨𝑥, 𝑧⟩)𝑔)))⟩), (𝑥 ∈ (Base‘𝐵), 𝑦 ∈ (Base‘𝐵) ↦ (𝑔 ∈ (𝑥(Hom ‘𝐵)𝑦) ↦ (𝑧 ∈ (Base‘𝐷) ↦ (𝑔(⟨𝑥, 𝑧⟩(2nd ‘𝐹)⟨𝑦, 𝑧⟩)((Id‘𝐷)‘𝑧)))))⟩)
6045, 50, 593eqtr4d 2808 1 (𝜑 → (⟨𝐴, 𝐶⟩ curryF 𝐹) = (⟨𝐵, 𝐷⟩ curryF 𝐹))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ⟨cop 4840   ↦ cmpt 5192  ‘cfv 6566  (class class class)co 7451   ∈ cmpo 7453  1st c1st 8033  2nd c2nd 8034  Basecbs 17431  Hom chom 17483  Catccat 17888  Idccid 17889  Homf chomf 17890  compfccomf 17891   Func cfunc 18079   ×c cxpc 18392   curryF ccurf 18434
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 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783  ax-cnex 11295  ax-resscn 11296  ax-1cn 11297  ax-icn 11298  ax-addcl 11299  ax-addrcl 11300  ax-mulcl 11301  ax-mulrcl 11302  ax-mulcom 11303  ax-addass 11304  ax-mulass 11305  ax-distr 11306  ax-i2m1 11307  ax-1ne0 11308  ax-1rid 11309  ax-rnegex 11310  ax-rrecex 11311  ax-cnre 11312  ax-pre-lttri 11313  ax-pre-lttrn 11314  ax-pre-ltadd 11315  ax-pre-mulgt0 11316
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  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-nel 3066  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  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-tp 4593  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-riota 7408  df-ov 7454  df-oprab 7455  df-mpo 7456  df-om 7912  df-1st 8035  df-2nd 8036  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-rdg 8456  df-1o 8514  df-er 8755  df-en 9012  df-dom 9013  df-sdom 9014  df-fin 9015  df-pnf 11384  df-mnf 11385  df-xr 11386  df-ltxr 11387  df-le 11388  df-sub 11582  df-neg 11583  df-nn 12376  df-2 12445  df-3 12446  df-4 12447  df-5 12448  df-6 12449  df-7 12450  df-8 12451  df-9 12452  df-n0 12647  df-z 12734  df-dec 12855  df-uz 13006  df-fz 13680  df-struct 17369  df-slot 17404  df-ndx 17416  df-base 17432  df-hom 17497  df-cco 17498  df-cat 17892  df-cid 17893  df-homf 17894  df-comf 17895  df-xpc 18396  df-curf 18438
This theorem is used by:  yonpropd  18492  oppcyon  18493  diagpropd  50745
  Copyright terms: Public domain W3C validator