Theorem sb7h 2560

Description: This version of dfsb7 2316 does not require that 𝜑 and 𝑧 be disjoint. This permits it to be used as a definition for substitution in a formalization that omits the logically redundant axiom ax-5 1933, i.e., that does not have the concept of a variable not occurring in a formula. (Definition dfsb1 2515 is also suitable, but its mixing of free and bound variables is distasteful to some logicians.) Usage of this theorem is discouraged because it depends on ax-13 2406. (Contributed by NM, 26-Jul-2006.) (Proof shortened by Andrew Salmon, 25-May-2011.) (New usage is discouraged.)

Hypothesis

Ref	Expression
sb7h.1	⊢ (𝜑 → ∀𝑧𝜑)

Assertion

Ref	Expression
sb7h	⊢ ([𝑦 / 𝑥]𝜑 ↔ ∃𝑧(𝑧 = 𝑦 ∧ ∃𝑥(𝑥 = 𝑧 ∧ 𝜑)))

Distinct variable group:   𝑦,𝑧

Allowed substitution hints:   𝜑(𝑥,𝑦,𝑧)

Proof of Theorem sb7h

Step	Hyp	Ref	Expression
1		sb7h.1	. . 3 ⊢ (𝜑 → ∀𝑧𝜑)
2	1	nf5i 2183	. 2 ⊢ Ⅎ𝑧𝜑
3	2	sb7f 2559	1 ⊢ ([𝑦 / 𝑥]𝜑 ↔ ∃𝑧(𝑧 = 𝑦 ∧ ∃𝑥(𝑥 = 𝑧 ∧ 𝜑)))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 400  ∀wal 1561  ∃wex 1802  [wsb 2093

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-10 2178  ax-11 2194  ax-12 2215  ax-13 2406

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-tru 1566  df-ex 1803  df-nf 1807  df-sb 2094

This theorem is referenced by: (None)