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

Theorem dfoprab3s 6334
Description: A way to define an operation class abstraction without using existential quantifiers. (Contributed by NM, 18-Aug-2006.) (Revised by Mario Carneiro, 31-Aug-2015.)
Assertion
Ref Expression
dfoprab3s {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} = {⟨𝑤, 𝑧⟩ ∣ (𝑤 ∈ (V × V) ∧ [(1st𝑤) / 𝑥][(2nd𝑤) / 𝑦]𝜑)}
Distinct variable groups:   𝜑,𝑤   𝑥,𝑦,𝑧,𝑤
Allowed substitution hints:   𝜑(𝑥,𝑦,𝑧)

Proof of Theorem dfoprab3s
StepHypRef Expression
1 dfoprab2 6050 . 2 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} = {⟨𝑤, 𝑧⟩ ∣ ∃𝑥𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)}
2 nfsbc1v 3047 . . . . 5 𝑥[(1st𝑤) / 𝑥][(2nd𝑤) / 𝑦]𝜑
3219.41 1732 . . . 4 (∃𝑥(∃𝑦 𝑤 = ⟨𝑥, 𝑦⟩ ∧ [(1st𝑤) / 𝑥][(2nd𝑤) / 𝑦]𝜑) ↔ (∃𝑥𝑦 𝑤 = ⟨𝑥, 𝑦⟩ ∧ [(1st𝑤) / 𝑥][(2nd𝑤) / 𝑦]𝜑))
4 sbcopeq1a 6331 . . . . . . . 8 (𝑤 = ⟨𝑥, 𝑦⟩ → ([(1st𝑤) / 𝑥][(2nd𝑤) / 𝑦]𝜑𝜑))
54pm5.32i 454 . . . . . . 7 ((𝑤 = ⟨𝑥, 𝑦⟩ ∧ [(1st𝑤) / 𝑥][(2nd𝑤) / 𝑦]𝜑) ↔ (𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑))
65exbii 1651 . . . . . 6 (∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ [(1st𝑤) / 𝑥][(2nd𝑤) / 𝑦]𝜑) ↔ ∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑))
7 nfcv 2372 . . . . . . . 8 𝑦(1st𝑤)
8 nfsbc1v 3047 . . . . . . . 8 𝑦[(2nd𝑤) / 𝑦]𝜑
97, 8nfsbc 3049 . . . . . . 7 𝑦[(1st𝑤) / 𝑥][(2nd𝑤) / 𝑦]𝜑
10919.41 1732 . . . . . 6 (∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ [(1st𝑤) / 𝑥][(2nd𝑤) / 𝑦]𝜑) ↔ (∃𝑦 𝑤 = ⟨𝑥, 𝑦⟩ ∧ [(1st𝑤) / 𝑥][(2nd𝑤) / 𝑦]𝜑))
116, 10bitr3i 186 . . . . 5 (∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ (∃𝑦 𝑤 = ⟨𝑥, 𝑦⟩ ∧ [(1st𝑤) / 𝑥][(2nd𝑤) / 𝑦]𝜑))
1211exbii 1651 . . . 4 (∃𝑥𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ ∃𝑥(∃𝑦 𝑤 = ⟨𝑥, 𝑦⟩ ∧ [(1st𝑤) / 𝑥][(2nd𝑤) / 𝑦]𝜑))
13 elvv 4780 . . . . 5 (𝑤 ∈ (V × V) ↔ ∃𝑥𝑦 𝑤 = ⟨𝑥, 𝑦⟩)
1413anbi1i 458 . . . 4 ((𝑤 ∈ (V × V) ∧ [(1st𝑤) / 𝑥][(2nd𝑤) / 𝑦]𝜑) ↔ (∃𝑥𝑦 𝑤 = ⟨𝑥, 𝑦⟩ ∧ [(1st𝑤) / 𝑥][(2nd𝑤) / 𝑦]𝜑))
153, 12, 143bitr4i 212 . . 3 (∃𝑥𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ (𝑤 ∈ (V × V) ∧ [(1st𝑤) / 𝑥][(2nd𝑤) / 𝑦]𝜑))
1615opabbii 4150 . 2 {⟨𝑤, 𝑧⟩ ∣ ∃𝑥𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)} = {⟨𝑤, 𝑧⟩ ∣ (𝑤 ∈ (V × V) ∧ [(1st𝑤) / 𝑥][(2nd𝑤) / 𝑦]𝜑)}
171, 16eqtri 2250 1 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} = {⟨𝑤, 𝑧⟩ ∣ (𝑤 ∈ (V × V) ∧ [(1st𝑤) / 𝑥][(2nd𝑤) / 𝑦]𝜑)}
Colors of variables: wff set class
Syntax hints:  wa 104   = wceq 1395  wex 1538  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-fv 5325  df-oprab 6004  df-1st 6284  df-2nd 6285
This theorem is referenced by:  dfoprab3  6335
  Copyright terms: Public domain W3C validator