Theorem rexlimdvaacbv 45202

Description: Unpack a restricted existential antecedent while changing the variable with implicit substitution. The equivalent of this theorem without the bound variable change is rexlimdvaa 3165. (Contributed by Rohan Ridenour, 3-Aug-2023.)

Hypotheses

Ref	Expression
rexlimdvaacbv.1	⊢ (𝑥 = 𝑦 → (𝜓 ↔ 𝜃))
rexlimdvaacbv.2	⊢ ((𝜑 ∧ (𝑦 ∈ 𝐴 ∧ 𝜃)) → 𝜒)

Assertion

Ref	Expression
rexlimdvaacbv	⊢ (𝜑 → (∃𝑥 ∈ 𝐴 𝜓 → 𝜒))

Distinct variable groups:   𝑥,𝐴   𝑦,𝐴   𝜓,𝑦   𝜃,𝑥   𝜑,𝑦   𝜒,𝑦

Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑥)   𝜒(𝑥)   𝜃(𝑦)

Proof of Theorem rexlimdvaacbv

Step	Hyp	Ref	Expression
1		rexlimdvaacbv.1	. . 3 ⊢ (𝑥 = 𝑦 → (𝜓 ↔ 𝜃))
2	1	cbvrexv 3351	. 2 ⊢ (∃𝑥 ∈ 𝐴 𝜓 ↔ ∃𝑦 ∈ 𝐴 𝜃)
3		rexlimdvaacbv.2	. . 3 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝐴 ∧ 𝜃)) → 𝜒)
4	3	rexlimdvaa 3165	. 2 ⊢ (𝜑 → (∃𝑦 ∈ 𝐴 𝜃 → 𝜒))
5	2, 4	biimtrid 245	1 ⊢ (𝜑 → (∃𝑥 ∈ 𝐴 𝜓 → 𝜒))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∈ wcel 2145  ∃wrex 3087

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-10 2178  ax-11 2194  ax-12 2213  ax-13 2402

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-nf 1817  df-sb 2100  df-clel 2836  df-nfc 2910  df-ral 3078  df-rex 3088

This theorem is used by:  rexlimddvcbv  45204