Theorem drnf1 2317

Description: Formula-building lemma for use with the Distinctor Reduction Theorem. (Contributed by Mario Carneiro, 4-Oct-2016.)

Hypothesis

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

Assertion

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

Proof of Theorem drnf1

Step	Hyp	Ref	Expression
1		dral1.1	. . . 4 ⊢ (∀𝑥 𝑥 = 𝑦 → (𝜑 ↔ 𝜓))
2	1	dral1 2313	. . . 4 ⊢ (∀𝑥 𝑥 = 𝑦 → (∀𝑥𝜑 ↔ ∀𝑦𝜓))
3	1, 2	imbi12d 333	. . 3 ⊢ (∀𝑥 𝑥 = 𝑦 → ((𝜑 → ∀𝑥𝜑) ↔ (𝜓 → ∀𝑦𝜓)))
4	3	dral1 2313	. 2 ⊢ (∀𝑥 𝑥 = 𝑦 → (∀𝑥(𝜑 → ∀𝑥𝜑) ↔ ∀𝑦(𝜓 → ∀𝑦𝜓)))
5		nf5 2102	. 2 ⊢ (Ⅎ𝑥𝜑 ↔ ∀𝑥(𝜑 → ∀𝑥𝜑))
6		nf5 2102	. 2 ⊢ (Ⅎ𝑦𝜓 ↔ ∀𝑦(𝜓 → ∀𝑦𝜓))
7	4, 5, 6	3bitr4g 302	1 ⊢ (∀𝑥 𝑥 = 𝑦 → (Ⅎ𝑥𝜑 ↔ Ⅎ𝑦𝜓))

Syntax hints:   → wi 4   ↔ wb 195  ∀wal 1473  Ⅎwnf 1699

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-10 2006  ax-12 2034  ax-13 2234

This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-tru 1478  df-ex 1696  df-nf 1701

This theorem is referenced by:  nfald2  2319  drnfc1  2768  wl-nfs1t  32503