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

Theorem oprabbii 6133
Description: Equivalent wff's yield equal operation class abstractions. (Contributed by NM, 28-May-1995.) (Revised by David Abernethy, 19-Jun-2012.)
Hypothesis
Ref Expression
oprabbii.1 (𝜑𝜓)
Assertion
Ref Expression
oprabbii {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜓}
Distinct variable groups:   𝑥,𝑧   𝑦,𝑧
Allowed substitution hints:   𝜑(𝑥,𝑦,𝑧)   𝜓(𝑥,𝑦,𝑧)

Proof of Theorem oprabbii
Dummy variable 𝑤 is distinct from all other variables.
StepHypRef Expression
1 eqid 2238 . 2 𝑤 = 𝑤
2 oprabbii.1 . . . 4 (𝜑𝜓)
32a1i 9 . . 3 (𝑤 = 𝑤 → (𝜑𝜓))
43oprabbidv 6132 . 2 (𝑤 = 𝑤 → {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜓})
51, 4ax-mp 5 1 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜓}
Colors of variables: wff set class
Syntax hints:  wb 105   = wceq 1402  {coprab 6076
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-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-11 1559  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220
This theorem depends on definitions:  df-bi 117  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-oprab 6079
This theorem is referenced by:  oprab4  6149  mpov  6168  dfxp3  6420  tposmpo  6542  oviec  6905  dfplpq2  7711  dfmpq2  7712  dfmq0qs  7786  dfplq0qs  7787  addsrpr  8102  mulsrpr  8103  addcnsr  8191  mulcnsr  8192  addvalex  8201
  Copyright terms: Public domain W3C validator