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

Theorem ltpiord 10812
Description: Positive integer 'less than' in terms of ordinal membership. (Contributed by NM, 6-Feb-1996.) (Revised by Mario Carneiro, 28-Apr-2015.) (New usage is discouraged.)
Assertion
Ref Expression
ltpiord ((𝐴N𝐵N) → (𝐴 <N 𝐵𝐴𝐵))

Proof of Theorem ltpiord
StepHypRef Expression
1 df-lti 10800 . . 3 <N = ( E ∩ (N × N))
21breqi 5106 . 2 (𝐴 <N 𝐵𝐴( E ∩ (N × N))𝐵)
3 brinxp 5713 . . 3 ((𝐴N𝐵N) → (𝐴 E 𝐵𝐴( E ∩ (N × N))𝐵))
4 epelg 5535 . . . 4 (𝐵N → (𝐴 E 𝐵𝐴𝐵))
54adantl 481 . . 3 ((𝐴N𝐵N) → (𝐴 E 𝐵𝐴𝐵))
63, 5bitr3d 281 . 2 ((𝐴N𝐵N) → (𝐴( E ∩ (N × N))𝐵𝐴𝐵))
72, 6bitrid 283 1 ((𝐴N𝐵N) → (𝐴 <N 𝐵𝐴𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  wcel 2114  cin 3902   class class class wbr 5100   E cep 5533   × cxp 5632  Ncnpi 10769   <N clti 10772
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2709  ax-sep 5245  ax-pr 5381
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-sn 4583  df-pr 4585  df-op 4589  df-br 5101  df-opab 5163  df-eprel 5534  df-xp 5640  df-lti 10800
This theorem is referenced by:  ltexpi  10827  ltapi  10828  ltmpi  10829  1lt2pi  10830  nlt1pi  10831  indpi  10832  nqereu  10854
  Copyright terms: Public domain W3C validator