Metamath Proof Explorer


Theorem bj-df-sb

Description: Proposed definition to replace df-sb and df-sbc . Proof is therefore unimportant. Contrary to df-sb , this definition makes a substituted formula false when one substitutes a non-existent object for a variable. This is better suited to the "Levy-style" treatment of classes as virtual objects adopted by set.mm. Indeed, in most set theories, and in particular in this database, one wants to be able to collect the extension of a formula, so it is natural that the extension of a formula contain only sets, and not proper classes. This is illustrated by the fact that bj-dfsbc holds unconditionally. That statement could therefore replace df-clab .

This definition is equivalent to df-sb when a setvar is substituted for the class, since, as soon as, ax6ev is posited, all variables "exist". (Contributed by BJ, 19-Feb-2026)

Ref Expression
Assertion bj-df-sb ( [ 𝐴 / 𝑥 ] 𝜑 ↔ ∃ 𝑦 ( 𝑦 = 𝐴 ∧ ∀ 𝑥 ( 𝑥 = 𝑦 → 𝜑 ) ) )

Proof

Step Hyp Ref Expression
1 sbc7 ⊢ ( [ 𝐴 / 𝑥 ] 𝜑 ↔ ∃ 𝑦 ( 𝑦 = 𝐴 ∧ [ 𝑦 / 𝑥 ] 𝜑 ) )
2 sbsbc ⊢ ( [ 𝑦 / 𝑥 ] 𝜑 ↔ [ 𝑦 / 𝑥 ] 𝜑 )
3 sb6 ⊢ ( [ 𝑦 / 𝑥 ] 𝜑 ↔ ∀ 𝑥 ( 𝑥 = 𝑦 → 𝜑 ) )
4 2 3 bitr3i ⊢ ( [ 𝑦 / 𝑥 ] 𝜑 ↔ ∀ 𝑥 ( 𝑥 = 𝑦 → 𝜑 ) )
5 4 anbi2i ⊢ ( ( 𝑦 = 𝐴 ∧ [ 𝑦 / 𝑥 ] 𝜑 ) ↔ ( 𝑦 = 𝐴 ∧ ∀ 𝑥 ( 𝑥 = 𝑦 → 𝜑 ) ) )
6 5 exbii ⊢ ( ∃ 𝑦 ( 𝑦 = 𝐴 ∧ [ 𝑦 / 𝑥 ] 𝜑 ) ↔ ∃ 𝑦 ( 𝑦 = 𝐴 ∧ ∀ 𝑥 ( 𝑥 = 𝑦 → 𝜑 ) ) )
7 1 6 bitri ⊢ ( [ 𝐴 / 𝑥 ] 𝜑 ↔ ∃ 𝑦 ( 𝑦 = 𝐴 ∧ ∀ 𝑥 ( 𝑥 = 𝑦 → 𝜑 ) ) )