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

Theorem cnvoprab 8060
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 8054 . . 3 {⟨𝑎, 𝑧⟩ ∣ (𝑎 ∈ (V × V) ∧ 𝜓)} = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑}
32cnveqi 5864 . 2 {⟨𝑎, 𝑧⟩ ∣ (𝑎 ∈ (V × V) ∧ 𝜓)} = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑}
4 cnvopab 6141 . . 3 {⟨𝑎, 𝑧⟩ ∣ (𝑎 ∈ (V × V) ∧ 𝜓)} = {⟨𝑧, 𝑎⟩ ∣ (𝑎 ∈ (V × V) ∧ 𝜓)}
5 inopab 5820 . . 3 ({⟨𝑧, 𝑎⟩ ∣ 𝑎 ∈ (V × V)} ∩ {⟨𝑧, 𝑎⟩ ∣ 𝜓}) = {⟨𝑧, 𝑎⟩ ∣ (𝑎 ∈ (V × V) ∧ 𝜓)}
6 cnvoprab.2 . . . . 5 (𝜓𝑎 ∈ (V × V))
76ssopab2i 5539 . . . 4 {⟨𝑧, 𝑎⟩ ∣ 𝜓} ⊆ {⟨𝑧, 𝑎⟩ ∣ 𝑎 ∈ (V × V)}
8 sseqin2 4184 . . . 4 ({⟨𝑧, 𝑎⟩ ∣ 𝜓} ⊆ {⟨𝑧, 𝑎⟩ ∣ 𝑎 ∈ (V × V)} ↔ ({⟨𝑧, 𝑎⟩ ∣ 𝑎 ∈ (V × V)} ∩ {⟨𝑧, 𝑎⟩ ∣ 𝜓}) = {⟨𝑧, 𝑎⟩ ∣ 𝜓})
97, 8mpbi 233 . . 3 ({⟨𝑧, 𝑎⟩ ∣ 𝑎 ∈ (V × V)} ∩ {⟨𝑧, 𝑎⟩ ∣ 𝜓}) = {⟨𝑧, 𝑎⟩ ∣ 𝜓}
104, 5, 93eqtr2i 2799 . 2 {⟨𝑎, 𝑧⟩ ∣ (𝑎 ∈ (V × V) ∧ 𝜓)} = {⟨𝑧, 𝑎⟩ ∣ 𝜓}
113, 10eqtr3i 2795 1 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} = {⟨𝑧, 𝑎⟩ ∣ 𝜓}
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400   = wceq 1568  wcel 2150  Vcvv 3462  cin 3912  wss 3913  cop 4600  {copab 5178   × cxp 5663  ccnv 5664  {coprab 7415
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1823  ax-4 1837  ax-5 1938  ax-6 1995  ax-7 2036  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2199  ax-12 2220  ax-ext 2742  ax-sep 5262  ax-nul 5274  ax-pr 5408  ax-un 7736
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1571  df-fal 1581  df-ex 1808  df-nf 1812  df-sb 2099  df-mo 2574  df-eu 2604  df-clab 2749  df-cleq 2762  df-clel 2845  df-nfc 2919  df-ne 2966  df-ral 3087  df-rex 3097  df-rab 3424  df-v 3464  df-sbc 3753  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-br 5115  df-opab 5179  df-mpt 5198  df-id 5560  df-xp 5671  df-rel 5672  df-cnv 5673  df-co 5674  df-dm 5675  df-rn 5676  df-iota 6496  df-fun 6542  df-fv 6548  df-oprab 7418  df-1st 7989  df-2nd 7990
This theorem is referenced by:  f1od2  33034  dfxrn2  38984
  Copyright terms: Public domain W3C validator