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

Theorem cbvopab1v 3861
 Description: Rule used to change the first bound variable in an ordered pair abstraction, using implicit substitution. (Contributed by NM, 31-Jul-2003.) (Proof shortened by Eric Schmidt, 4-Apr-2007.)
Hypothesis
Ref Expression
cbvopab1v.1 (𝑥 = 𝑧 → (𝜑𝜓))
Assertion
Ref Expression
cbvopab1v {⟨𝑥, 𝑦⟩ ∣ 𝜑} = {⟨𝑧, 𝑦⟩ ∣ 𝜓}
Distinct variable groups:   𝑥,𝑦   𝑦,𝑧   𝜑,𝑧   𝜓,𝑥
Allowed substitution hints:   𝜑(𝑥,𝑦)   𝜓(𝑦,𝑧)

Proof of Theorem cbvopab1v
StepHypRef Expression
1 nfv 1437 . 2 𝑧𝜑
2 nfv 1437 . 2 𝑥𝜓
3 cbvopab1v.1 . 2 (𝑥 = 𝑧 → (𝜑𝜓))
41, 2, 3cbvopab1 3858 1 {⟨𝑥, 𝑦⟩ ∣ 𝜑} = {⟨𝑧, 𝑦⟩ ∣ 𝜓}
 Colors of variables: wff set class Syntax hints:   → wi 4   ↔ wb 102   = wceq 1259  {copab 3845 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 103  ax-ia2 104  ax-ia3 105  ax-io 640  ax-5 1352  ax-7 1353  ax-gen 1354  ax-ie1 1398  ax-ie2 1399  ax-8 1411  ax-10 1412  ax-11 1413  ax-i12 1414  ax-bndl 1415  ax-4 1416  ax-17 1435  ax-i9 1439  ax-ial 1443  ax-i5r 1444  ax-ext 2038 This theorem depends on definitions:  df-bi 114  df-3an 898  df-tru 1262  df-nf 1366  df-sb 1662  df-clab 2043  df-cleq 2049  df-clel 2052  df-nfc 2183  df-v 2576  df-un 2950  df-sn 3409  df-pr 3410  df-op 3412  df-opab 3847 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator