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

Theorem onnmin 6895
Description: No member of a set of ordinal numbers belongs to its minimum. (Contributed by NM, 2-Feb-1997.)
Assertion
Ref Expression
onnmin ((𝐴 ⊆ On ∧ 𝐵𝐴) → ¬ 𝐵 𝐴)

Proof of Theorem onnmin
StepHypRef Expression
1 intss1 4427 . . 3 (𝐵𝐴 𝐴𝐵)
21adantl 481 . 2 ((𝐴 ⊆ On ∧ 𝐵𝐴) → 𝐴𝐵)
3 ne0i 3880 . . . 4 (𝐵𝐴𝐴 ≠ ∅)
4 oninton 6892 . . . 4 ((𝐴 ⊆ On ∧ 𝐴 ≠ ∅) → 𝐴 ∈ On)
53, 4sylan2 490 . . 3 ((𝐴 ⊆ On ∧ 𝐵𝐴) → 𝐴 ∈ On)
6 ssel2 3563 . . 3 ((𝐴 ⊆ On ∧ 𝐵𝐴) → 𝐵 ∈ On)
7 ontri1 5674 . . 3 (( 𝐴 ∈ On ∧ 𝐵 ∈ On) → ( 𝐴𝐵 ↔ ¬ 𝐵 𝐴))
85, 6, 7syl2anc 691 . 2 ((𝐴 ⊆ On ∧ 𝐵𝐴) → ( 𝐴𝐵 ↔ ¬ 𝐵 𝐴))
92, 8mpbid 221 1 ((𝐴 ⊆ On ∧ 𝐵𝐴) → ¬ 𝐵 𝐴)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 195  wa 383  wcel 1977  wne 2780  wss 3540  c0 3874   cint 4410  Oncon0 5640
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pr 4833  ax-un 6847
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-sbc 3403  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-pss 3556  df-nul 3875  df-if 4037  df-sn 4126  df-pr 4128  df-tp 4130  df-op 4132  df-uni 4373  df-int 4411  df-br 4584  df-opab 4644  df-tr 4681  df-eprel 4949  df-po 4959  df-so 4960  df-fr 4997  df-we 4999  df-ord 5643  df-on 5644
This theorem is referenced by:  onnminsb  6896  oneqmin  6897  onmindif2  6904  cardmin2  8707  ackbij1lem18  8942  cofsmo  8974  fin23lem26  9030  nofulllem5  31105
  Copyright terms: Public domain W3C validator