Theorem dral1 2471

Description: Formula-building lemma for use with the Distinctor Reduction Theorem. Part of Theorem 9.4 of [Megill] p. 448 (p. 16 of preprint). Usage of this theorem is discouraged because it depends on ax-13 2404. Use the weaker dral1v 2401 if possible. (Contributed by NM, 24-Nov-1994.) Remove dependency on ax-11 2192. (Revised by Wolf Lammen, 6-Sep-2018.) (New usage is discouraged.)

Hypothesis

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

Assertion

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

Proof of Theorem dral1

Step	Hyp	Ref	Expression
1		nfa1 2186	. . 3 ⊢ Ⅎ𝑥∀𝑥 𝑥 = 𝑦
2		dral1.1	. . 3 ⊢ (∀𝑥 𝑥 = 𝑦 → (𝜑 ↔ 𝜓))
3	1, 2	albid 2258	. 2 ⊢ (∀𝑥 𝑥 = 𝑦 → (∀𝑥𝜑 ↔ ∀𝑥𝜓))
4		axc11 2462	. . 3 ⊢ (∀𝑥 𝑥 = 𝑦 → (∀𝑥𝜓 → ∀𝑦𝜓))
5		axc11r 2400	. . 3 ⊢ (∀𝑥 𝑥 = 𝑦 → (∀𝑦𝜓 → ∀𝑥𝜓))
6	4, 5	impbid 215	. 2 ⊢ (∀𝑥 𝑥 = 𝑦 → (∀𝑥𝜓 ↔ ∀𝑦𝜓))
7	3, 6	bitrd 282	1 ⊢ (∀𝑥 𝑥 = 𝑦 → (∀𝑥𝜑 ↔ ∀𝑦𝜓))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209  ∀wal 1568

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-10 2176  ax-12 2213  ax-13 2404

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-ex 1810  df-nf 1814

This theorem is used by:  drex1  2473  drnf1  2475  axc16gALT  2522  sb9  2551  ralcom2  3366  axpownd  10590  axnulg  35566  wl-dral1d  38214