Metamath Proof Explorer


Theorem swoord1

Description: The incomparability equivalence relation is compatible with the original order. (Contributed by Mario Carneiro, 31-Dec-2014)

Ref Expression
Hypotheses swoer.1 ⊢ R = X × X ∖ < ˙ ∪ < ˙ -1
swoer.2 ⊢ φ ∧ y ∈ X ∧ z ∈ X → y < ˙ z → ¬ z < ˙ y
swoer.3 ⊢ φ ∧ x ∈ X ∧ y ∈ X ∧ z ∈ X → x < ˙ y → x < ˙ z ∨ z < ˙ y
swoord.4 ⊢ φ → B ∈ X
swoord.5 ⊢ φ → C ∈ X
swoord.6 ⊢ φ → A R B
Assertion swoord1 ⊢ φ → A < ˙ C ↔ B < ˙ C

Proof

Step Hyp Ref Expression
1 swoer.1 ⊢ R = X × X ∖ < ˙ ∪ < ˙ -1
2 swoer.2 ⊢ φ ∧ y ∈ X ∧ z ∈ X → y < ˙ z → ¬ z < ˙ y
3 swoer.3 ⊢ φ ∧ x ∈ X ∧ y ∈ X ∧ z ∈ X → x < ˙ y → x < ˙ z ∨ z < ˙ y
4 swoord.4 ⊢ φ → B ∈ X
5 swoord.5 ⊢ φ → C ∈ X
6 swoord.6 ⊢ φ → A R B
7 id ⊢ φ → φ
8 difss ⊢ X × X ∖ < ˙ ∪ < ˙ -1 ⊆ X × X
9 1 8 eqsstri ⊢ R ⊆ X × X
10 9 ssbri ⊢ A R B → A X × X B
11 df-br ⊢ A X × X B ↔ A B ∈ X × X
12 opelxp1 ⊢ A B ∈ X × X → A ∈ X
13 11 12 sylbi ⊢ A X × X B → A ∈ X
14 6 10 13 3syl ⊢ φ → A ∈ X
15 3 swopolem ⊢ φ ∧ A ∈ X ∧ C ∈ X ∧ B ∈ X → A < ˙ C → A < ˙ B ∨ B < ˙ C
16 7 14 5 4 15 syl13anc ⊢ φ → A < ˙ C → A < ˙ B ∨ B < ˙ C
17 1 brdifun ⊢ A ∈ X ∧ B ∈ X → A R B ↔ ¬ A < ˙ B ∨ B < ˙ A
18 14 4 17 syl2anc ⊢ φ → A R B ↔ ¬ A < ˙ B ∨ B < ˙ A
19 6 18 mpbid ⊢ φ → ¬ A < ˙ B ∨ B < ˙ A
20 orc ⊢ A < ˙ B → A < ˙ B ∨ B < ˙ A
21 19 20 nsyl ⊢ φ → ¬ A < ˙ B
22 biorf ⊢ ¬ A < ˙ B → B < ˙ C ↔ A < ˙ B ∨ B < ˙ C
23 21 22 syl ⊢ φ → B < ˙ C ↔ A < ˙ B ∨ B < ˙ C
24 16 23 sylibrd ⊢ φ → A < ˙ C → B < ˙ C
25 3 swopolem ⊢ φ ∧ B ∈ X ∧ C ∈ X ∧ A ∈ X → B < ˙ C → B < ˙ A ∨ A < ˙ C
26 7 4 5 14 25 syl13anc ⊢ φ → B < ˙ C → B < ˙ A ∨ A < ˙ C
27 olc ⊢ B < ˙ A → A < ˙ B ∨ B < ˙ A
28 19 27 nsyl ⊢ φ → ¬ B < ˙ A
29 biorf ⊢ ¬ B < ˙ A → A < ˙ C ↔ B < ˙ A ∨ A < ˙ C
30 28 29 syl ⊢ φ → A < ˙ C ↔ B < ˙ A ∨ A < ˙ C
31 26 30 sylibrd ⊢ φ → B < ˙ C → A < ˙ C
32 24 31 impbid ⊢ φ → A < ˙ C ↔ B < ˙ C