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

Theorem uncov 37107
Description: Value of uncurrying. (Contributed by Brendan Leahy, 2-Jun-2021.)
Assertion
Ref Expression
uncov ((𝐴𝑉𝐵𝑊) → (𝐴uncurry 𝐹𝐵) = ((𝐹𝐴)‘𝐵))

Proof of Theorem uncov
Dummy variables 𝑥 𝑤 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-br 5153 . . . . 5 (⟨𝐴, 𝐵⟩uncurry 𝐹𝑤 ↔ ⟨⟨𝐴, 𝐵⟩, 𝑤⟩ ∈ uncurry 𝐹)
2 df-unc 8280 . . . . . 6 uncurry 𝐹 = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝑦(𝐹𝑥)𝑧}
32eleq2i 2821 . . . . 5 (⟨⟨𝐴, 𝐵⟩, 𝑤⟩ ∈ uncurry 𝐹 ↔ ⟨⟨𝐴, 𝐵⟩, 𝑤⟩ ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝑦(𝐹𝑥)𝑧})
41, 3bitri 274 . . . 4 (⟨𝐴, 𝐵⟩uncurry 𝐹𝑤 ↔ ⟨⟨𝐴, 𝐵⟩, 𝑤⟩ ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝑦(𝐹𝑥)𝑧})
5 vex 3477 . . . . 5 𝑤 ∈ V
6 simp2 1134 . . . . . . 7 ((𝑥 = 𝐴𝑦 = 𝐵𝑧 = 𝑤) → 𝑦 = 𝐵)
7 fveq2 6902 . . . . . . . 8 (𝑥 = 𝐴 → (𝐹𝑥) = (𝐹𝐴))
873ad2ant1 1130 . . . . . . 7 ((𝑥 = 𝐴𝑦 = 𝐵𝑧 = 𝑤) → (𝐹𝑥) = (𝐹𝐴))
9 simp3 1135 . . . . . . 7 ((𝑥 = 𝐴𝑦 = 𝐵𝑧 = 𝑤) → 𝑧 = 𝑤)
106, 8, 9breq123d 5166 . . . . . 6 ((𝑥 = 𝐴𝑦 = 𝐵𝑧 = 𝑤) → (𝑦(𝐹𝑥)𝑧𝐵(𝐹𝐴)𝑤))
1110eloprabga 7534 . . . . 5 ((𝐴𝑉𝐵𝑊𝑤 ∈ V) → (⟨⟨𝐴, 𝐵⟩, 𝑤⟩ ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝑦(𝐹𝑥)𝑧} ↔ 𝐵(𝐹𝐴)𝑤))
125, 11mp3an3 1446 . . . 4 ((𝐴𝑉𝐵𝑊) → (⟨⟨𝐴, 𝐵⟩, 𝑤⟩ ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝑦(𝐹𝑥)𝑧} ↔ 𝐵(𝐹𝐴)𝑤))
134, 12bitrid 282 . . 3 ((𝐴𝑉𝐵𝑊) → (⟨𝐴, 𝐵⟩uncurry 𝐹𝑤𝐵(𝐹𝐴)𝑤))
1413iotabidv 6537 . 2 ((𝐴𝑉𝐵𝑊) → (℩𝑤𝐴, 𝐵⟩uncurry 𝐹𝑤) = (℩𝑤𝐵(𝐹𝐴)𝑤))
15 df-ov 7429 . . 3 (𝐴uncurry 𝐹𝐵) = (uncurry 𝐹‘⟨𝐴, 𝐵⟩)
16 df-fv 6561 . . 3 (uncurry 𝐹‘⟨𝐴, 𝐵⟩) = (℩𝑤𝐴, 𝐵⟩uncurry 𝐹𝑤)
1715, 16eqtri 2756 . 2 (𝐴uncurry 𝐹𝐵) = (℩𝑤𝐴, 𝐵⟩uncurry 𝐹𝑤)
18 df-fv 6561 . 2 ((𝐹𝐴)‘𝐵) = (℩𝑤𝐵(𝐹𝐴)𝑤)
1914, 17, 183eqtr4g 2793 1 ((𝐴𝑉𝐵𝑊) → (𝐴uncurry 𝐹𝐵) = ((𝐹𝐴)‘𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 394  w3a 1084   = wceq 1533  wcel 2098  Vcvv 3473  cop 4638   class class class wbr 5152  cio 6503  cfv 6553  (class class class)co 7426  {coprab 7427  uncurry cunc 8278
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-12 2166  ax-ext 2699  ax-sep 5303  ax-nul 5310  ax-pr 5433
This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-sb 2060  df-clab 2706  df-cleq 2720  df-clel 2806  df-rab 3431  df-v 3475  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-nul 4327  df-if 4533  df-sn 4633  df-pr 4635  df-op 4639  df-uni 4913  df-br 5153  df-iota 6505  df-fv 6561  df-ov 7429  df-oprab 7430  df-unc 8280
This theorem is referenced by:  curunc  37108  matunitlindflem2  37123
  Copyright terms: Public domain W3C validator