Users' Mathboxes Mathbox for Scott Fenton < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  sotrd Structured version   Visualization version   GIF version

Theorem sotrd 35359
Description: Transitivity law for strict orderings, deduction form. (Contributed by Scott Fenton, 24-Nov-2021.)
Hypotheses
Ref Expression
sotrd.1 (𝜑𝑅 Or 𝐴)
sotrd.2 (𝜑𝑋𝐴)
sotrd.3 (𝜑𝑌𝐴)
sotrd.4 (𝜑𝑍𝐴)
sotrd.5 (𝜑𝑋𝑅𝑌)
sotrd.6 (𝜑𝑌𝑅𝑍)
Assertion
Ref Expression
sotrd (𝜑𝑋𝑅𝑍)

Proof of Theorem sotrd
StepHypRef Expression
1 sotrd.5 . 2 (𝜑𝑋𝑅𝑌)
2 sotrd.6 . 2 (𝜑𝑌𝑅𝑍)
3 sotrd.1 . . 3 (𝜑𝑅 Or 𝐴)
4 sotrd.2 . . 3 (𝜑𝑋𝐴)
5 sotrd.3 . . 3 (𝜑𝑌𝐴)
6 sotrd.4 . . 3 (𝜑𝑍𝐴)
7 sotr 5614 . . 3 ((𝑅 Or 𝐴 ∧ (𝑋𝐴𝑌𝐴𝑍𝐴)) → ((𝑋𝑅𝑌𝑌𝑅𝑍) → 𝑋𝑅𝑍))
83, 4, 5, 6, 7syl13anc 1370 . 2 (𝜑 → ((𝑋𝑅𝑌𝑌𝑅𝑍) → 𝑋𝑅𝑍))
91, 2, 8mp2and 698 1 (𝜑𝑋𝑅𝑍)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  wcel 2099   class class class wbr 5148   Or wor 5589
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2101  ax-9 2109  ax-ext 2699
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 847  df-3an 1087  df-tru 1537  df-fal 1547  df-ex 1775  df-sb 2061  df-clab 2706  df-cleq 2720  df-clel 2806  df-ral 3059  df-rab 3430  df-v 3473  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-nul 4324  df-if 4530  df-sn 4630  df-pr 4632  df-op 4636  df-br 5149  df-po 5590  df-so 5591
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator