Metamath Proof Explorer


Theorem sb7f

Description: This version of dfsb7 does not require that ph and z be disjoint. This permits it to be used as a definition for substitution in a formalization that omits the logically redundant axiom ax-5 , i.e., that does not have the concept of a variable not occurring in a formula. (Definition dfsb1 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 . (Contributed by NM, 26-Jul-2006) (Revised by Mario Carneiro, 6-Oct-2016) (New usage is discouraged.)

Ref Expression
Hypothesis sb7f.1 ⊢ Ⅎ z φ
Assertion sb7f ⊢ y x φ ↔ ∃ z z = y ∧ ∃ x x = z ∧ φ

Proof

Step Hyp Ref Expression
1 sb7f.1 ⊢ Ⅎ z φ
2 1 sb5f ⊢ z x φ ↔ ∃ x x = z ∧ φ
3 2 sbbii ⊢ y z z x φ ↔ y z ∃ x x = z ∧ φ
4 1 sbco2 ⊢ y z z x φ ↔ y x φ
5 sb5 ⊢ y z ∃ x x = z ∧ φ ↔ ∃ z z = y ∧ ∃ x x = z ∧ φ
6 3 4 5 3bitr3i ⊢ y x φ ↔ ∃ z z = y ∧ ∃ x x = z ∧ φ