Theorem unceq 38716

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

Assertion

Ref	Expression
unceq	⊢ (𝐴 = 𝐵 → uncurry 𝐴 = uncurry 𝐵)

Proof of Theorem unceq

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

Step	Hyp	Ref	Expression
1		fveq1 6907	. . . 4 ⊢ (𝐴 = 𝐵 → (𝐴‘𝑥) = (𝐵‘𝑥))
2	1	breqd 5117	. . 3 ⊢ (𝐴 = 𝐵 → (𝑦(𝐴‘𝑥)𝑧 ↔ 𝑦(𝐵‘𝑥)𝑧))
3	2	oprabbidv 7509	. 2 ⊢ (𝐴 = 𝐵 → {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝑦(𝐴‘𝑥)𝑧} = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝑦(𝐵‘𝑥)𝑧})
4		df-unc 8313	. 2 ⊢ uncurry 𝐴 = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝑦(𝐴‘𝑥)𝑧}
5		df-unc 8313	. 2 ⊢ uncurry 𝐵 = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝑦(𝐵‘𝑥)𝑧}
6	3, 4, 5	3eqtr4g 2823	1 ⊢ (𝐴 = 𝐵 → uncurry 𝐴 = uncurry 𝐵)

This proof depends on syntax axioms:   → wi 4   = wceq 1570   class class class wbr 5106  ‘cfv 6558  {coprab 7444  uncurry cunc 8311

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-tru 1573  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-v 3456  df-ss 3901  df-uni 4871  df-br 5107  df-iota 6512  df-fv 6566  df-oprab 7447  df-unc 8313

This theorem is used by: (None)