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

Theorem dfoprab3s 7208
 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 6686 . 2 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} = {⟨𝑤, 𝑧⟩ ∣ ∃𝑥𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)}
2 nfsbc1v 3449 . . . . 5 𝑥[(1st𝑤) / 𝑥][(2nd𝑤) / 𝑦]𝜑
3219.41 2101 . . . 4 (∃𝑥(∃𝑦 𝑤 = ⟨𝑥, 𝑦⟩ ∧ [(1st𝑤) / 𝑥][(2nd𝑤) / 𝑦]𝜑) ↔ (∃𝑥𝑦 𝑤 = ⟨𝑥, 𝑦⟩ ∧ [(1st𝑤) / 𝑥][(2nd𝑤) / 𝑦]𝜑))
4 sbcopeq1a 7205 . . . . . . . 8 (𝑤 = ⟨𝑥, 𝑦⟩ → ([(1st𝑤) / 𝑥][(2nd𝑤) / 𝑦]𝜑𝜑))
54pm5.32i 668 . . . . . . 7 ((𝑤 = ⟨𝑥, 𝑦⟩ ∧ [(1st𝑤) / 𝑥][(2nd𝑤) / 𝑦]𝜑) ↔ (𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑))
65exbii 1772 . . . . . 6 (∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ [(1st𝑤) / 𝑥][(2nd𝑤) / 𝑦]𝜑) ↔ ∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑))
7 nfcv 2762 . . . . . . . 8 𝑦(1st𝑤)
8 nfsbc1v 3449 . . . . . . . 8 𝑦[(2nd𝑤) / 𝑦]𝜑
97, 8nfsbc 3451 . . . . . . 7 𝑦[(1st𝑤) / 𝑥][(2nd𝑤) / 𝑦]𝜑
10919.41 2101 . . . . . 6 (∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ [(1st𝑤) / 𝑥][(2nd𝑤) / 𝑦]𝜑) ↔ (∃𝑦 𝑤 = ⟨𝑥, 𝑦⟩ ∧ [(1st𝑤) / 𝑥][(2nd𝑤) / 𝑦]𝜑))
116, 10bitr3i 266 . . . . 5 (∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ (∃𝑦 𝑤 = ⟨𝑥, 𝑦⟩ ∧ [(1st𝑤) / 𝑥][(2nd𝑤) / 𝑦]𝜑))
1211exbii 1772 . . . 4 (∃𝑥𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ ∃𝑥(∃𝑦 𝑤 = ⟨𝑥, 𝑦⟩ ∧ [(1st𝑤) / 𝑥][(2nd𝑤) / 𝑦]𝜑))
13 elvv 5167 . . . . 5 (𝑤 ∈ (V × V) ↔ ∃𝑥𝑦 𝑤 = ⟨𝑥, 𝑦⟩)
1413anbi1i 730 . . . 4 ((𝑤 ∈ (V × V) ∧ [(1st𝑤) / 𝑥][(2nd𝑤) / 𝑦]𝜑) ↔ (∃𝑥𝑦 𝑤 = ⟨𝑥, 𝑦⟩ ∧ [(1st𝑤) / 𝑥][(2nd𝑤) / 𝑦]𝜑))
153, 12, 143bitr4i 292 . . 3 (∃𝑥𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ (𝑤 ∈ (V × V) ∧ [(1st𝑤) / 𝑥][(2nd𝑤) / 𝑦]𝜑))
1615opabbii 4708 . 2 {⟨𝑤, 𝑧⟩ ∣ ∃𝑥𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)} = {⟨𝑤, 𝑧⟩ ∣ (𝑤 ∈ (V × V) ∧ [(1st𝑤) / 𝑥][(2nd𝑤) / 𝑦]𝜑)}
171, 16eqtri 2642 1 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} = {⟨𝑤, 𝑧⟩ ∣ (𝑤 ∈ (V × V) ∧ [(1st𝑤) / 𝑥][(2nd𝑤) / 𝑦]𝜑)}
 Colors of variables: wff setvar class Syntax hints:   ∧ wa 384   = wceq 1481  ∃wex 1702   ∈ wcel 1988  Vcvv 3195  [wsbc 3429  ⟨cop 4174  {copab 4703   × cxp 5102  ‘cfv 5876  {coprab 6636  1st c1st 7151  2nd c2nd 7152 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1720  ax-4 1735  ax-5 1837  ax-6 1886  ax-7 1933  ax-8 1990  ax-9 1997  ax-10 2017  ax-11 2032  ax-12 2045  ax-13 2244  ax-ext 2600  ax-sep 4772  ax-nul 4780  ax-pow 4834  ax-pr 4897  ax-un 6934 This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1038  df-tru 1484  df-ex 1703  df-nf 1708  df-sb 1879  df-eu 2472  df-mo 2473  df-clab 2607  df-cleq 2613  df-clel 2616  df-nfc 2751  df-ral 2914  df-rex 2915  df-rab 2918  df-v 3197  df-sbc 3430  df-dif 3570  df-un 3572  df-in 3574  df-ss 3581  df-nul 3908  df-if 4078  df-sn 4169  df-pr 4171  df-op 4175  df-uni 4428  df-br 4645  df-opab 4704  df-mpt 4721  df-id 5014  df-xp 5110  df-rel 5111  df-cnv 5112  df-co 5113  df-dm 5114  df-rn 5115  df-iota 5839  df-fun 5878  df-fv 5884  df-oprab 6639  df-1st 7153  df-2nd 7154 This theorem is referenced by:  dfoprab3  7209
 Copyright terms: Public domain W3C validator