Users' Mathboxes Mathbox for Brendan Leahy < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  unceq Structured version   Visualization version   GIF version

Theorem unceq 37621
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.
StepHypRef Expression
1 fveq1 6875 . . . 4 (𝐴 = 𝐵 → (𝐴𝑥) = (𝐵𝑥))
21breqd 5130 . . 3 (𝐴 = 𝐵 → (𝑦(𝐴𝑥)𝑧𝑦(𝐵𝑥)𝑧))
32oprabbidv 7473 . 2 (𝐴 = 𝐵 → {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝑦(𝐴𝑥)𝑧} = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝑦(𝐵𝑥)𝑧})
4 df-unc 8267 . 2 uncurry 𝐴 = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝑦(𝐴𝑥)𝑧}
5 df-unc 8267 . 2 uncurry 𝐵 = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝑦(𝐵𝑥)𝑧}
63, 4, 53eqtr4g 2795 1 (𝐴 = 𝐵 → uncurry 𝐴 = uncurry 𝐵)
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1540   class class class wbr 5119  cfv 6531  {coprab 7406  uncurry cunc 8265
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-ext 2707
This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1543  df-ex 1780  df-sb 2065  df-clab 2714  df-cleq 2727  df-clel 2809  df-v 3461  df-ss 3943  df-uni 4884  df-br 5120  df-iota 6484  df-fv 6539  df-oprab 7409  df-unc 8267
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator