Metamath Proof Explorer


Theorem nla0001

Description: Extending a linear order to subsets, the empty set is less than itself. Note in Alling, p. 3. (Contributed by RP, 28-Nov-2023)

Ref Expression
Hypothesis nla0001.defslts ⊢ < ˙ = a b | a ⊆ S ∧ b ⊆ S ∧ ∀ x ∈ a ∀ y ∈ b x R y
Assertion nla0001 ⊢ φ → ∅ < ˙ ∅

Proof

Step Hyp Ref Expression
1 nla0001.defslts ⊢ < ˙ = a b | a ⊆ S ∧ b ⊆ S ∧ ∀ x ∈ a ∀ y ∈ b x R y
2 0ex ⊢ ∅ ∈ V
3 2 a1i ⊢ φ → ∅ ∈ V
4 0ss ⊢ ∅ ⊆ S
5 4 a1i ⊢ φ → ∅ ⊆ S
6 1 3 5 nla0002 ⊢ φ → ∅ < ˙ ∅