Theorem dral1-o 39929

Description: Formula-building lemma for use with the Distinctor Reduction Theorem. Part of Theorem 9.4 of [Megill] p. 448 (p. 16 of preprint). Version of dral1 2469 using ax-c11 39912. (Contributed by NM, 24-Nov-1994.) (New usage is discouraged.)

Hypothesis

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

Assertion

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

Proof of Theorem dral1-o

Step	Hyp	Ref	Expression
1		hbae-o 39928	. . . 4 ⊢ (∀𝑥 𝑥 = 𝑦 → ∀𝑥∀𝑥 𝑥 = 𝑦)
2		dral1-o.1	. . . . 5 ⊢ (∀𝑥 𝑥 = 𝑦 → (𝜑 ↔ 𝜓))
3	2	biimpd 232	. . . 4 ⊢ (∀𝑥 𝑥 = 𝑦 → (𝜑 → 𝜓))
4	1, 3	alimdh 1850	. . 3 ⊢ (∀𝑥 𝑥 = 𝑦 → (∀𝑥𝜑 → ∀𝑥𝜓))
5		ax-c11 39912	. . 3 ⊢ (∀𝑥 𝑥 = 𝑦 → (∀𝑥𝜓 → ∀𝑦𝜓))
6	4, 5	syld 48	. 2 ⊢ (∀𝑥 𝑥 = 𝑦 → (∀𝑥𝜑 → ∀𝑦𝜓))
7		hbae-o 39928	. . . 4 ⊢ (∀𝑥 𝑥 = 𝑦 → ∀𝑦∀𝑥 𝑥 = 𝑦)
8	2	biimprd 251	. . . 4 ⊢ (∀𝑥 𝑥 = 𝑦 → (𝜓 → 𝜑))
9	7, 8	alimdh 1850	. . 3 ⊢ (∀𝑥 𝑥 = 𝑦 → (∀𝑦𝜓 → ∀𝑦𝜑))
10		ax-c11 39912	. . . 4 ⊢ (∀𝑦 𝑦 = 𝑥 → (∀𝑦𝜑 → ∀𝑥𝜑))
11	10	aecoms-o 39927	. . 3 ⊢ (∀𝑥 𝑥 = 𝑦 → (∀𝑦𝜑 → ∀𝑥𝜑))
12	9, 11	syld 48	. 2 ⊢ (∀𝑥 𝑥 = 𝑦 → (∀𝑦𝜓 → ∀𝑥𝜑))
13	6, 12	impbid 215	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 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-11 2194  ax-c5 39908  ax-c4 39909  ax-c7 39910  ax-c10 39911  ax-c11 39912  ax-c9 39915

This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1813

This theorem is used by:  ax12fromc15  39930  axc16g-o  39959  ax12indalem  39970  ax12inda2ALT  39971