Theorem ax11i 1714

Description: Inference that has ax-11 1506 (without ∀𝑦) as its conclusion and does not require ax-10 1505, ax-11 1506, or ax12 1512 for its proof. The hypotheses may be eliminable without one or more of these axioms in special cases. Proof similar to Lemma 16 of [Tarski] p. 70. (Contributed by NM, 20-May-2008.)

Hypotheses

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

Assertion

Ref	Expression
ax11i	⊢ (𝑥 = 𝑦 → (𝜑 → ∀𝑥(𝑥 = 𝑦 → 𝜑)))

Proof of Theorem ax11i

Step	Hyp	Ref	Expression
1		ax11i.1	. 2 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))
2		ax11i.2	. . 3 ⊢ (𝜓 → ∀𝑥𝜓)
3	1	biimprcd 160	. . 3 ⊢ (𝜓 → (𝑥 = 𝑦 → 𝜑))
4	2, 3	alrimih 1469	. 2 ⊢ (𝜓 → ∀𝑥(𝑥 = 𝑦 → 𝜑))
5	1, 4	biimtrdi 163	1 ⊢ (𝑥 = 𝑦 → (𝜑 → ∀𝑥(𝑥 = 𝑦 → 𝜑)))

Syntax hints:   → wi 4   ↔ wb 105  ∀wal 1351

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-5 1447  ax-gen 1449

This theorem depends on definitions:  df-bi 117

This theorem is referenced by: (None)