Theorem dfsb1 2515

Description: Alternate definition of substitution. Remark 9.1 in [Megill] p. 447 (p. 15 of the preprint). This was the original definition before df-sb 2100. Note that it does not require dummy variables in its definiens; this is done by having 𝑥 free in the first conjunct and bound in the second. Usage of this theorem is discouraged because it depends on ax-13 2406. (Contributed by BJ, 9-Jul-2023.) Revise df-sb 2100. (Revised by Wolf Lammen, 29-Jul-2023.) (New usage is discouraged.)

Assertion

Ref	Expression
dfsb1	⊢ ([𝑦 / 𝑥]𝜑 ↔ ((𝑥 = 𝑦 → 𝜑) ∧ ∃𝑥(𝑥 = 𝑦 ∧ 𝜑)))

Proof of Theorem dfsb1

Step	Hyp	Ref	Expression
1		sbequ2 2287	. . . 4 ⊢ (𝑥 = 𝑦 → ([𝑦 / 𝑥]𝜑 → 𝜑))
2	1	com12 33	. . 3 ⊢ ([𝑦 / 𝑥]𝜑 → (𝑥 = 𝑦 → 𝜑))
3		sb1 2512	. . 3 ⊢ ([𝑦 / 𝑥]𝜑 → ∃𝑥(𝑥 = 𝑦 ∧ 𝜑))
4	2, 3	jca 521	. 2 ⊢ ([𝑦 / 𝑥]𝜑 → ((𝑥 = 𝑦 → 𝜑) ∧ ∃𝑥(𝑥 = 𝑦 ∧ 𝜑)))
5		id 23	. . . . . 6 ⊢ (𝑥 = 𝑦 → 𝑥 = 𝑦)
6		sbequ1 2286	. . . . . 6 ⊢ (𝑥 = 𝑦 → (𝜑 → [𝑦 / 𝑥]𝜑))
7	5, 6	embantd 60	. . . . 5 ⊢ (𝑥 = 𝑦 → ((𝑥 = 𝑦 → 𝜑) → [𝑦 / 𝑥]𝜑))
8	7	sps 2224	. . . 4 ⊢ (∀𝑥 𝑥 = 𝑦 → ((𝑥 = 𝑦 → 𝜑) → [𝑦 / 𝑥]𝜑))
9	8	adantrd 497	. . 3 ⊢ (∀𝑥 𝑥 = 𝑦 → (((𝑥 = 𝑦 → 𝜑) ∧ ∃𝑥(𝑥 = 𝑦 ∧ 𝜑)) → [𝑦 / 𝑥]𝜑))
10		sb3 2511	. . . 4 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → (∃𝑥(𝑥 = 𝑦 ∧ 𝜑) → [𝑦 / 𝑥]𝜑))
11	10	adantld 496	. . 3 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → (((𝑥 = 𝑦 → 𝜑) ∧ ∃𝑥(𝑥 = 𝑦 ∧ 𝜑)) → [𝑦 / 𝑥]𝜑))
12	9, 11	pm2.61i 184	. 2 ⊢ (((𝑥 = 𝑦 → 𝜑) ∧ ∃𝑥(𝑥 = 𝑦 ∧ 𝜑)) → [𝑦 / 𝑥]𝜑)
13	4, 12	impbii 212	1 ⊢ ([𝑦 / 𝑥]𝜑 ↔ ((𝑥 = 𝑦 → 𝜑) ∧ ∃𝑥(𝑥 = 𝑦 ∧ 𝜑)))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1568  ∃wex 1812  [wsb 2099

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 2406

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

This theorem is used by:  drsb1  2529  bj-dfsb2  37534  frege55b  44700