Theorem bj-ax12v3 37351

Description: A weak version of ax-12 2216 which is stronger than ax12v 2217. Note that if one assumes reflexivity of equality ⊢ 𝑥 = 𝑥 (equid 2045), then bj-ax12v3 37351 implies ax-5 1943 over modal logic K (substitute 𝑥 for 𝑦). See also bj-ax12v3ALT 37352. (Contributed by BJ, 6-Jul-2021.) (Proof modification is discouraged.)

Assertion

Ref	Expression
bj-ax12v3	⊢ (𝑥 = 𝑦 → (𝜑 → ∀𝑥(𝑥 = 𝑦 → 𝜑)))

Distinct variable group:   𝜑,𝑦

Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem bj-ax12v3

Step	Hyp	Ref	Expression
1		ax-5 1943	. 2 ⊢ (𝜑 → ∀𝑦𝜑)
2		ax12 2458	. 2 ⊢ (𝑥 = 𝑦 → (∀𝑦𝜑 → ∀𝑥(𝑥 = 𝑦 → 𝜑)))
3	1, 2	syl5 35	1 ⊢ (𝑥 = 𝑦 → (𝜑 → ∀𝑥(𝑥 = 𝑦 → 𝜑)))

This proof depends on syntax axioms:   → wi 4  ∀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-10 2179  ax-12 2216  ax-13 2407

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

This theorem is used by: (None)