Metamath Proof Explorer


Theorem drnf1

Description: Formula-building lemma for use with the Distinctor Reduction Theorem. Usage of this theorem is discouraged because it depends on ax-13 . Use the weaker drnf1v if possible. (Contributed by Mario Carneiro, 4-Oct-2016) (New usage is discouraged.)

Ref Expression
Hypothesis dral1.1 ( ∀ 𝑥 𝑥 = 𝑦 → ( 𝜑𝜓 ) )
Assertion drnf1 ( ∀ 𝑥 𝑥 = 𝑦 → ( Ⅎ 𝑥 𝜑 ↔ Ⅎ 𝑦 𝜓 ) )

Proof

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