Metamath Proof Explorer


Theorem sltssepcd

Description: Two elements of separated sets obey less-than. Deduction form of sltssepc . (Contributed by Scott Fenton, 25-Sep-2024)

Ref Expression
Hypotheses sltssepcd.1 ⊢ φ → A ≪ s B
sltssepcd.2 ⊢ φ → X ∈ A
sltssepcd.3 ⊢ φ → Y ∈ B
Assertion sltssepcd ⊢ φ → X < s Y

Proof

Step Hyp Ref Expression
1 sltssepcd.1 ⊢ φ → A ≪ s B
2 sltssepcd.2 ⊢ φ → X ∈ A
3 sltssepcd.3 ⊢ φ → Y ∈ B
4 sltssepc ⊢ A ≪ s B ∧ X ∈ A ∧ Y ∈ B → X < s Y
5 1 2 3 4 syl3anc ⊢ φ → X < s Y