Theorem sb3 2501

Description: One direction of a simplified definition of substitution when variables are distinct. Usage of this theorem is discouraged because it depends on ax-13 2389. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Wolf Lammen, 21-Feb-2024.) (New usage is discouraged.)

Assertion

Ref	Expression
sb3	⊢ (¬ ∀𝑥 𝑥 = 𝑦 → (∃𝑥(𝑥 = 𝑦 ∧ 𝜑) → [𝑦 / 𝑥]𝜑))

Proof of Theorem sb3

Step	Hyp	Ref	Expression
1		sb3b 2500	. 2 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → ([𝑦 / 𝑥]𝜑 ↔ ∃𝑥(𝑥 = 𝑦 ∧ 𝜑)))
2	1	biimprd 250	1 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → (∃𝑥(𝑥 = 𝑦 ∧ 𝜑) → [𝑦 / 𝑥]𝜑))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 398  ∀wal 1534  ∃wex 1779  [wsb 2068

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1969  ax-7 2014  ax-10 2144  ax-12 2176  ax-13 2389

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-ex 1780  df-nf 1784  df-sb 2069

This theorem is referenced by:  sb3bOLD  2507  dfsb1  2509