Theorem dral1v 2368

Description: Formula-building lemma for use with the Distinctor Reduction Theorem. Version of dral1 2438 with a disjoint variable condition, which does not require ax-13 2371. Remark: the corresponding versions for dral2 2437 and drex2 2441 are instances of albidv 1928 and exbidv 1929 respectively. (Contributed by NM, 24-Nov-1994.) (Revised by BJ, 17-Jun-2019.) Base the proof on ax12v 2176. (Revised by Wolf Lammen, 30-Mar-2024.)

Hypothesis

Ref	Expression
dral1v.1	⊢ (∀𝑥 𝑥 = 𝑦 → (𝜑 ↔ 𝜓))

Assertion

Ref	Expression
dral1v	⊢ (∀𝑥 𝑥 = 𝑦 → (∀𝑥𝜑 ↔ ∀𝑦𝜓))

Distinct variable group:   𝑥,𝑦

Allowed substitution hints:   𝜑(𝑥,𝑦)   𝜓(𝑥,𝑦)

Proof of Theorem dral1v

Step	Hyp	Ref	Expression
1		nfa1 2152	. . 3 ⊢ Ⅎ𝑥∀𝑥 𝑥 = 𝑦
2		dral1v.1	. . 3 ⊢ (∀𝑥 𝑥 = 𝑦 → (𝜑 ↔ 𝜓))
3	1, 2	albid 2220	. 2 ⊢ (∀𝑥 𝑥 = 𝑦 → (∀𝑥𝜑 ↔ ∀𝑥𝜓))
4		axc11v 2261	. . 3 ⊢ (∀𝑥 𝑥 = 𝑦 → (∀𝑥𝜓 → ∀𝑦𝜓))
5		axc11rv 2262	. . 3 ⊢ (∀𝑥 𝑥 = 𝑦 → (∀𝑦𝜓 → ∀𝑥𝜓))
6	4, 5	impbid 215	. 2 ⊢ (∀𝑥 𝑥 = 𝑦 → (∀𝑥𝜓 ↔ ∀𝑦𝜓))
7	3, 6	bitrd 282	1 ⊢ (∀𝑥 𝑥 = 𝑦 → (∀𝑥𝜑 ↔ ∀𝑦𝜓))

Syntax hints:   → wi 4   ↔ wb 209  ∀wal 1541

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1976  ax-7 2016  ax-10 2141  ax-12 2175

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 848  df-ex 1788  df-nf 1792

This theorem is referenced by:  drex1v  2369  drnf1v  2370