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 33390
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 4654 . . . . 5 (⟨𝐴, 𝐵⟩uncurry 𝐹𝑤 ↔ ⟨⟨𝐴, 𝐵⟩, 𝑤⟩ ∈ uncurry 𝐹)
2 df-unc 7394 . . . . . 6 uncurry 𝐹 = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝑦(𝐹𝑥)𝑧}
32eleq2i 2693 . . . . 5 (⟨⟨𝐴, 𝐵⟩, 𝑤⟩ ∈ uncurry 𝐹 ↔ ⟨⟨𝐴, 𝐵⟩, 𝑤⟩ ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝑦(𝐹𝑥)𝑧})
41, 3bitri 264 . . . 4 (⟨𝐴, 𝐵⟩uncurry 𝐹𝑤 ↔ ⟨⟨𝐴, 𝐵⟩, 𝑤⟩ ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝑦(𝐹𝑥)𝑧})
5 vex 3203 . . . . 5 𝑤 ∈ V
6 simp2 1062 . . . . . . 7 ((𝑥 = 𝐴𝑦 = 𝐵𝑧 = 𝑤) → 𝑦 = 𝐵)
7 fveq2 6191 . . . . . . . 8 (𝑥 = 𝐴 → (𝐹𝑥) = (𝐹𝐴))
873ad2ant1 1082 . . . . . . 7 ((𝑥 = 𝐴𝑦 = 𝐵𝑧 = 𝑤) → (𝐹𝑥) = (𝐹𝐴))
9 simp3 1063 . . . . . . 7 ((𝑥 = 𝐴𝑦 = 𝐵𝑧 = 𝑤) → 𝑧 = 𝑤)
106, 8, 9breq123d 4667 . . . . . 6 ((𝑥 = 𝐴𝑦 = 𝐵𝑧 = 𝑤) → (𝑦(𝐹𝑥)𝑧𝐵(𝐹𝐴)𝑤))
1110eloprabga 6747 . . . . 5 ((𝐴𝑉𝐵𝑊𝑤 ∈ V) → (⟨⟨𝐴, 𝐵⟩, 𝑤⟩ ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝑦(𝐹𝑥)𝑧} ↔ 𝐵(𝐹𝐴)𝑤))
125, 11mp3an3 1413 . . . 4 ((𝐴𝑉𝐵𝑊) → (⟨⟨𝐴, 𝐵⟩, 𝑤⟩ ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝑦(𝐹𝑥)𝑧} ↔ 𝐵(𝐹𝐴)𝑤))
134, 12syl5bb 272 . . 3 ((𝐴𝑉𝐵𝑊) → (⟨𝐴, 𝐵⟩uncurry 𝐹𝑤𝐵(𝐹𝐴)𝑤))
1413iotabidv 5872 . 2 ((𝐴𝑉𝐵𝑊) → (℩𝑤𝐴, 𝐵⟩uncurry 𝐹𝑤) = (℩𝑤𝐵(𝐹𝐴)𝑤))
15 df-ov 6653 . . 3 (𝐴uncurry 𝐹𝐵) = (uncurry 𝐹‘⟨𝐴, 𝐵⟩)
16 df-fv 5896 . . 3 (uncurry 𝐹‘⟨𝐴, 𝐵⟩) = (℩𝑤𝐴, 𝐵⟩uncurry 𝐹𝑤)
1715, 16eqtri 2644 . 2 (𝐴uncurry 𝐹𝐵) = (℩𝑤𝐴, 𝐵⟩uncurry 𝐹𝑤)
18 df-fv 5896 . 2 ((𝐹𝐴)‘𝐵) = (℩𝑤𝐵(𝐹𝐴)𝑤)
1914, 17, 183eqtr4g 2681 1 ((𝐴𝑉𝐵𝑊) → (𝐴uncurry 𝐹𝐵) = ((𝐹𝐴)‘𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wa 384  w3a 1037   = wceq 1483  wcel 1990  Vcvv 3200  cop 4183   class class class wbr 4653  cio 5849  cfv 5888  (class class class)co 6650  {coprab 6651  uncurry cunc 7392
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pr 4906
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-rex 2918  df-rab 2921  df-v 3202  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-iota 5851  df-fv 5896  df-ov 6653  df-oprab 6654  df-unc 7394
This theorem is referenced by:  curunc  33391  matunitlindflem2  33406
  Copyright terms: Public domain W3C validator