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

Theorem onnmin 2270
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 1979 . . 3 |- (B e. A -> |^|A (_ B)
21adantl 305 . 2 |- ((A (_ On /\ B e. A) -> |^|A (_ B)
3 ontri1 2232 . . 3 |- ((|^|A e. On /\ B e. On) -> (|^|A (_ B <-> -. B e. |^|A))
4 oninton 2267 . . . 4 |- ((A (_ On /\ -. A = (/)) -> |^|A e. On)
5 n0i 1712 . . . 4 |- (B e. A -> -. A = (/))
64, 5sylan2 346 . . 3 |- ((A (_ On /\ B e. A) -> |^|A e. On)
7 ssel2 1503 . . 3 |- ((A (_ On /\ B e. A) -> B e. On)
83, 6, 7sylanc 361 . 2 |- ((A (_ On /\ B e. A) -> (|^|A (_ B <-> -. B e. |^|A))
92, 8mpbid 170 1 |- ((A (_ On /\ B e. A) -> -. B e. |^|A)
Colors of variables: wff set class
Syntax hints:  -. wn 1   -> wi 2   <-> wb 127   /\ wa 196   = wceq 1091   e. wcel 1092   (_ wss 1487  (/)c0 1707  |^|cint 1965  Oncon0 2199
This theorem is referenced by:  onnminsb 2271  oneqmin 2273  onminex 2275  onmindif2 2313  cardmin 3666
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-13 804  ax-14 805  ax-16 922  ax-17 925  ax-ext 1074  ax-rep 1075  ax-un 1076  ax-pow 1077
This theorem depends on definitions:  df-bi 128  df-or 197  df-an 198  df-3or 582  df-3an 583  df-ex 679  df-sb 853  df-clab 1093  df-cleq 1097  df-clel 1099  df-ral 1205  df-rex 1206  df-v 1349  df-dif 1489  df-un 1490  df-in 1491  df-ss 1492  df-nul 1708  df-pw 1799  df-sn 1811  df-pr 1812  df-tp 1814  df-op 1815  df-uni 1920  df-int 1966  df-tr 2042  df-br 2063  df-opab 2098  df-eprel 2122  df-po 2128  df-so 2138  df-fr 2169  df-we 2186  df-ord 2202  df-on 2203
metamath.org