Theorem cureq 8914

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 5891	. . . 4 ⊢ (𝐴 = 𝐵 → dom 𝐴 = dom 𝐵)
2	1	dmeqd 5893	. . 3 ⊢ (𝐴 = 𝐵 → dom dom 𝐴 = dom dom 𝐵)
3		breq 5108	. . . 4 ⊢ (𝐴 = 𝐵 → (⟨𝑥, 𝑦⟩𝐴𝑧 ↔ ⟨𝑥, 𝑦⟩𝐵𝑧))
4	3	opabbidv 5174	. . 3 ⊢ (𝐴 = 𝐵 → {⟨𝑦, 𝑧⟩ ∣ ⟨𝑥, 𝑦⟩𝐴𝑧} = {⟨𝑦, 𝑧⟩ ∣ ⟨𝑥, 𝑦⟩𝐵𝑧})
5	2, 4	mpteq12dv 5195	. 2 ⊢ (𝐴 = 𝐵 → (𝑥 ∈ dom dom 𝐴 ↦ {⟨𝑦, 𝑧⟩ ∣ ⟨𝑥, 𝑦⟩𝐴𝑧}) = (𝑥 ∈ dom dom 𝐵 ↦ {⟨𝑦, 𝑧⟩ ∣ ⟨𝑥, 𝑦⟩𝐵𝑧}))
6		df-cur 8309	. 2 ⊢ curry 𝐴 = (𝑥 ∈ dom dom 𝐴 ↦ {⟨𝑦, 𝑧⟩ ∣ ⟨𝑥, 𝑦⟩𝐴𝑧})
7		df-cur 8309	. 2 ⊢ curry 𝐵 = (𝑥 ∈ dom dom 𝐵 ↦ {⟨𝑦, 𝑧⟩ ∣ ⟨𝑥, 𝑦⟩𝐵𝑧})
8	5, 6, 7	3eqtr4g 2823	1 ⊢ (𝐴 = 𝐵 → curry 𝐴 = curry 𝐵)

This proof depends on syntax axioms:   → wi 4   = wceq 1570  ⟨cop 4838   class class class wbr 5106  {copab 5170   ↦ cmpt 5189  dom cdm 5655  curry ccur 8307

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

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 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-br 5107  df-opab 5171  df-mpt 5190  df-dm 5665  df-cur 8309

This theorem is used by:  curfv  8917  matunitlindf  23023