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

Theorem onnmin 4713
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 ((𝐴 ⊆ On ∧ 𝐵𝐴) → ¬ 𝐵 𝐴)

Proof of Theorem onnmin
StepHypRef Expression
1 intss1 3983 . . 3 (𝐵𝐴 𝐴𝐵)
2 elirr 4686 . . . 4 ¬ 𝐵𝐵
3 ssel 3242 . . . 4 ( 𝐴𝐵 → (𝐵 𝐴𝐵𝐵))
42, 3mtoi 674 . . 3 ( 𝐴𝐵 → ¬ 𝐵 𝐴)
51, 4syl 14 . 2 (𝐵𝐴 → ¬ 𝐵 𝐴)
65adantl 277 1 ((𝐴 ⊆ On ∧ 𝐵𝐴) → ¬ 𝐵 𝐴)
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 104  wcel 2209  wss 3220   cint 3968  Oncon0 4506
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 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220  ax-setind 4682
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-v 2823  df-dif 3222  df-in 3226  df-ss 3233  df-sn 3714  df-int 3969
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator