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

Theorem gencbvex 2869
Description: Change of bound variable using implicit substitution. (Contributed by NM, 17-May-1996.) (Proof shortened by Andrew Salmon, 8-Jun-2011.)
Hypotheses
Ref Expression
gencbvex.1 𝐴 ∈ V
gencbvex.2 (𝐴 = 𝑦 → (𝜑 ↔ 𝜓))
gencbvex.3 (𝐴 = 𝑦 → (𝜒 ↔ 𝜃))
gencbvex.4 (𝜃 ↔ ∃𝑥(𝜒 ∧ 𝐴 = 𝑦))
Assertion
Ref Expression
gencbvex (∃𝑥(𝜒 ∧ 𝜑) ↔ ∃𝑦(𝜃 ∧ 𝜓))
Distinct variable groups:   𝜓,𝑥   𝜑,𝑦   𝜃,𝑥   𝜒,𝑦   𝑦,𝐴
Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑦)   𝜒(𝑥)   𝜃(𝑦)   𝐴(𝑥)

Proof of Theorem gencbvex
StepHypRef Expression
1 excom 1716 . 2 (∃𝑥∃𝑦(𝑦 = 𝐴 ∧ (𝜃 ∧ 𝜓)) ↔ ∃𝑦∃𝑥(𝑦 = 𝐴 ∧ (𝜃 ∧ 𝜓)))
2 gencbvex.1 . . . 4 𝐴 ∈ V
3 gencbvex.3 . . . . . . 7 (𝐴 = 𝑦 → (𝜒 ↔ 𝜃))
4 gencbvex.2 . . . . . . 7 (𝐴 = 𝑦 → (𝜑 ↔ 𝜓))
53, 4anbi12d 477 . . . . . 6 (𝐴 = 𝑦 → ((𝜒 ∧ 𝜑) ↔ (𝜃 ∧ 𝜓)))
65bicomd 141 . . . . 5 (𝐴 = 𝑦 → ((𝜃 ∧ 𝜓) ↔ (𝜒 ∧ 𝜑)))
76eqcoms 2241 . . . 4 (𝑦 = 𝐴 → ((𝜃 ∧ 𝜓) ↔ (𝜒 ∧ 𝜑)))
82, 7ceqsexv 2861 . . 3 (∃𝑦(𝑦 = 𝐴 ∧ (𝜃 ∧ 𝜓)) ↔ (𝜒 ∧ 𝜑))
98exbii 1658 . 2 (∃𝑥∃𝑦(𝑦 = 𝐴 ∧ (𝜃 ∧ 𝜓)) ↔ ∃𝑥(𝜒 ∧ 𝜑))
10 19.41v 1958 . . . 4 (∃𝑥(𝑦 = 𝐴 ∧ (𝜃 ∧ 𝜓)) ↔ (∃𝑥 𝑦 = 𝐴 ∧ (𝜃 ∧ 𝜓)))
11 simpr 110 . . . . 5 ((∃𝑥 𝑦 = 𝐴 ∧ (𝜃 ∧ 𝜓)) → (𝜃 ∧ 𝜓))
12 gencbvex.4 . . . . . . . 8 (𝜃 ↔ ∃𝑥(𝜒 ∧ 𝐴 = 𝑦))
13 eqcom 2240 . . . . . . . . . . 11 (𝐴 = 𝑦 ↔ 𝑦 = 𝐴)
1413biimpi 120 . . . . . . . . . 10 (𝐴 = 𝑦 → 𝑦 = 𝐴)
1514adantl 277 . . . . . . . . 9 ((𝜒 ∧ 𝐴 = 𝑦) → 𝑦 = 𝐴)
1615eximi 1653 . . . . . . . 8 (∃𝑥(𝜒 ∧ 𝐴 = 𝑦) → ∃𝑥 𝑦 = 𝐴)
1712, 16sylbi 121 . . . . . . 7 (𝜃 → ∃𝑥 𝑦 = 𝐴)
1817adantr 276 . . . . . 6 ((𝜃 ∧ 𝜓) → ∃𝑥 𝑦 = 𝐴)
1918ancri 324 . . . . 5 ((𝜃 ∧ 𝜓) → (∃𝑥 𝑦 = 𝐴 ∧ (𝜃 ∧ 𝜓)))
2011, 19impbii 126 . . . 4 ((∃𝑥 𝑦 = 𝐴 ∧ (𝜃 ∧ 𝜓)) ↔ (𝜃 ∧ 𝜓))
2110, 20bitri 184 . . 3 (∃𝑥(𝑦 = 𝐴 ∧ (𝜃 ∧ 𝜓)) ↔ (𝜃 ∧ 𝜓))
2221exbii 1658 . 2 (∃𝑦∃𝑥(𝑦 = 𝐴 ∧ (𝜃 ∧ 𝜓)) ↔ ∃𝑦(𝜃 ∧ 𝜓))
231, 9, 223bitr3i 210 1 (∃𝑥(𝜒 ∧ 𝜑) ↔ ∃𝑦(𝜃 ∧ 𝜓))
Colors of variables:    wff set class
This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1402  ∃wex 1545   ∈ wcel 2209  Vcvv 2821
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-ext 2220
This proof depends on definitions:  df-bi 117  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-v 2823
This theorem is used by:  gencbvex2  2870
  Copyright terms: Public domain W3C validator