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

Theorem predfrirr 6150
 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 5505 . . . . 5 ((𝑅 Fr 𝐴𝑋𝐴) → ¬ 𝑋𝑅𝑋)
2 elpredg 6135 . . . . . . 7 ((𝑋𝐴𝑋𝐴) → (𝑋 ∈ Pred(𝑅, 𝐴, 𝑋) ↔ 𝑋𝑅𝑋))
32anidms 570 . . . . . 6 (𝑋𝐴 → (𝑋 ∈ Pred(𝑅, 𝐴, 𝑋) ↔ 𝑋𝑅𝑋))
43notbid 321 . . . . 5 (𝑋𝐴 → (¬ 𝑋 ∈ Pred(𝑅, 𝐴, 𝑋) ↔ ¬ 𝑋𝑅𝑋))
51, 4syl5ibr 249 . . . 4 (𝑋𝐴 → ((𝑅 Fr 𝐴𝑋𝐴) → ¬ 𝑋 ∈ Pred(𝑅, 𝐴, 𝑋)))
65expd 419 . . 3 (𝑋𝐴 → (𝑅 Fr 𝐴 → (𝑋𝐴 → ¬ 𝑋 ∈ Pred(𝑅, 𝐴, 𝑋))))
76pm2.43b 55 . 2 (𝑅 Fr 𝐴 → (𝑋𝐴 → ¬ 𝑋 ∈ Pred(𝑅, 𝐴, 𝑋)))
8 predel 6138 . . 3 (𝑋 ∈ Pred(𝑅, 𝐴, 𝑋) → 𝑋𝐴)
98con3i 157 . 2 𝑋𝐴 → ¬ 𝑋 ∈ Pred(𝑅, 𝐴, 𝑋))
107, 9pm2.61d1 183 1 (𝑅 Fr 𝐴 → ¬ 𝑋 ∈ Pred(𝑅, 𝐴, 𝑋))
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 399   ∈ wcel 2115   class class class wbr 5039   Fr wfr 5484  Predcpred 6120 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1971  ax-7 2016  ax-8 2117  ax-9 2125  ax-10 2146  ax-11 2162  ax-12 2178  ax-ext 2793  ax-sep 5176  ax-nul 5183  ax-pr 5303 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2071  df-mo 2623  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2892  df-nfc 2960  df-ne 3008  df-ral 3131  df-rex 3132  df-rab 3135  df-v 3473  df-sbc 3750  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-nul 4267  df-if 4441  df-sn 4541  df-pr 4543  df-op 4547  df-br 5040  df-opab 5102  df-fr 5487  df-xp 5534  df-cnv 5536  df-dm 5538  df-rn 5539  df-res 5540  df-ima 5541  df-pred 6121 This theorem is referenced by:  wfrlem14  7943  frrlem12  33142
 Copyright terms: Public domain W3C validator