HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem onnmin 3015
Description: No member of a set of ordinal numbers belongs to its minimum.
Assertion
Ref Expression
onnmin |- ((A (_ On /\ B e. A) -> -. B e. |^|A)

Proof of Theorem onnmin
StepHypRef Expression
1 intss1 2548 . . 3 |- (B e. A -> |^|A (_ B)
21adantl 388 . 2 |- ((A (_ On /\ B e. A) -> |^|A (_ B)
3 ontri1 2981 . . 3 |- ((|^|A e. On /\ B e. On) -> (|^|A (_ B <-> -. B e. |^|A))
4 oninton 3012 . . . 4 |- ((A (_ On /\ A =/= (/)) -> |^|A e. On)
5 ne0i 2286 . . . 4 |- (B e. A -> A =/= (/))
64, 5sylan2 451 . . 3 |- ((A (_ On /\ B e. A) -> |^|A e. On)
7 ssel2 2064 . . 3 |- ((A (_ On /\ B e. A) -> B e. On)
83, 6, 7sylanc 471 . 2 |- ((A (_ On /\ B e. A) -> (|^|A (_ B <-> -. B e. |^|A))
92, 8mpbid 195 1 |- ((A (_ On /\ B e. A) -> -. B e. |^|A)
Colors of variables: wff set class
Syntax hints:  -. wn 2   -> wi 3   <-> wb 146   /\ wa 223   e. wcel 958   =/= wne 1585   (_ wss 2047  (/)c0 2280  |^|cint 2533  Oncon0 2948
This theorem is referenced by:  onnminsb 3016  oneqmin 3018  onminex 3020  onmindif2 3061  cardmin 4860
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 962  ax-gen 963  ax-8 964  ax-10 966  ax-11 967  ax-12 968  ax-13 969  ax-14 970  ax-17 971  ax-4 973  ax-5o 975  ax-6o 978  ax-9o 1123  ax-10o 1140  ax-16 1210  ax-11o 1218  ax-ext 1459  ax-sep 2703  ax-pow 2742  ax-pr 2779  ax-un 2866
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-3or 776  df-3an 777  df-ex 981  df-sb 1172  df-eu 1382  df-mo 1383  df-clab 1464  df-cleq 1469  df-clel 1472  df-ne 1587  df-ral 1649  df-rex 1650  df-v 1812  df-dif 2049  df-un 2050  df-in 2051  df-ss 2053  df-nul 2281  df-pw 2402  df-sn 2412  df-pr 2413  df-tp 2415  df-op 2416  df-uni 2504  df-int 2534  df-br 2620  df-opab 2667  df-tr 2681  df-eprel 2832  df-po 2840  df-so 2850  df-fr 2917  df-we 2934  df-ord 2951  df-on 2952
Copyright terms: Public domain