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

Theorem cbvoprab1 5836
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 1508 . . . . . 6 𝑤 𝑣 = ⟨𝑥, 𝑦
2 cbvoprab1.1 . . . . . 6 𝑤𝜑
31, 2nfan 1544 . . . . 5 𝑤(𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)
43nfex 1616 . . . 4 𝑤𝑦(𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)
5 nfv 1508 . . . . . 6 𝑥 𝑣 = ⟨𝑤, 𝑦
6 cbvoprab1.2 . . . . . 6 𝑥𝜓
75, 6nfan 1544 . . . . 5 𝑥(𝑣 = ⟨𝑤, 𝑦⟩ ∧ 𝜓)
87nfex 1616 . . . 4 𝑥𝑦(𝑣 = ⟨𝑤, 𝑦⟩ ∧ 𝜓)
9 opeq1 3700 . . . . . . 7 (𝑥 = 𝑤 → ⟨𝑥, 𝑦⟩ = ⟨𝑤, 𝑦⟩)
109eqeq2d 2149 . . . . . 6 (𝑥 = 𝑤 → (𝑣 = ⟨𝑥, 𝑦⟩ ↔ 𝑣 = ⟨𝑤, 𝑦⟩))
11 cbvoprab1.3 . . . . . 6 (𝑥 = 𝑤 → (𝜑𝜓))
1210, 11anbi12d 464 . . . . 5 (𝑥 = 𝑤 → ((𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ (𝑣 = ⟨𝑤, 𝑦⟩ ∧ 𝜓)))
1312exbidv 1797 . . . 4 (𝑥 = 𝑤 → (∃𝑦(𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ ∃𝑦(𝑣 = ⟨𝑤, 𝑦⟩ ∧ 𝜓)))
144, 8, 13cbvex 1729 . . 3 (∃𝑥𝑦(𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ ∃𝑤𝑦(𝑣 = ⟨𝑤, 𝑦⟩ ∧ 𝜓))
1514opabbii 3990 . 2 {⟨𝑣, 𝑧⟩ ∣ ∃𝑥𝑦(𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)} = {⟨𝑣, 𝑧⟩ ∣ ∃𝑤𝑦(𝑣 = ⟨𝑤, 𝑦⟩ ∧ 𝜓)}
16 dfoprab2 5811 . 2 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} = {⟨𝑣, 𝑧⟩ ∣ ∃𝑥𝑦(𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)}
17 dfoprab2 5811 . 2 {⟨⟨𝑤, 𝑦⟩, 𝑧⟩ ∣ 𝜓} = {⟨𝑣, 𝑧⟩ ∣ ∃𝑤𝑦(𝑣 = ⟨𝑤, 𝑦⟩ ∧ 𝜓)}
1815, 16, 173eqtr4i 2168 1 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} = {⟨⟨𝑤, 𝑦⟩, 𝑧⟩ ∣ 𝜓}
Colors of variables: wff set class
Syntax hints:  wi 4  wa 103  wb 104   = wceq 1331  wnf 1436  wex 1468  cop 3525  {copab 3983  {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-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-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119  ax-sep 4041  ax-pow 4093  ax-pr 4126
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-v 2683  df-un 3070  df-in 3072  df-ss 3079  df-pw 3507  df-sn 3528  df-pr 3529  df-op 3531  df-opab 3985  df-oprab 5771
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator