Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  swoer Structured version   Visualization version   GIF version

Theorem swoer 7817
 Description: Incomparability under a strict weak partial order is an equivalence relation. (Contributed by Mario Carneiro, 9-Jul-2014.) (Revised by Mario Carneiro, 12-Aug-2015.)
Hypotheses
Ref Expression
swoer.1 𝑅 = ((𝑋 × 𝑋) ∖ ( < < ))
swoer.2 ((𝜑 ∧ (𝑦𝑋𝑧𝑋)) → (𝑦 < 𝑧 → ¬ 𝑧 < 𝑦))
swoer.3 ((𝜑 ∧ (𝑥𝑋𝑦𝑋𝑧𝑋)) → (𝑥 < 𝑦 → (𝑥 < 𝑧𝑧 < 𝑦)))
Assertion
Ref Expression
swoer (𝜑𝑅 Er 𝑋)
Distinct variable groups:   𝑥,𝑦,𝑧, <   𝜑,𝑥,𝑦,𝑧   𝑥,𝑋,𝑦,𝑧
Allowed substitution hints:   𝑅(𝑥,𝑦,𝑧)

Proof of Theorem swoer
Dummy variables 𝑣 𝑢 𝑤 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 swoer.1 . . . . 5 𝑅 = ((𝑋 × 𝑋) ∖ ( < < ))
2 difss 3770 . . . . 5 ((𝑋 × 𝑋) ∖ ( < < )) ⊆ (𝑋 × 𝑋)
31, 2eqsstri 3668 . . . 4 𝑅 ⊆ (𝑋 × 𝑋)
4 relxp 5160 . . . 4 Rel (𝑋 × 𝑋)
5 relss 5240 . . . 4 (𝑅 ⊆ (𝑋 × 𝑋) → (Rel (𝑋 × 𝑋) → Rel 𝑅))
63, 4, 5mp2 9 . . 3 Rel 𝑅
76a1i 11 . 2 (𝜑 → Rel 𝑅)
8 simpr 476 . . 3 ((𝜑𝑢𝑅𝑣) → 𝑢𝑅𝑣)
9 orcom 401 . . . . . 6 ((𝑢 < 𝑣𝑣 < 𝑢) ↔ (𝑣 < 𝑢𝑢 < 𝑣))
109a1i 11 . . . . 5 ((𝜑𝑢𝑅𝑣) → ((𝑢 < 𝑣𝑣 < 𝑢) ↔ (𝑣 < 𝑢𝑢 < 𝑣)))
1110notbid 307 . . . 4 ((𝜑𝑢𝑅𝑣) → (¬ (𝑢 < 𝑣𝑣 < 𝑢) ↔ ¬ (𝑣 < 𝑢𝑢 < 𝑣)))
123ssbri 4730 . . . . . . 7 (𝑢𝑅𝑣𝑢(𝑋 × 𝑋)𝑣)
1312adantl 481 . . . . . 6 ((𝜑𝑢𝑅𝑣) → 𝑢(𝑋 × 𝑋)𝑣)
14 brxp 5181 . . . . . 6 (𝑢(𝑋 × 𝑋)𝑣 ↔ (𝑢𝑋𝑣𝑋))
1513, 14sylib 208 . . . . 5 ((𝜑𝑢𝑅𝑣) → (𝑢𝑋𝑣𝑋))
161brdifun 7816 . . . . 5 ((𝑢𝑋𝑣𝑋) → (𝑢𝑅𝑣 ↔ ¬ (𝑢 < 𝑣𝑣 < 𝑢)))
1715, 16syl 17 . . . 4 ((𝜑𝑢𝑅𝑣) → (𝑢𝑅𝑣 ↔ ¬ (𝑢 < 𝑣𝑣 < 𝑢)))
1815simprd 478 . . . . 5 ((𝜑𝑢𝑅𝑣) → 𝑣𝑋)
1915simpld 474 . . . . 5 ((𝜑𝑢𝑅𝑣) → 𝑢𝑋)
201brdifun 7816 . . . . 5 ((𝑣𝑋𝑢𝑋) → (𝑣𝑅𝑢 ↔ ¬ (𝑣 < 𝑢𝑢 < 𝑣)))
2118, 19, 20syl2anc 694 . . . 4 ((𝜑𝑢𝑅𝑣) → (𝑣𝑅𝑢 ↔ ¬ (𝑣 < 𝑢𝑢 < 𝑣)))
2211, 17, 213bitr4d 300 . . 3 ((𝜑𝑢𝑅𝑣) → (𝑢𝑅𝑣𝑣𝑅𝑢))
238, 22mpbid 222 . 2 ((𝜑𝑢𝑅𝑣) → 𝑣𝑅𝑢)
24 simprl 809 . . . . 5 ((𝜑 ∧ (𝑢𝑅𝑣𝑣𝑅𝑤)) → 𝑢𝑅𝑣)
2512ad2antrl 764 . . . . . . 7 ((𝜑 ∧ (𝑢𝑅𝑣𝑣𝑅𝑤)) → 𝑢(𝑋 × 𝑋)𝑣)
2614simplbi 475 . . . . . . 7 (𝑢(𝑋 × 𝑋)𝑣𝑢𝑋)
2725, 26syl 17 . . . . . 6 ((𝜑 ∧ (𝑢𝑅𝑣𝑣𝑅𝑤)) → 𝑢𝑋)
2814simprbi 479 . . . . . . 7 (𝑢(𝑋 × 𝑋)𝑣𝑣𝑋)
2925, 28syl 17 . . . . . 6 ((𝜑 ∧ (𝑢𝑅𝑣𝑣𝑅𝑤)) → 𝑣𝑋)
3027, 29, 16syl2anc 694 . . . . 5 ((𝜑 ∧ (𝑢𝑅𝑣𝑣𝑅𝑤)) → (𝑢𝑅𝑣 ↔ ¬ (𝑢 < 𝑣𝑣 < 𝑢)))
3124, 30mpbid 222 . . . 4 ((𝜑 ∧ (𝑢𝑅𝑣𝑣𝑅𝑤)) → ¬ (𝑢 < 𝑣𝑣 < 𝑢))
32 simprr 811 . . . . 5 ((𝜑 ∧ (𝑢𝑅𝑣𝑣𝑅𝑤)) → 𝑣𝑅𝑤)
333brel 5202 . . . . . . . 8 (𝑣𝑅𝑤 → (𝑣𝑋𝑤𝑋))
3433simprd 478 . . . . . . 7 (𝑣𝑅𝑤𝑤𝑋)
3532, 34syl 17 . . . . . 6 ((𝜑 ∧ (𝑢𝑅𝑣𝑣𝑅𝑤)) → 𝑤𝑋)
361brdifun 7816 . . . . . 6 ((𝑣𝑋𝑤𝑋) → (𝑣𝑅𝑤 ↔ ¬ (𝑣 < 𝑤𝑤 < 𝑣)))
3729, 35, 36syl2anc 694 . . . . 5 ((𝜑 ∧ (𝑢𝑅𝑣𝑣𝑅𝑤)) → (𝑣𝑅𝑤 ↔ ¬ (𝑣 < 𝑤𝑤 < 𝑣)))
3832, 37mpbid 222 . . . 4 ((𝜑 ∧ (𝑢𝑅𝑣𝑣𝑅𝑤)) → ¬ (𝑣 < 𝑤𝑤 < 𝑣))
39 simpl 472 . . . . . . 7 ((𝜑 ∧ (𝑢𝑅𝑣𝑣𝑅𝑤)) → 𝜑)
40 swoer.3 . . . . . . . 8 ((𝜑 ∧ (𝑥𝑋𝑦𝑋𝑧𝑋)) → (𝑥 < 𝑦 → (𝑥 < 𝑧𝑧 < 𝑦)))
4140swopolem 5073 . . . . . . 7 ((𝜑 ∧ (𝑢𝑋𝑤𝑋𝑣𝑋)) → (𝑢 < 𝑤 → (𝑢 < 𝑣𝑣 < 𝑤)))
4239, 27, 35, 29, 41syl13anc 1368 . . . . . 6 ((𝜑 ∧ (𝑢𝑅𝑣𝑣𝑅𝑤)) → (𝑢 < 𝑤 → (𝑢 < 𝑣𝑣 < 𝑤)))
4340swopolem 5073 . . . . . . . 8 ((𝜑 ∧ (𝑤𝑋𝑢𝑋𝑣𝑋)) → (𝑤 < 𝑢 → (𝑤 < 𝑣𝑣 < 𝑢)))
4439, 35, 27, 29, 43syl13anc 1368 . . . . . . 7 ((𝜑 ∧ (𝑢𝑅𝑣𝑣𝑅𝑤)) → (𝑤 < 𝑢 → (𝑤 < 𝑣𝑣 < 𝑢)))
45 orcom 401 . . . . . . 7 ((𝑣 < 𝑢𝑤 < 𝑣) ↔ (𝑤 < 𝑣𝑣 < 𝑢))
4644, 45syl6ibr 242 . . . . . 6 ((𝜑 ∧ (𝑢𝑅𝑣𝑣𝑅𝑤)) → (𝑤 < 𝑢 → (𝑣 < 𝑢𝑤 < 𝑣)))
4742, 46orim12d 901 . . . . 5 ((𝜑 ∧ (𝑢𝑅𝑣𝑣𝑅𝑤)) → ((𝑢 < 𝑤𝑤 < 𝑢) → ((𝑢 < 𝑣𝑣 < 𝑤) ∨ (𝑣 < 𝑢𝑤 < 𝑣))))
48 or4 549 . . . . 5 (((𝑢 < 𝑣𝑣 < 𝑤) ∨ (𝑣 < 𝑢𝑤 < 𝑣)) ↔ ((𝑢 < 𝑣𝑣 < 𝑢) ∨ (𝑣 < 𝑤𝑤 < 𝑣)))
4947, 48syl6ib 241 . . . 4 ((𝜑 ∧ (𝑢𝑅𝑣𝑣𝑅𝑤)) → ((𝑢 < 𝑤𝑤 < 𝑢) → ((𝑢 < 𝑣𝑣 < 𝑢) ∨ (𝑣 < 𝑤𝑤 < 𝑣))))
5031, 38, 49mtord 693 . . 3 ((𝜑 ∧ (𝑢𝑅𝑣𝑣𝑅𝑤)) → ¬ (𝑢 < 𝑤𝑤 < 𝑢))
511brdifun 7816 . . . 4 ((𝑢𝑋𝑤𝑋) → (𝑢𝑅𝑤 ↔ ¬ (𝑢 < 𝑤𝑤 < 𝑢)))
5227, 35, 51syl2anc 694 . . 3 ((𝜑 ∧ (𝑢𝑅𝑣𝑣𝑅𝑤)) → (𝑢𝑅𝑤 ↔ ¬ (𝑢 < 𝑤𝑤 < 𝑢)))
5350, 52mpbird 247 . 2 ((𝜑 ∧ (𝑢𝑅𝑣𝑣𝑅𝑤)) → 𝑢𝑅𝑤)
54 swoer.2 . . . . . . 7 ((𝜑 ∧ (𝑦𝑋𝑧𝑋)) → (𝑦 < 𝑧 → ¬ 𝑧 < 𝑦))
5554, 40swopo 5074 . . . . . 6 (𝜑< Po 𝑋)
56 poirr 5075 . . . . . 6 (( < Po 𝑋𝑢𝑋) → ¬ 𝑢 < 𝑢)
5755, 56sylan 487 . . . . 5 ((𝜑𝑢𝑋) → ¬ 𝑢 < 𝑢)
58 pm1.2 534 . . . . 5 ((𝑢 < 𝑢𝑢 < 𝑢) → 𝑢 < 𝑢)
5957, 58nsyl 135 . . . 4 ((𝜑𝑢𝑋) → ¬ (𝑢 < 𝑢𝑢 < 𝑢))
60 simpr 476 . . . . 5 ((𝜑𝑢𝑋) → 𝑢𝑋)
611brdifun 7816 . . . . 5 ((𝑢𝑋𝑢𝑋) → (𝑢𝑅𝑢 ↔ ¬ (𝑢 < 𝑢𝑢 < 𝑢)))
6260, 60, 61syl2anc 694 . . . 4 ((𝜑𝑢𝑋) → (𝑢𝑅𝑢 ↔ ¬ (𝑢 < 𝑢𝑢 < 𝑢)))
6359, 62mpbird 247 . . 3 ((𝜑𝑢𝑋) → 𝑢𝑅𝑢)
643ssbri 4730 . . . . 5 (𝑢𝑅𝑢𝑢(𝑋 × 𝑋)𝑢)
65 brxp 5181 . . . . . 6 (𝑢(𝑋 × 𝑋)𝑢 ↔ (𝑢𝑋𝑢𝑋))
6665simplbi 475 . . . . 5 (𝑢(𝑋 × 𝑋)𝑢𝑢𝑋)
6764, 66syl 17 . . . 4 (𝑢𝑅𝑢𝑢𝑋)
6867adantl 481 . . 3 ((𝜑𝑢𝑅𝑢) → 𝑢𝑋)
6963, 68impbida 895 . 2 (𝜑 → (𝑢𝑋𝑢𝑅𝑢))
707, 23, 53, 69iserd 7813 1 (𝜑𝑅 Er 𝑋)
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 196   ∨ wo 382   ∧ wa 383   ∧ w3a 1054   = wceq 1523   ∈ wcel 2030   ∖ cdif 3604   ∪ cun 3605   ⊆ wss 3607   class class class wbr 4685   Po wpo 5062   × cxp 5141  ◡ccnv 5142  Rel wrel 5148   Er wer 7784 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981  ax-9 2039  ax-10 2059  ax-11 2074  ax-12 2087  ax-13 2282  ax-ext 2631  ax-sep 4814  ax-nul 4822  ax-pr 4936 This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3an 1056  df-tru 1526  df-ex 1745  df-nf 1750  df-sb 1938  df-eu 2502  df-mo 2503  df-clab 2638  df-cleq 2644  df-clel 2647  df-nfc 2782  df-ral 2946  df-rex 2947  df-rab 2950  df-v 3233  df-dif 3610  df-un 3612  df-in 3614  df-ss 3621  df-nul 3949  df-if 4120  df-sn 4211  df-pr 4213  df-op 4217  df-br 4686  df-opab 4746  df-po 5064  df-xp 5149  df-rel 5150  df-cnv 5151  df-co 5152  df-dm 5153  df-er 7787 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator