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

Theorem predpoirr 6287
Description: Given a partial ordering, a class is not a member of its predecessor class. (Contributed by Scott Fenton, 17-Apr-2011.)
Assertion
Ref Expression
predpoirr (𝑅 Po 𝐴 → ¬ 𝑋 ∈ Pred(𝑅, 𝐴, 𝑋))

Proof of Theorem predpoirr
StepHypRef Expression
1 poirr 5540 . . . . 5 ((𝑅 Po 𝐴𝑋𝐴) → ¬ 𝑋𝑅𝑋)
2 elpredg 6269 . . . . . . 7 ((𝑋𝐴𝑋𝐴) → (𝑋 ∈ Pred(𝑅, 𝐴, 𝑋) ↔ 𝑋𝑅𝑋))
32anidms 572 . . . . . 6 (𝑋𝐴 → (𝑋 ∈ Pred(𝑅, 𝐴, 𝑋) ↔ 𝑋𝑅𝑋))
43notbid 320 . . . . 5 (𝑋𝐴 → (¬ 𝑋 ∈ Pred(𝑅, 𝐴, 𝑋) ↔ ¬ 𝑋𝑅𝑋))
51, 4imbitrrid 248 . . . 4 (𝑋𝐴 → ((𝑅 Po 𝐴𝑋𝐴) → ¬ 𝑋 ∈ Pred(𝑅, 𝐴, 𝑋)))
65expd 417 . . 3 (𝑋𝐴 → (𝑅 Po 𝐴 → (𝑋𝐴 → ¬ 𝑋 ∈ Pred(𝑅, 𝐴, 𝑋))))
76pm2.43b 55 . 2 (𝑅 Po 𝐴 → (𝑋𝐴 → ¬ 𝑋 ∈ Pred(𝑅, 𝐴, 𝑋)))
8 predel 6275 . . 3 (𝑋 ∈ Pred(𝑅, 𝐴, 𝑋) → 𝑋𝐴)
98con3i 154 . 2 𝑋𝐴 → ¬ 𝑋 ∈ Pred(𝑅, 𝐴, 𝑋))
107, 9pm2.61d1 181 1 (𝑅 Po 𝐴 → ¬ 𝑋 ∈ Pred(𝑅, 𝐴, 𝑋))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 208  wa 397  wcel 2121   class class class wbr 5074   Po wpo 5526  Predcpred 6254
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1975  ax-7 2016  ax-8 2123  ax-9 2131  ax-ext 2713  ax-sep 5220  ax-pr 5364
This theorem depends on definitions:  df-bi 209  df-an 398  df-or 855  df-3an 1095  df-tru 1551  df-fal 1561  df-ex 1788  df-sb 2075  df-clab 2720  df-cleq 2733  df-clel 2816  df-ral 3056  df-rex 3066  df-rab 3394  df-v 3435  df-dif 3887  df-un 3889  df-in 3891  df-ss 3901  df-nul 4264  df-if 4457  df-sn 4558  df-pr 4560  df-op 4564  df-br 5075  df-opab 5137  df-po 5528  df-xp 5626  df-cnv 5628  df-dm 5630  df-rn 5631  df-res 5632  df-ima 5633  df-pred 6255
This theorem is referenced by:  xpord2indlem  8089  xpord3inddlem  8096
  Copyright terms: Public domain W3C validator