MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  mptcnv Structured version   Visualization version   GIF version

Theorem mptcnv 6144
Description: The converse of a mapping function. (Contributed by Thierry Arnoux, 16-Jan-2017.)
Hypothesis
Ref Expression
mptcnv.1 (𝜑 → ((𝑥𝐴𝑦 = 𝐵) ↔ (𝑦𝐶𝑥 = 𝐷)))
Assertion
Ref Expression
mptcnv (𝜑(𝑥𝐴𝐵) = (𝑦𝐶𝐷))
Distinct variable groups:   𝑥,𝑦,𝜑   𝑥,𝐶   𝑥,𝐷   𝑦,𝐴   𝑦,𝐵
Allowed substitution hints:   𝐴(𝑥)   𝐵(𝑥)   𝐶(𝑦)   𝐷(𝑦)

Proof of Theorem mptcnv
StepHypRef Expression
1 mptcnv.1 . . 3 (𝜑 → ((𝑥𝐴𝑦 = 𝐵) ↔ (𝑦𝐶𝑥 = 𝐷)))
21opabbidv 5214 . 2 (𝜑 → {⟨𝑦, 𝑥⟩ ∣ (𝑥𝐴𝑦 = 𝐵)} = {⟨𝑦, 𝑥⟩ ∣ (𝑦𝐶𝑥 = 𝐷)})
3 df-mpt 5232 . . . 4 (𝑥𝐴𝐵) = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 = 𝐵)}
43cnveqi 5877 . . 3 (𝑥𝐴𝐵) = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 = 𝐵)}
5 cnvopab 6143 . . 3 {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 = 𝐵)} = {⟨𝑦, 𝑥⟩ ∣ (𝑥𝐴𝑦 = 𝐵)}
64, 5eqtri 2756 . 2 (𝑥𝐴𝐵) = {⟨𝑦, 𝑥⟩ ∣ (𝑥𝐴𝑦 = 𝐵)}
7 df-mpt 5232 . 2 (𝑦𝐶𝐷) = {⟨𝑦, 𝑥⟩ ∣ (𝑦𝐶𝑥 = 𝐷)}
82, 6, 73eqtr4g 2793 1 (𝜑(𝑥𝐴𝐵) = (𝑦𝐶𝐷))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 395   = wceq 1534  wcel 2099  {copab 5210  cmpt 5231  ccnv 5677
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2101  ax-9 2109  ax-10 2130  ax-11 2147  ax-12 2167  ax-ext 2699  ax-sep 5299  ax-nul 5306  ax-pr 5429
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 847  df-3an 1087  df-tru 1537  df-fal 1547  df-ex 1775  df-nf 1779  df-sb 2061  df-clab 2706  df-cleq 2720  df-clel 2806  df-rab 3430  df-v 3473  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-nul 4324  df-if 4530  df-sn 4630  df-pr 4632  df-op 4636  df-br 5149  df-opab 5211  df-mpt 5232  df-xp 5684  df-rel 5685  df-cnv 5686
This theorem is referenced by:  nvocnv  7290  mptcnfimad  7990  mptfzshft  15757  pt1hmeo  23723  ballotlemrinv  34153  dssmapnvod  43450
  Copyright terms: Public domain W3C validator