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

Theorem cbvoprab1 6150
Description: Rule used to change first bound variable in an operation abstraction, using implicit substitution. (Contributed by NM, 20-Dec-2008.) (Revised by Mario Carneiro, 5-Dec-2016.)
Hypotheses
Ref Expression
cbvoprab1.1 𝑤𝜑
cbvoprab1.2 𝑥𝜓
cbvoprab1.3 (𝑥 = 𝑤 → (𝜑𝜓))
Assertion
Ref Expression
cbvoprab1 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} = {⟨⟨𝑤, 𝑦⟩, 𝑧⟩ ∣ 𝜓}
Distinct variable group:   𝑥,𝑦,𝑧,𝑤
Allowed substitution hints:   𝜑(𝑥,𝑦,𝑧,𝑤)   𝜓(𝑥,𝑦,𝑧,𝑤)

Proof of Theorem cbvoprab1
Dummy variable 𝑣 is distinct from all other variables.
StepHypRef Expression
1 nfv 1581 . . . . . 6 𝑤 𝑣 = ⟨𝑥, 𝑦
2 cbvoprab1.1 . . . . . 6 𝑤𝜑
31, 2nfan 1618 . . . . 5 𝑤(𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)
43nfex 1690 . . . 4 𝑤𝑦(𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)
5 nfv 1581 . . . . . 6 𝑥 𝑣 = ⟨𝑤, 𝑦
6 cbvoprab1.2 . . . . . 6 𝑥𝜓
75, 6nfan 1618 . . . . 5 𝑥(𝑣 = ⟨𝑤, 𝑦⟩ ∧ 𝜓)
87nfex 1690 . . . 4 𝑥𝑦(𝑣 = ⟨𝑤, 𝑦⟩ ∧ 𝜓)
9 opeq1 3899 . . . . . . 7 (𝑥 = 𝑤 → ⟨𝑥, 𝑦⟩ = ⟨𝑤, 𝑦⟩)
109eqeq2d 2250 . . . . . 6 (𝑥 = 𝑤 → (𝑣 = ⟨𝑥, 𝑦⟩ ↔ 𝑣 = ⟨𝑤, 𝑦⟩))
11 cbvoprab1.3 . . . . . 6 (𝑥 = 𝑤 → (𝜑𝜓))
1210, 11anbi12d 477 . . . . 5 (𝑥 = 𝑤 → ((𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ (𝑣 = ⟨𝑤, 𝑦⟩ ∧ 𝜓)))
1312exbidv 1878 . . . 4 (𝑥 = 𝑤 → (∃𝑦(𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ ∃𝑦(𝑣 = ⟨𝑤, 𝑦⟩ ∧ 𝜓)))
144, 8, 13cbvex 1809 . . 3 (∃𝑥𝑦(𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ ∃𝑤𝑦(𝑣 = ⟨𝑤, 𝑦⟩ ∧ 𝜓))
1514opabbii 4193 . 2 {⟨𝑣, 𝑧⟩ ∣ ∃𝑥𝑦(𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)} = {⟨𝑣, 𝑧⟩ ∣ ∃𝑤𝑦(𝑣 = ⟨𝑤, 𝑦⟩ ∧ 𝜓)}
16 dfoprab2 6125 . 2 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} = {⟨𝑣, 𝑧⟩ ∣ ∃𝑥𝑦(𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)}
17 dfoprab2 6125 . 2 {⟨⟨𝑤, 𝑦⟩, 𝑧⟩ ∣ 𝜓} = {⟨𝑣, 𝑧⟩ ∣ ∃𝑤𝑦(𝑣 = ⟨𝑤, 𝑦⟩ ∧ 𝜓)}
1815, 16, 173eqtr4i 2269 1 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} = {⟨⟨𝑤, 𝑦⟩, 𝑧⟩ ∣ 𝜓}
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105   = wceq 1402  wnf 1513  wex 1545  cop 3708  {copab 4186  {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-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4244  ax-pow 4306  ax-pr 4341
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-opab 4188  df-oprab 6079
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator