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

Theorem dfoprab3 6170
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 6169 . 2 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜓} = {⟨𝑤, 𝑧⟩ ∣ (𝑤 ∈ (V × V) ∧ [(1st𝑤) / 𝑥][(2nd𝑤) / 𝑦]𝜓)}
2 vex 2733 . . . . . 6 𝑤 ∈ V
3 1stexg 6146 . . . . . 6 (𝑤 ∈ V → (1st𝑤) ∈ V)
42, 3ax-mp 5 . . . . 5 (1st𝑤) ∈ V
5 2ndexg 6147 . . . . . 6 (𝑤 ∈ V → (2nd𝑤) ∈ V)
62, 5ax-mp 5 . . . . 5 (2nd𝑤) ∈ V
7 eqcom 2172 . . . . . . . . . 10 (𝑥 = (1st𝑤) ↔ (1st𝑤) = 𝑥)
8 eqcom 2172 . . . . . . . . . 10 (𝑦 = (2nd𝑤) ↔ (2nd𝑤) = 𝑦)
97, 8anbi12i 457 . . . . . . . . 9 ((𝑥 = (1st𝑤) ∧ 𝑦 = (2nd𝑤)) ↔ ((1st𝑤) = 𝑥 ∧ (2nd𝑤) = 𝑦))
10 eqopi 6151 . . . . . . . . 9 ((𝑤 ∈ (V × V) ∧ ((1st𝑤) = 𝑥 ∧ (2nd𝑤) = 𝑦)) → 𝑤 = ⟨𝑥, 𝑦⟩)
119, 10sylan2b 285 . . . . . . . 8 ((𝑤 ∈ (V × V) ∧ (𝑥 = (1st𝑤) ∧ 𝑦 = (2nd𝑤))) → 𝑤 = ⟨𝑥, 𝑦⟩)
12 dfoprab3.1 . . . . . . . 8 (𝑤 = ⟨𝑥, 𝑦⟩ → (𝜑𝜓))
1311, 12syl 14 . . . . . . 7 ((𝑤 ∈ (V × V) ∧ (𝑥 = (1st𝑤) ∧ 𝑦 = (2nd𝑤))) → (𝜑𝜓))
1413bicomd 140 . . . . . 6 ((𝑤 ∈ (V × V) ∧ (𝑥 = (1st𝑤) ∧ 𝑦 = (2nd𝑤))) → (𝜓𝜑))
1514ex 114 . . . . 5 (𝑤 ∈ (V × V) → ((𝑥 = (1st𝑤) ∧ 𝑦 = (2nd𝑤)) → (𝜓𝜑)))
164, 6, 15sbc2iedv 3027 . . . 4 (𝑤 ∈ (V × V) → ([(1st𝑤) / 𝑥][(2nd𝑤) / 𝑦]𝜓𝜑))
1716pm5.32i 451 . . 3 ((𝑤 ∈ (V × V) ∧ [(1st𝑤) / 𝑥][(2nd𝑤) / 𝑦]𝜓) ↔ (𝑤 ∈ (V × V) ∧ 𝜑))
1817opabbii 4056 . 2 {⟨𝑤, 𝑧⟩ ∣ (𝑤 ∈ (V × V) ∧ [(1st𝑤) / 𝑥][(2nd𝑤) / 𝑦]𝜓)} = {⟨𝑤, 𝑧⟩ ∣ (𝑤 ∈ (V × V) ∧ 𝜑)}
191, 18eqtr2i 2192 1 {⟨𝑤, 𝑧⟩ ∣ (𝑤 ∈ (V × V) ∧ 𝜑)} = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜓}
Colors of variables: wff set class
Syntax hints:  wi 4  wa 103  wb 104   = wceq 1348  wcel 2141  Vcvv 2730  [wsbc 2955  cop 3586  {copab 4049   × cxp 4609  cfv 5198  {coprab 5854  1st c1st 6117  2nd c2nd 6118
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-13 2143  ax-14 2144  ax-ext 2152  ax-sep 4107  ax-pow 4160  ax-pr 4194  ax-un 4418
This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ral 2453  df-rex 2454  df-v 2732  df-sbc 2956  df-un 3125  df-in 3127  df-ss 3134  df-pw 3568  df-sn 3589  df-pr 3590  df-op 3592  df-uni 3797  df-br 3990  df-opab 4051  df-mpt 4052  df-id 4278  df-xp 4617  df-rel 4618  df-cnv 4619  df-co 4620  df-dm 4621  df-rn 4622  df-iota 5160  df-fun 5200  df-fn 5201  df-f 5202  df-fo 5204  df-fv 5206  df-oprab 5857  df-1st 6119  df-2nd 6120
This theorem is referenced by:  dfoprab4  6171  df1st2  6198  df2nd2  6199
  Copyright terms: Public domain W3C validator