Theorem cureq 38275

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 5892	. . . 4 ⊢ (𝐴 = 𝐵 → dom 𝐴 = dom 𝐵)
2	1	dmeqd 5894	. . 3 ⊢ (𝐴 = 𝐵 → dom dom 𝐴 = dom dom 𝐵)
3		breq 5110	. . . 4 ⊢ (𝐴 = 𝐵 → (⟨𝑥, 𝑦⟩𝐴𝑧 ↔ ⟨𝑥, 𝑦⟩𝐵𝑧))
4	3	opabbidv 5176	. . 3 ⊢ (𝐴 = 𝐵 → {⟨𝑦, 𝑧⟩ ∣ ⟨𝑥, 𝑦⟩𝐴𝑧} = {⟨𝑦, 𝑧⟩ ∣ ⟨𝑥, 𝑦⟩𝐵𝑧})
5	2, 4	mpteq12dv 5197	. 2 ⊢ (𝐴 = 𝐵 → (𝑥 ∈ dom dom 𝐴 ↦ {⟨𝑦, 𝑧⟩ ∣ ⟨𝑥, 𝑦⟩𝐴𝑧}) = (𝑥 ∈ dom dom 𝐵 ↦ {⟨𝑦, 𝑧⟩ ∣ ⟨𝑥, 𝑦⟩𝐵𝑧}))
6		df-cur 8261	. 2 ⊢ curry 𝐴 = (𝑥 ∈ dom dom 𝐴 ↦ {⟨𝑦, 𝑧⟩ ∣ ⟨𝑥, 𝑦⟩𝐴𝑧})
7		df-cur 8261	. 2 ⊢ curry 𝐵 = (𝑥 ∈ dom dom 𝐵 ↦ {⟨𝑦, 𝑧⟩ ∣ ⟨𝑥, 𝑦⟩𝐵𝑧})
8	5, 6, 7	3eqtr4g 2822	1 ⊢ (𝐴 = 𝐵 → curry 𝐴 = curry 𝐵)

This proof depends on syntax axioms:   → wi 4   = wceq 1569  ⟨cop 4594   class class class wbr 5108  {copab 5172   ↦ cmpt 5191  dom cdm 5660  curry ccur 8259

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-ext 2734

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-sb 2096  df-clab 2741  df-cleq 2754  df-clel 2837  df-rab 3416  df-v 3456  df-dif 3907  df-un 3909  df-ss 3921  df-nul 4286  df-if 4487  df-sn 4589  df-pr 4591  df-op 4595  df-br 5109  df-opab 5173  df-mpt 5192  df-dm 5670  df-cur 8261

This theorem is used by:  curfv  38279  matunitlindf  38297