ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  onnmin Unicode version

Theorem onnmin 4566
Description: No member of a set of ordinal numbers belongs to its minimum. (Contributed by NM, 2-Feb-1997.) (Constructive proof by Mario Carneiro and Jim Kingdon, 21-Jul-2019.)
Assertion
Ref Expression
onnmin  |-  ( ( A  C_  On  /\  B  e.  A )  ->  -.  B  e.  |^| A )

Proof of Theorem onnmin
StepHypRef Expression
1 intss1 3859 . . 3  |-  ( B  e.  A  ->  |^| A  C_  B )
2 elirr 4539 . . . 4  |-  -.  B  e.  B
3 ssel 3149 . . . 4  |-  ( |^| A  C_  B  ->  ( B  e.  |^| A  ->  B  e.  B )
)
42, 3mtoi 664 . . 3  |-  ( |^| A  C_  B  ->  -.  B  e.  |^| A )
51, 4syl 14 . 2  |-  ( B  e.  A  ->  -.  B  e.  |^| A )
65adantl 277 1  |-  ( ( A  C_  On  /\  B  e.  A )  ->  -.  B  e.  |^| A )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    e. wcel 2148    C_ wss 3129   |^|cint 3844   Oncon0 4362
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-ext 2159  ax-setind 4535
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-ral 2460  df-v 2739  df-dif 3131  df-in 3135  df-ss 3142  df-sn 3598  df-int 3845
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator