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

Theorem predpoirr 6236
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 5515 . . . . 5 ((𝑅 Po 𝐴𝑋𝐴) → ¬ 𝑋𝑅𝑋)
2 elpredg 6216 . . . . . . 7 ((𝑋𝐴𝑋𝐴) → (𝑋 ∈ Pred(𝑅, 𝐴, 𝑋) ↔ 𝑋𝑅𝑋))
32anidms 567 . . . . . 6 (𝑋𝐴 → (𝑋 ∈ Pred(𝑅, 𝐴, 𝑋) ↔ 𝑋𝑅𝑋))
43notbid 318 . . . . 5 (𝑋𝐴 → (¬ 𝑋 ∈ Pred(𝑅, 𝐴, 𝑋) ↔ ¬ 𝑋𝑅𝑋))
51, 4syl5ibr 245 . . . 4 (𝑋𝐴 → ((𝑅 Po 𝐴𝑋𝐴) → ¬ 𝑋 ∈ Pred(𝑅, 𝐴, 𝑋)))
65expd 416 . . 3 (𝑋𝐴 → (𝑅 Po 𝐴 → (𝑋𝐴 → ¬ 𝑋 ∈ Pred(𝑅, 𝐴, 𝑋))))
76pm2.43b 55 . 2 (𝑅 Po 𝐴 → (𝑋𝐴 → ¬ 𝑋 ∈ Pred(𝑅, 𝐴, 𝑋)))
8 predel 6223 . . 3 (𝑋 ∈ Pred(𝑅, 𝐴, 𝑋) → 𝑋𝐴)
98con3i 154 . 2 𝑋𝐴 → ¬ 𝑋 ∈ Pred(𝑅, 𝐴, 𝑋))
107, 9pm2.61d1 180 1 (𝑅 Po 𝐴 → ¬ 𝑋 ∈ Pred(𝑅, 𝐴, 𝑋))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 205  wa 396  wcel 2106   class class class wbr 5074   Po wpo 5501  Predcpred 6201
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pr 5352
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-sb 2068  df-clab 2716  df-cleq 2730  df-clel 2816  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-dif 3890  df-un 3892  df-in 3894  df-nul 4257  df-if 4460  df-sn 4562  df-pr 4564  df-op 4568  df-br 5075  df-opab 5137  df-po 5503  df-xp 5595  df-cnv 5597  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-pred 6202
This theorem is referenced by:  xpord2ind  33794  xpord3ind  33800
  Copyright terms: Public domain W3C validator