ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  dfoprab3 GIF version

Theorem dfoprab3 6335
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 6334 . 2 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜓} = {⟨𝑤, 𝑧⟩ ∣ (𝑤 ∈ (V × V) ∧ [(1st𝑤) / 𝑥][(2nd𝑤) / 𝑦]𝜓)}
2 vex 2802 . . . . . 6 𝑤 ∈ V
3 1stexg 6311 . . . . . 6 (𝑤 ∈ V → (1st𝑤) ∈ V)
42, 3ax-mp 5 . . . . 5 (1st𝑤) ∈ V
5 2ndexg 6312 . . . . . 6 (𝑤 ∈ V → (2nd𝑤) ∈ V)
62, 5ax-mp 5 . . . . 5 (2nd𝑤) ∈ V
7 eqcom 2231 . . . . . . . . . 10 (𝑥 = (1st𝑤) ↔ (1st𝑤) = 𝑥)
8 eqcom 2231 . . . . . . . . . 10 (𝑦 = (2nd𝑤) ↔ (2nd𝑤) = 𝑦)
97, 8anbi12i 460 . . . . . . . . 9 ((𝑥 = (1st𝑤) ∧ 𝑦 = (2nd𝑤)) ↔ ((1st𝑤) = 𝑥 ∧ (2nd𝑤) = 𝑦))
10 eqopi 6316 . . . . . . . . 9 ((𝑤 ∈ (V × V) ∧ ((1st𝑤) = 𝑥 ∧ (2nd𝑤) = 𝑦)) → 𝑤 = ⟨𝑥, 𝑦⟩)
119, 10sylan2b 287 . . . . . . . 8 ((𝑤 ∈ (V × V) ∧ (𝑥 = (1st𝑤) ∧ 𝑦 = (2nd𝑤))) → 𝑤 = ⟨𝑥, 𝑦⟩)
12 dfoprab3.1 . . . . . . . 8 (𝑤 = ⟨𝑥, 𝑦⟩ → (𝜑𝜓))
1311, 12syl 14 . . . . . . 7 ((𝑤 ∈ (V × V) ∧ (𝑥 = (1st𝑤) ∧ 𝑦 = (2nd𝑤))) → (𝜑𝜓))
1413bicomd 141 . . . . . 6 ((𝑤 ∈ (V × V) ∧ (𝑥 = (1st𝑤) ∧ 𝑦 = (2nd𝑤))) → (𝜓𝜑))
1514ex 115 . . . . 5 (𝑤 ∈ (V × V) → ((𝑥 = (1st𝑤) ∧ 𝑦 = (2nd𝑤)) → (𝜓𝜑)))
164, 6, 15sbc2iedv 3101 . . . 4 (𝑤 ∈ (V × V) → ([(1st𝑤) / 𝑥][(2nd𝑤) / 𝑦]𝜓𝜑))
1716pm5.32i 454 . . 3 ((𝑤 ∈ (V × V) ∧ [(1st𝑤) / 𝑥][(2nd𝑤) / 𝑦]𝜓) ↔ (𝑤 ∈ (V × V) ∧ 𝜑))
1817opabbii 4150 . 2 {⟨𝑤, 𝑧⟩ ∣ (𝑤 ∈ (V × V) ∧ [(1st𝑤) / 𝑥][(2nd𝑤) / 𝑦]𝜓)} = {⟨𝑤, 𝑧⟩ ∣ (𝑤 ∈ (V × V) ∧ 𝜑)}
191, 18eqtr2i 2251 1 {⟨𝑤, 𝑧⟩ ∣ (𝑤 ∈ (V × V) ∧ 𝜑)} = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜓}
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105   = wceq 1395  wcel 2200  Vcvv 2799  [wsbc 3028  cop 3669  {copab 4143   × cxp 4716  cfv 5317  {coprab 6001  1st c1st 6282  2nd c2nd 6283
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4201  ax-pow 4257  ax-pr 4292  ax-un 4523
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-v 2801  df-sbc 3029  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3888  df-br 4083  df-opab 4145  df-mpt 4146  df-id 4383  df-xp 4724  df-rel 4725  df-cnv 4726  df-co 4727  df-dm 4728  df-rn 4729  df-iota 5277  df-fun 5319  df-fn 5320  df-f 5321  df-fo 5323  df-fv 5325  df-oprab 6004  df-1st 6284  df-2nd 6285
This theorem is referenced by:  dfoprab4  6336  df1st2  6363  df2nd2  6364
  Copyright terms: Public domain W3C validator