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

Theorem oprabbii 5819
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 2137 . 2 𝑤 = 𝑤
2 oprabbii.1 . . . 4 (𝜑𝜓)
32a1i 9 . . 3 (𝑤 = 𝑤 → (𝜑𝜓))
43oprabbidv 5818 . 2 (𝑤 = 𝑤 → {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜓})
51, 4ax-mp 5 1 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜓}
Colors of variables: wff set class
Syntax hints:  wb 104   = wceq 1331  {coprab 5768
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-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-11 1484  ax-4 1487  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119
This theorem depends on definitions:  df-bi 116  df-tru 1334  df-nf 1437  df-sb 1736  df-clab 2124  df-cleq 2130  df-oprab 5771
This theorem is referenced by:  oprab4  5835  mpov  5854  dfxp3  6085  tposmpo  6171  oviec  6528  dfplpq2  7155  dfmpq2  7156  dfmq0qs  7230  dfplq0qs  7231  addsrpr  7546  mulsrpr  7547  addcnsr  7635  mulcnsr  7636  addvalex  7645
  Copyright terms: Public domain W3C validator