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

Theorem onnmin 7743
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 4918 . . 3 (𝐵𝐴 𝐴𝐵)
21adantl 481 . 2 ((𝐴 ⊆ On ∧ 𝐵𝐴) → 𝐴𝐵)
3 ne0i 4293 . . . 4 (𝐵𝐴𝐴 ≠ ∅)
4 oninton 7740 . . . 4 ((𝐴 ⊆ On ∧ 𝐴 ≠ ∅) → 𝐴 ∈ On)
53, 4sylan2 593 . . 3 ((𝐴 ⊆ On ∧ 𝐵𝐴) → 𝐴 ∈ On)
6 ssel2 3928 . . 3 ((𝐴 ⊆ On ∧ 𝐵𝐴) → 𝐵 ∈ On)
7 ontri1 6351 . . 3 (( 𝐴 ∈ On ∧ 𝐵 ∈ On) → ( 𝐴𝐵 ↔ ¬ 𝐵 𝐴))
85, 6, 7syl2anc 584 . 2 ((𝐴 ⊆ On ∧ 𝐵𝐴) → ( 𝐴𝐵 ↔ ¬ 𝐵 𝐴))
92, 8mpbid 232 1 ((𝐴 ⊆ On ∧ 𝐵𝐴) → ¬ 𝐵 𝐴)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395  wcel 2113  wne 2932  wss 3901  c0 4285   cint 4902  Oncon0 6317
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-ext 2708  ax-sep 5241  ax-nul 5251  ax-pr 5377
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2715  df-cleq 2728  df-clel 2811  df-ne 2933  df-ral 3052  df-rex 3061  df-rab 3400  df-v 3442  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-pss 3921  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-int 4903  df-br 5099  df-opab 5161  df-tr 5206  df-eprel 5524  df-po 5532  df-so 5533  df-fr 5577  df-we 5579  df-ord 6320  df-on 6321
This theorem is referenced by:  onnminsb  7744  oneqmin  7745  onmindif2  7752  cardmin2  9911  ackbij1lem18  10146  cofsmo  10179  fin23lem26  10235  lrrecfr  27939  regsfromunir1  36670
  Copyright terms: Public domain W3C validator