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

Theorem dfoprab3 6276
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 6275 . 2 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜓} = {⟨𝑤, 𝑧⟩ ∣ (𝑤 ∈ (V × V) ∧ [(1st𝑤) / 𝑥][(2nd𝑤) / 𝑦]𝜓)}
2 vex 2774 . . . . . 6 𝑤 ∈ V
3 1stexg 6252 . . . . . 6 (𝑤 ∈ V → (1st𝑤) ∈ V)
42, 3ax-mp 5 . . . . 5 (1st𝑤) ∈ V
5 2ndexg 6253 . . . . . 6 (𝑤 ∈ V → (2nd𝑤) ∈ V)
62, 5ax-mp 5 . . . . 5 (2nd𝑤) ∈ V
7 eqcom 2206 . . . . . . . . . 10 (𝑥 = (1st𝑤) ↔ (1st𝑤) = 𝑥)
8 eqcom 2206 . . . . . . . . . 10 (𝑦 = (2nd𝑤) ↔ (2nd𝑤) = 𝑦)
97, 8anbi12i 460 . . . . . . . . 9 ((𝑥 = (1st𝑤) ∧ 𝑦 = (2nd𝑤)) ↔ ((1st𝑤) = 𝑥 ∧ (2nd𝑤) = 𝑦))
10 eqopi 6257 . . . . . . . . 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 3070 . . . 4 (𝑤 ∈ (V × V) → ([(1st𝑤) / 𝑥][(2nd𝑤) / 𝑦]𝜓𝜑))
1716pm5.32i 454 . . 3 ((𝑤 ∈ (V × V) ∧ [(1st𝑤) / 𝑥][(2nd𝑤) / 𝑦]𝜓) ↔ (𝑤 ∈ (V × V) ∧ 𝜑))
1817opabbii 4110 . 2 {⟨𝑤, 𝑧⟩ ∣ (𝑤 ∈ (V × V) ∧ [(1st𝑤) / 𝑥][(2nd𝑤) / 𝑦]𝜓)} = {⟨𝑤, 𝑧⟩ ∣ (𝑤 ∈ (V × V) ∧ 𝜑)}
191, 18eqtr2i 2226 1 {⟨𝑤, 𝑧⟩ ∣ (𝑤 ∈ (V × V) ∧ 𝜑)} = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜓}
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105   = wceq 1372  wcel 2175  Vcvv 2771  [wsbc 2997  cop 3635  {copab 4103   × cxp 4672  cfv 5270  {coprab 5944  1st c1st 6223  2nd c2nd 6224
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 710  ax-5 1469  ax-7 1470  ax-gen 1471  ax-ie1 1515  ax-ie2 1516  ax-8 1526  ax-10 1527  ax-11 1528  ax-i12 1529  ax-bndl 1531  ax-4 1532  ax-17 1548  ax-i9 1552  ax-ial 1556  ax-i5r 1557  ax-13 2177  ax-14 2178  ax-ext 2186  ax-sep 4161  ax-pow 4217  ax-pr 4252  ax-un 4479
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1375  df-nf 1483  df-sb 1785  df-eu 2056  df-mo 2057  df-clab 2191  df-cleq 2197  df-clel 2200  df-nfc 2336  df-ral 2488  df-rex 2489  df-v 2773  df-sbc 2998  df-un 3169  df-in 3171  df-ss 3178  df-pw 3617  df-sn 3638  df-pr 3639  df-op 3641  df-uni 3850  df-br 4044  df-opab 4105  df-mpt 4106  df-id 4339  df-xp 4680  df-rel 4681  df-cnv 4682  df-co 4683  df-dm 4684  df-rn 4685  df-iota 5231  df-fun 5272  df-fn 5273  df-f 5274  df-fo 5276  df-fv 5278  df-oprab 5947  df-1st 6225  df-2nd 6226
This theorem is referenced by:  dfoprab4  6277  df1st2  6304  df2nd2  6305
  Copyright terms: Public domain W3C validator