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

Theorem cnvoprab 8016
Description: The converse of a class abstraction of nested ordered pairs. (Contributed by Thierry Arnoux, 17-Aug-2017.) (Proof shortened by Thierry Arnoux, 20-Feb-2022.)
Hypotheses
Ref Expression
cnvoprab.1 (𝑎 = ⟨𝑥, 𝑦⟩ → (𝜓𝜑))
cnvoprab.2 (𝜓𝑎 ∈ (V × V))
Assertion
Ref Expression
cnvoprab {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} = {⟨𝑧, 𝑎⟩ ∣ 𝜓}
Distinct variable groups:   𝑥,𝑎,𝑦,𝑧   𝜑,𝑎   𝜓,𝑥,𝑦
Allowed substitution hints:   𝜑(𝑥,𝑦,𝑧)   𝜓(𝑧,𝑎)

Proof of Theorem cnvoprab
StepHypRef Expression
1 cnvoprab.1 . . . 4 (𝑎 = ⟨𝑥, 𝑦⟩ → (𝜓𝜑))
21dfoprab3 8010 . . 3 {⟨𝑎, 𝑧⟩ ∣ (𝑎 ∈ (V × V) ∧ 𝜓)} = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑}
32cnveqi 5833 . 2 {⟨𝑎, 𝑧⟩ ∣ (𝑎 ∈ (V × V) ∧ 𝜓)} = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑}
4 cnvopab 6104 . . 3 {⟨𝑎, 𝑧⟩ ∣ (𝑎 ∈ (V × V) ∧ 𝜓)} = {⟨𝑧, 𝑎⟩ ∣ (𝑎 ∈ (V × V) ∧ 𝜓)}
5 inopab 5788 . . 3 ({⟨𝑧, 𝑎⟩ ∣ 𝑎 ∈ (V × V)} ∩ {⟨𝑧, 𝑎⟩ ∣ 𝜓}) = {⟨𝑧, 𝑎⟩ ∣ (𝑎 ∈ (V × V) ∧ 𝜓)}
6 cnvoprab.2 . . . . 5 (𝜓𝑎 ∈ (V × V))
76ssopab2i 5508 . . . 4 {⟨𝑧, 𝑎⟩ ∣ 𝜓} ⊆ {⟨𝑧, 𝑎⟩ ∣ 𝑎 ∈ (V × V)}
8 sseqin2 4177 . . . 4 ({⟨𝑧, 𝑎⟩ ∣ 𝜓} ⊆ {⟨𝑧, 𝑎⟩ ∣ 𝑎 ∈ (V × V)} ↔ ({⟨𝑧, 𝑎⟩ ∣ 𝑎 ∈ (V × V)} ∩ {⟨𝑧, 𝑎⟩ ∣ 𝜓}) = {⟨𝑧, 𝑎⟩ ∣ 𝜓})
97, 8mpbi 230 . . 3 ({⟨𝑧, 𝑎⟩ ∣ 𝑎 ∈ (V × V)} ∩ {⟨𝑧, 𝑎⟩ ∣ 𝜓}) = {⟨𝑧, 𝑎⟩ ∣ 𝜓}
104, 5, 93eqtr2i 2766 . 2 {⟨𝑎, 𝑧⟩ ∣ (𝑎 ∈ (V × V) ∧ 𝜓)} = {⟨𝑧, 𝑎⟩ ∣ 𝜓}
113, 10eqtr3i 2762 1 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} = {⟨𝑧, 𝑎⟩ ∣ 𝜓}
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1542  wcel 2114  Vcvv 3442  cin 3902  wss 3903  cop 4588  {copab 5162   × cxp 5632  ccnv 5633  {coprab 7371
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5245  ax-nul 5255  ax-pr 5381  ax-un 7692
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-sbc 3743  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5529  df-xp 5640  df-rel 5641  df-cnv 5642  df-co 5643  df-dm 5644  df-rn 5645  df-iota 6458  df-fun 6504  df-fv 6510  df-oprab 7374  df-1st 7945  df-2nd 7946
This theorem is referenced by:  f1od2  32815  dfxrn2  38665
  Copyright terms: Public domain W3C validator