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

Theorem predso 5842
Description: Property of the predecessor class for strict orderings. (Contributed by Scott Fenton, 11-Feb-2011.)
Assertion
Ref Expression
predso ((𝑅 Or 𝐴𝑋𝐴) → (𝑌 ∈ Pred(𝑅, 𝐴, 𝑋) → Pred(𝑅, 𝐴, 𝑌) ⊆ Pred(𝑅, 𝐴, 𝑋)))

Proof of Theorem predso
StepHypRef Expression
1 sopo 5187 . 2 (𝑅 Or 𝐴𝑅 Po 𝐴)
2 predpo 5841 . 2 ((𝑅 Po 𝐴𝑋𝐴) → (𝑌 ∈ Pred(𝑅, 𝐴, 𝑋) → Pred(𝑅, 𝐴, 𝑌) ⊆ Pred(𝑅, 𝐴, 𝑋)))
31, 2sylan 569 1 ((𝑅 Or 𝐴𝑋𝐴) → (𝑌 ∈ Pred(𝑅, 𝐴, 𝑋) → Pred(𝑅, 𝐴, 𝑌) ⊆ Pred(𝑅, 𝐴, 𝑋)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 382  wcel 2145  wss 3723   Po wpo 5168   Or wor 5169  Predcpred 5822
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1870  ax-4 1885  ax-5 1991  ax-6 2057  ax-7 2093  ax-9 2154  ax-10 2174  ax-11 2190  ax-12 2203  ax-13 2408  ax-ext 2751  ax-sep 4915  ax-nul 4923  ax-pr 5034
This theorem depends on definitions:  df-bi 197  df-an 383  df-or 835  df-3an 1073  df-tru 1634  df-ex 1853  df-nf 1858  df-sb 2050  df-eu 2622  df-mo 2623  df-clab 2758  df-cleq 2764  df-clel 2767  df-nfc 2902  df-ral 3066  df-rex 3067  df-rab 3070  df-v 3353  df-sbc 3588  df-dif 3726  df-un 3728  df-in 3730  df-ss 3737  df-nul 4064  df-if 4226  df-sn 4317  df-pr 4319  df-op 4323  df-br 4787  df-opab 4847  df-po 5170  df-so 5171  df-xp 5255  df-cnv 5257  df-dm 5259  df-rn 5260  df-res 5261  df-ima 5262  df-pred 5823
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator