Theorem bj-sb 34023

Description: A weak variant of sbid2 2550 not requiring ax-13 2390 nor ax-10 2145. On top of Tarski's FOL, one implication requires only ax12v 2178, and the other requires only sp 2182. (Contributed by BJ, 25-May-2021.)

Assertion

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

Distinct variable groups:   𝑥,𝑦   𝜑,𝑦

Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem bj-sb

Step	Hyp	Ref	Expression
1		ax12v 2178	. . . . 5 ⊢ (𝑥 = 𝑦 → (𝜑 → ∀𝑥(𝑥 = 𝑦 → 𝜑)))
2	1	equcoms 2027	. . . 4 ⊢ (𝑦 = 𝑥 → (𝜑 → ∀𝑥(𝑥 = 𝑦 → 𝜑)))
3	2	com12 32	. . 3 ⊢ (𝜑 → (𝑦 = 𝑥 → ∀𝑥(𝑥 = 𝑦 → 𝜑)))
4	3	alrimiv 1928	. 2 ⊢ (𝜑 → ∀𝑦(𝑦 = 𝑥 → ∀𝑥(𝑥 = 𝑦 → 𝜑)))
5		sp 2182	. . . . . . 7 ⊢ (∀𝑥(𝑥 = 𝑦 → 𝜑) → (𝑥 = 𝑦 → 𝜑))
6	5	com12 32	. . . . . 6 ⊢ (𝑥 = 𝑦 → (∀𝑥(𝑥 = 𝑦 → 𝜑) → 𝜑))
7	6	equcoms 2027	. . . . 5 ⊢ (𝑦 = 𝑥 → (∀𝑥(𝑥 = 𝑦 → 𝜑) → 𝜑))
8	7	a2i 14	. . . 4 ⊢ ((𝑦 = 𝑥 → ∀𝑥(𝑥 = 𝑦 → 𝜑)) → (𝑦 = 𝑥 → 𝜑))
9	8	alimi 1812	. . 3 ⊢ (∀𝑦(𝑦 = 𝑥 → ∀𝑥(𝑥 = 𝑦 → 𝜑)) → ∀𝑦(𝑦 = 𝑥 → 𝜑))
10		bj-eqs 34010	. . 3 ⊢ (𝜑 ↔ ∀𝑦(𝑦 = 𝑥 → 𝜑))
11	9, 10	sylibr 236	. 2 ⊢ (∀𝑦(𝑦 = 𝑥 → ∀𝑥(𝑥 = 𝑦 → 𝜑)) → 𝜑)
12	4, 11	impbii 211	1 ⊢ (𝜑 ↔ ∀𝑦(𝑦 = 𝑥 → ∀𝑥(𝑥 = 𝑦 → 𝜑)))

Syntax hints:   → wi 4   ↔ wb 208  ∀wal 1535

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 1970  ax-7 2015  ax-12 2177

This theorem depends on definitions:  df-bi 209  df-an 399  df-ex 1781

This theorem is referenced by: (None)