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

Theorem dfoprab3 8100
Description: Operation class abstraction expressed without existential quantifiers. (Contributed by NM, 16-Dec-2008.)
Hypothesis
Ref Expression
dfoprab3.1 (𝑤 = ⟨𝑥, 𝑦⟩ → (𝜑 ↔ 𝜓))
Assertion
Ref Expression
dfoprab3 {⟨𝑤, 𝑧⟩ ∣ (𝑤 ∈ (V × V) ∧ 𝜑)} = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜓}
Distinct variable groups:   𝑥,𝑦,𝜑   𝜓,𝑤   𝑥,𝑧,𝑤,𝑦
Allowed substitution hints:   𝜑(𝑧, 𝑤)   𝜓(𝑥, 𝑦, 𝑧)

Proof of Theorem dfoprab3
StepHypRef Expression
1 dfoprab3s 8099 . 2 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜓} = {⟨𝑤, 𝑧⟩ ∣ (𝑤 ∈ (V × V) ∧ [(1st ‘𝑤) / 𝑥][(2nd ‘𝑤) / 𝑦]𝜓)}
2 fvex 6929 . . . . 5 (1st ‘𝑤) ∈ V
3 fvex 6929 . . . . 5 (2nd ‘𝑤) ∈ V
4 eqcom 2770 . . . . . . . . . 10 (𝑥 = (1st ‘𝑤) ↔ (1st ‘𝑤) = 𝑥)
5 eqcom 2770 . . . . . . . . . 10 (𝑦 = (2nd ‘𝑤) ↔ (2nd ‘𝑤) = 𝑦)
64, 5anbi12i 640 . . . . . . . . 9 ((𝑥 = (1st ‘𝑤) ∧ 𝑦 = (2nd ‘𝑤)) ↔ ((1st ‘𝑤) = 𝑥 ∧ (2nd ‘𝑤) = 𝑦))
7 eqopi 8071 . . . . . . . . 9 ((𝑤 ∈ (V × V) ∧ ((1st ‘𝑤) = 𝑥 ∧ (2nd ‘𝑤) = 𝑦)) → 𝑤 = ⟨𝑥, 𝑦⟩)
86, 7sylan2b 606 . . . . . . . 8 ((𝑤 ∈ (V × V) ∧ (𝑥 = (1st ‘𝑤) ∧ 𝑦 = (2nd ‘𝑤))) → 𝑤 = ⟨𝑥, 𝑦⟩)
9 dfoprab3.1 . . . . . . . 8 (𝑤 = ⟨𝑥, 𝑦⟩ → (𝜑 ↔ 𝜓))
108, 9syl 18 . . . . . . 7 ((𝑤 ∈ (V × V) ∧ (𝑥 = (1st ‘𝑤) ∧ 𝑦 = (2nd ‘𝑤))) → (𝜑 ↔ 𝜓))
1110bicomd 226 . . . . . 6 ((𝑤 ∈ (V × V) ∧ (𝑥 = (1st ‘𝑤) ∧ 𝑦 = (2nd ‘𝑤))) → (𝜓 ↔ 𝜑))
1211ex 418 . . . . 5 (𝑤 ∈ (V × V) → ((𝑥 = (1st ‘𝑤) ∧ 𝑦 = (2nd ‘𝑤)) → (𝜓 ↔ 𝜑)))
132, 3, 12sbc2iedv 3819 . . . 4 (𝑤 ∈ (V × V) → ([(1st ‘𝑤) / 𝑥][(2nd ‘𝑤) / 𝑦]𝜓 ↔ 𝜑))
1413pm5.32i 585 . . 3 ((𝑤 ∈ (V × V) ∧ [(1st ‘𝑤) / 𝑥][(2nd ‘𝑤) / 𝑦]𝜓) ↔ (𝑤 ∈ (V × V) ∧ 𝜑))
1514opabbii 5178 . 2 {⟨𝑤, 𝑧⟩ ∣ (𝑤 ∈ (V × V) ∧ [(1st ‘𝑤) / 𝑥][(2nd ‘𝑤) / 𝑦]𝜓)} = {⟨𝑤, 𝑧⟩ ∣ (𝑤 ∈ (V × V) ∧ 𝜑)}
161, 15eqtr2i 2787 1 {⟨𝑤, 𝑧⟩ ∣ (𝑤 ∈ (V × V) ∧ 𝜑)} = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜓}
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  Vcvv 3454  [wsbc 3742  ⟨cop 4840  {copab 5173   × cxp 5656  ‘cfv 6566  {coprab 7452  1st c1st 8033  2nd c2nd 8034
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pr 5398  ax-un 7783
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-iota 6520  df-fun 6568  df-fv 6574  df-oprab 7455  df-1st 8035  df-2nd 8036
This theorem is used by:  dfoprab4  8101  cnvoprab  8106  df1st2  8146  df2nd2  8147
  Copyright terms: Public domain W3C validator