Theorem cureq 8868

Description: Equality theorem for currying. (Contributed by Brendan Leahy, 2-Jun-2021.)

Assertion

Ref	Expression
cureq	⊢ (𝐴 = 𝐵 → curry 𝐴 = curry 𝐵)

Proof of Theorem cureq

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

Step	Hyp	Ref	Expression
1		dmeq 5882	. . . 4 ⊢ (𝐴 = 𝐵 → dom 𝐴 = dom 𝐵)
2	1	dmeqd 5884	. . 3 ⊢ (𝐴 = 𝐵 → dom dom 𝐴 = dom dom 𝐵)
3		breq 5105	. . . 4 ⊢ (𝐴 = 𝐵 → (⟨𝑥, 𝑦⟩𝐴𝑧 ↔ ⟨𝑥, 𝑦⟩𝐵𝑧))
4	3	opabbidv 5171	. . 3 ⊢ (𝐴 = 𝐵 → {⟨𝑦, 𝑧⟩ ∣ ⟨𝑥, 𝑦⟩𝐴𝑧} = {⟨𝑦, 𝑧⟩ ∣ ⟨𝑥, 𝑦⟩𝐵𝑧})
5	2, 4	mpteq12dv 5192	. 2 ⊢ (𝐴 = 𝐵 → (𝑥 ∈ dom dom 𝐴 ↦ {⟨𝑦, 𝑧⟩ ∣ ⟨𝑥, 𝑦⟩𝐴𝑧}) = (𝑥 ∈ dom dom 𝐵 ↦ {⟨𝑦, 𝑧⟩ ∣ ⟨𝑥, 𝑦⟩𝐵𝑧}))
6		df-cur 8263	. 2 ⊢ curry 𝐴 = (𝑥 ∈ dom dom 𝐴 ↦ {⟨𝑦, 𝑧⟩ ∣ ⟨𝑥, 𝑦⟩𝐴𝑧})
7		df-cur 8263	. 2 ⊢ curry 𝐵 = (𝑥 ∈ dom dom 𝐵 ↦ {⟨𝑦, 𝑧⟩ ∣ ⟨𝑥, 𝑦⟩𝐵𝑧})
8	5, 6, 7	3eqtr4g 2820	1 ⊢ (𝐴 = 𝐵 → curry 𝐴 = curry 𝐵)

This proof depends on syntax axioms:   → wi 4   = wceq 1570  ⟨cop 4590   class class class wbr 5103  {copab 5167   ↦ cmpt 5186  dom cdm 5648  curry ccur 8261

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-ext 2732

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-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-br 5104  df-opab 5168  df-mpt 5187  df-dm 5658  df-cur 8263

This theorem is used by:  curfv  8871  matunitlindf  22943