Theorem sb7f 2590

Description: This version of dfsb7 2592 does not require that 𝜑 and 𝑧 be distinct. This permits it to be used as a definition for substitution in a formalization that omits the logically redundant axiom ax-5 1988 i.e. that doesn't have the concept of a variable not occurring in a wff. (df-sb 2047 is also suitable, but its mixing of free and bound variables is distasteful to some logicians.) (Contributed by NM, 26-Jul-2006.) (Revised by Mario Carneiro, 6-Oct-2016.)

Hypothesis

Ref	Expression
sb7f.1	⊢ Ⅎ𝑧𝜑

Assertion

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

Distinct variable group:   𝑦,𝑧

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

Proof of Theorem sb7f

Step	Hyp	Ref	Expression
1		sb7f.1	. . . 4 ⊢ Ⅎ𝑧𝜑
2	1	sb5f 2523	. . 3 ⊢ ([𝑧 / 𝑥]𝜑 ↔ ∃𝑥(𝑥 = 𝑧 ∧ 𝜑))
3	2	sbbii 2053	. 2 ⊢ ([𝑦 / 𝑧][𝑧 / 𝑥]𝜑 ↔ [𝑦 / 𝑧]∃𝑥(𝑥 = 𝑧 ∧ 𝜑))
4	1	sbco2 2552	. 2 ⊢ ([𝑦 / 𝑧][𝑧 / 𝑥]𝜑 ↔ [𝑦 / 𝑥]𝜑)
5		sb5 2567	. 2 ⊢ ([𝑦 / 𝑧]∃𝑥(𝑥 = 𝑧 ∧ 𝜑) ↔ ∃𝑧(𝑧 = 𝑦 ∧ ∃𝑥(𝑥 = 𝑧 ∧ 𝜑)))
6	3, 4, 5	3bitr3i 290	1 ⊢ ([𝑦 / 𝑥]𝜑 ↔ ∃𝑧(𝑧 = 𝑦 ∧ ∃𝑥(𝑥 = 𝑧 ∧ 𝜑)))

Syntax hints:   ↔ wb 196   ∧ wa 383  ∃wex 1853  Ⅎwnf 1857  [wsb 2046

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1871  ax-4 1886  ax-5 1988  ax-6 2054  ax-7 2090  ax-10 2168  ax-11 2183  ax-12 2196  ax-13 2391

This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-tru 1635  df-ex 1854  df-nf 1859  df-sb 2047

This theorem is referenced by:  sb7h  2591  dfsb7  2592