MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  ordn2lp Structured version   Unicode version

Theorem ordn2lp 4898
Description: An ordinal class cannot an element of one of its members. Variant of first part of Theorem 2.2(vii) of [BellMachover] p. 469. (Contributed by NM, 3-Apr-1994.)
Assertion
Ref Expression
ordn2lp  |-  ( Ord 
A  ->  -.  ( A  e.  B  /\  B  e.  A )
)

Proof of Theorem ordn2lp
StepHypRef Expression
1 ordirr 4896 . 2  |-  ( Ord 
A  ->  -.  A  e.  A )
2 ordtr 4892 . . 3  |-  ( Ord 
A  ->  Tr  A
)
3 trel 4547 . . 3  |-  ( Tr  A  ->  ( ( A  e.  B  /\  B  e.  A )  ->  A  e.  A ) )
42, 3syl 16 . 2  |-  ( Ord 
A  ->  ( ( A  e.  B  /\  B  e.  A )  ->  A  e.  A ) )
51, 4mtod 177 1  |-  ( Ord 
A  ->  -.  ( A  e.  B  /\  B  e.  A )
)
Colors of variables: wff setvar class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 369    e. wcel 1767   Tr wtr 4540   Ord word 4877
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1601  ax-4 1612  ax-5 1680  ax-6 1719  ax-7 1739  ax-9 1771  ax-10 1786  ax-11 1791  ax-12 1803  ax-13 1968  ax-ext 2445  ax-sep 4568  ax-nul 4576  ax-pr 4686
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 975  df-tru 1382  df-ex 1597  df-nf 1600  df-sb 1712  df-eu 2279  df-mo 2280  df-clab 2453  df-cleq 2459  df-clel 2462  df-nfc 2617  df-ne 2664  df-ral 2819  df-rex 2820  df-rab 2823  df-v 3115  df-sbc 3332  df-dif 3479  df-un 3481  df-in 3483  df-ss 3490  df-nul 3786  df-if 3940  df-sn 4028  df-pr 4030  df-op 4034  df-uni 4246  df-br 4448  df-opab 4506  df-tr 4541  df-eprel 4791  df-fr 4838  df-we 4840  df-ord 4881
This theorem is referenced by:  ordtri1  4911  ordnbtwn  4968  suc11  4981  smoord  7037  unblem1  7773  cantnfp1lem3  8100  cantnfp1lem3OLD  8126  cardprclem  8361
  Copyright terms: Public domain W3C validator