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

Theorem predfrirr 6281
Description: Given a well-founded relation, a class is not a member of its predecessor class. (Contributed by Scott Fenton, 22-Apr-2011.)
Assertion
Ref Expression
predfrirr (𝑅 Fr 𝐴 → ¬ 𝑋 ∈ Pred(𝑅, 𝐴, 𝑋))

Proof of Theorem predfrirr
StepHypRef Expression
1 frirr 5590 . . . . 5 ((𝑅 Fr 𝐴𝑋𝐴) → ¬ 𝑋𝑅𝑋)
2 elpredg 6262 . . . . . . 7 ((𝑋𝐴𝑋𝐴) → (𝑋 ∈ Pred(𝑅, 𝐴, 𝑋) ↔ 𝑋𝑅𝑋))
32anidms 566 . . . . . 6 (𝑋𝐴 → (𝑋 ∈ Pred(𝑅, 𝐴, 𝑋) ↔ 𝑋𝑅𝑋))
43notbid 318 . . . . 5 (𝑋𝐴 → (¬ 𝑋 ∈ Pred(𝑅, 𝐴, 𝑋) ↔ ¬ 𝑋𝑅𝑋))
51, 4imbitrrid 246 . . . 4 (𝑋𝐴 → ((𝑅 Fr 𝐴𝑋𝐴) → ¬ 𝑋 ∈ Pred(𝑅, 𝐴, 𝑋)))
65expd 415 . . 3 (𝑋𝐴 → (𝑅 Fr 𝐴 → (𝑋𝐴 → ¬ 𝑋 ∈ Pred(𝑅, 𝐴, 𝑋))))
76pm2.43b 55 . 2 (𝑅 Fr 𝐴 → (𝑋𝐴 → ¬ 𝑋 ∈ Pred(𝑅, 𝐴, 𝑋)))
8 predel 6268 . . 3 (𝑋 ∈ Pred(𝑅, 𝐴, 𝑋) → 𝑋𝐴)
98con3i 154 . 2 𝑋𝐴 → ¬ 𝑋 ∈ Pred(𝑅, 𝐴, 𝑋))
107, 9pm2.61d1 180 1 (𝑅 Fr 𝐴 → ¬ 𝑋 ∈ Pred(𝑅, 𝐴, 𝑋))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395  wcel 2111   class class class wbr 5089   Fr wfr 5564  Predcpred 6247
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-ext 2703  ax-sep 5232  ax-nul 5242  ax-pr 5368
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2710  df-cleq 2723  df-clel 2806  df-ne 2929  df-ral 3048  df-rex 3057  df-rab 3396  df-v 3438  df-dif 3900  df-un 3902  df-in 3904  df-ss 3914  df-nul 4281  df-if 4473  df-pw 4549  df-sn 4574  df-pr 4576  df-op 4580  df-br 5090  df-opab 5152  df-fr 5567  df-xp 5620  df-cnv 5622  df-dm 5624  df-rn 5625  df-res 5626  df-ima 5627  df-pred 6248
This theorem is referenced by:  frrlem12  8227
  Copyright terms: Public domain W3C validator