Metamath Proof Explorer


Theorem dfsb2

Description: An alternate definition of proper substitution that, like dfsb1 , mixes free and bound variables to avoid distinct variable requirements. Usage of this theorem is discouraged because it depends on ax-13 . (Contributed by NM, 17-Feb-2005) (New usage is discouraged.)

Ref Expression
Assertion dfsb2 ⊢ y x φ ↔ x = y ∧ φ ∨ ∀ x x = y → φ

Proof

Step Hyp Ref Expression
1 sp ⊢ ∀ x x = y → x = y
2 sbequ2 ⊢ x = y → y x φ → φ
3 2 sps ⊢ ∀ x x = y → y x φ → φ
4 orc ⊢ x = y ∧ φ → x = y ∧ φ ∨ ∀ x x = y → φ
5 1 3 4 syl6an ⊢ ∀ x x = y → y x φ → x = y ∧ φ ∨ ∀ x x = y → φ
6 sb4b ⊢ ¬ ∀ x x = y → y x φ ↔ ∀ x x = y → φ
7 olc ⊢ ∀ x x = y → φ → x = y ∧ φ ∨ ∀ x x = y → φ
8 6 7 biimtrdi ⊢ ¬ ∀ x x = y → y x φ → x = y ∧ φ ∨ ∀ x x = y → φ
9 5 8 pm2.61i ⊢ y x φ → x = y ∧ φ ∨ ∀ x x = y → φ
10 sbequ1 ⊢ x = y → φ → y x φ
11 10 imp ⊢ x = y ∧ φ → y x φ
12 sb2 ⊢ ∀ x x = y → φ → y x φ
13 11 12 jaoi ⊢ x = y ∧ φ ∨ ∀ x x = y → φ → y x φ
14 9 13 impbii ⊢ y x φ ↔ x = y ∧ φ ∨ ∀ x x = y → φ