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

Theorem cbvoprab1 5949
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 1528 . . . . . 6 𝑤 𝑣 = ⟨𝑥, 𝑦
2 cbvoprab1.1 . . . . . 6 𝑤𝜑
31, 2nfan 1565 . . . . 5 𝑤(𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)
43nfex 1637 . . . 4 𝑤𝑦(𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)
5 nfv 1528 . . . . . 6 𝑥 𝑣 = ⟨𝑤, 𝑦
6 cbvoprab1.2 . . . . . 6 𝑥𝜓
75, 6nfan 1565 . . . . 5 𝑥(𝑣 = ⟨𝑤, 𝑦⟩ ∧ 𝜓)
87nfex 1637 . . . 4 𝑥𝑦(𝑣 = ⟨𝑤, 𝑦⟩ ∧ 𝜓)
9 opeq1 3780 . . . . . . 7 (𝑥 = 𝑤 → ⟨𝑥, 𝑦⟩ = ⟨𝑤, 𝑦⟩)
109eqeq2d 2189 . . . . . 6 (𝑥 = 𝑤 → (𝑣 = ⟨𝑥, 𝑦⟩ ↔ 𝑣 = ⟨𝑤, 𝑦⟩))
11 cbvoprab1.3 . . . . . 6 (𝑥 = 𝑤 → (𝜑𝜓))
1210, 11anbi12d 473 . . . . 5 (𝑥 = 𝑤 → ((𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ (𝑣 = ⟨𝑤, 𝑦⟩ ∧ 𝜓)))
1312exbidv 1825 . . . 4 (𝑥 = 𝑤 → (∃𝑦(𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ ∃𝑦(𝑣 = ⟨𝑤, 𝑦⟩ ∧ 𝜓)))
144, 8, 13cbvex 1756 . . 3 (∃𝑥𝑦(𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ ∃𝑤𝑦(𝑣 = ⟨𝑤, 𝑦⟩ ∧ 𝜓))
1514opabbii 4072 . 2 {⟨𝑣, 𝑧⟩ ∣ ∃𝑥𝑦(𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)} = {⟨𝑣, 𝑧⟩ ∣ ∃𝑤𝑦(𝑣 = ⟨𝑤, 𝑦⟩ ∧ 𝜓)}
16 dfoprab2 5924 . 2 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} = {⟨𝑣, 𝑧⟩ ∣ ∃𝑥𝑦(𝑣 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)}
17 dfoprab2 5924 . 2 {⟨⟨𝑤, 𝑦⟩, 𝑧⟩ ∣ 𝜓} = {⟨𝑣, 𝑧⟩ ∣ ∃𝑤𝑦(𝑣 = ⟨𝑤, 𝑦⟩ ∧ 𝜓)}
1815, 16, 173eqtr4i 2208 1 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} = {⟨⟨𝑤, 𝑦⟩, 𝑧⟩ ∣ 𝜓}
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105   = wceq 1353  wnf 1460  wex 1492  cop 3597  {copab 4065  {coprab 5878
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 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-14 2151  ax-ext 2159  ax-sep 4123  ax-pow 4176  ax-pr 4211
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-v 2741  df-un 3135  df-in 3137  df-ss 3144  df-pw 3579  df-sn 3600  df-pr 3601  df-op 3603  df-opab 4067  df-oprab 5881
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator