Theorem bj-ax12v3 36698

Description: A weak version of ax-12 2179 which is stronger than ax12v 2180. Note that if one assumes reflexivity of equality ⊢ 𝑥 = 𝑥 (equid 2013), then bj-ax12v3 36698 implies ax-5 1911 over modal logic K (substitute 𝑥 for 𝑦). See also bj-ax12v3ALT 36699. (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 1911	. 2 ⊢ (𝜑 → ∀𝑦𝜑)
2		ax12 2422	. 2 ⊢ (𝑥 = 𝑦 → (∀𝑦𝜑 → ∀𝑥(𝑥 = 𝑦 → 𝜑)))
3	1, 2	syl5 34	1 ⊢ (𝑥 = 𝑦 → (𝜑 → ∀𝑥(𝑥 = 𝑦 → 𝜑)))

Syntax hints:   → wi 4  ∀wal 1539

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-10 2143  ax-12 2179  ax-13 2371

This theorem depends on definitions:  df-bi 207  df-an 396  df-ex 1781  df-nf 1785

This theorem is referenced by: (None)