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

Theorem cbvopabv 4000
Description: Rule used to change bound variables in an ordered-pair class abstraction, using implicit substitution. (Contributed by NM, 15-Oct-1996.)
Hypothesis
Ref Expression
cbvopabv.1 ((𝑥 = 𝑧𝑦 = 𝑤) → (𝜑𝜓))
Assertion
Ref Expression
cbvopabv {⟨𝑥, 𝑦⟩ ∣ 𝜑} = {⟨𝑧, 𝑤⟩ ∣ 𝜓}
Distinct variable groups:   𝑥,𝑦,𝑧,𝑤   𝜑,𝑧,𝑤   𝜓,𝑥,𝑦
Allowed substitution hints:   𝜑(𝑥,𝑦)   𝜓(𝑧,𝑤)

Proof of Theorem cbvopabv
StepHypRef Expression
1 nfv 1508 . 2 𝑧𝜑
2 nfv 1508 . 2 𝑤𝜑
3 nfv 1508 . 2 𝑥𝜓
4 nfv 1508 . 2 𝑦𝜓
5 cbvopabv.1 . 2 ((𝑥 = 𝑧𝑦 = 𝑤) → (𝜑𝜓))
61, 2, 3, 4, 5cbvopab 3999 1 {⟨𝑥, 𝑦⟩ ∣ 𝜑} = {⟨𝑧, 𝑤⟩ ∣ 𝜓}
Colors of variables: wff set class
Syntax hints:  wi 4  wa 103  wb 104   = wceq 1331  {copab 3988
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-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-v 2688  df-un 3075  df-sn 3533  df-pr 3534  df-op 3536  df-opab 3990
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator