Theorem ralbinrald 48191

Description: Elemination of a restricted universal quantification under certain conditions. (Contributed by Alexander van der Vekens, 2-Aug-2017.)

Hypotheses

Ref	Expression
ralbinrald.1	⊢ (𝜑 → 𝑋 ∈ 𝐴)
ralbinrald.2	⊢ (𝑥 ∈ 𝐴 → 𝑥 = 𝑋)
ralbinrald.3	⊢ (𝑥 = 𝑋 → (𝜓 ↔ 𝜃))

Assertion

Ref	Expression
ralbinrald	⊢ (𝜑 → (∀𝑥 ∈ 𝐴 𝜓 ↔ 𝜃))

Distinct variable groups:   𝑥,𝑋   𝑥,𝐴   𝜑,𝑥   𝜃,𝑥

Allowed substitution hint:   𝜓(𝑥)

Proof of Theorem ralbinrald

Step	Hyp	Ref	Expression
1		ralbinrald.1	. . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐴)
2		ralbinrald.3	. . . 4 ⊢ (𝑥 = 𝑋 → (𝜓 ↔ 𝜃))
3	2	adantl 487	. . 3 ⊢ ((𝜑 ∧ 𝑥 = 𝑋) → (𝜓 ↔ 𝜃))
4	1, 3	rspcdv 3569	. 2 ⊢ (𝜑 → (∀𝑥 ∈ 𝐴 𝜓 → 𝜃))
5		ralbinrald.2	. . . . . 6 ⊢ (𝑥 ∈ 𝐴 → 𝑥 = 𝑋)
6	2	bicomd 226	. . . . . 6 ⊢ (𝑥 = 𝑋 → (𝜃 ↔ 𝜓))
7	5, 6	syl 18	. . . . 5 ⊢ (𝑥 ∈ 𝐴 → (𝜃 ↔ 𝜓))
8	7	adantl 487	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝜃 ↔ 𝜓))
9	8	biimpd 232	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝜃 → 𝜓))
10	9	ralrimdva 3163	. 2 ⊢ (𝜑 → (𝜃 → ∀𝑥 ∈ 𝐴 𝜓))
11	4, 10	impbid 215	1 ⊢ (𝜑 → (∀𝑥 ∈ 𝐴 𝜓 ↔ 𝜃))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3077

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-9 2155  ax-ext 2733

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ral 3078

This theorem is used by:  dfdfat2  48197