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

Theorem nnawordex 6543
Description: Equivalence for weak ordering of natural numbers. (Contributed by NM, 8-Nov-2002.) (Revised by Mario Carneiro, 15-Nov-2014.)
Assertion
Ref Expression
nnawordex  |-  ( ( A  e.  om  /\  B  e.  om )  ->  ( A  C_  B  <->  E. x  e.  om  ( A  +o  x )  =  B ) )
Distinct variable groups:    x, A    x, B

Proof of Theorem nnawordex
StepHypRef Expression
1 nntri3or 6507 . . . . 5  |-  ( ( A  e.  om  /\  B  e.  om )  ->  ( A  e.  B  \/  A  =  B  \/  B  e.  A
) )
213adant3 1018 . . . 4  |-  ( ( A  e.  om  /\  B  e.  om  /\  A  C_  B )  ->  ( A  e.  B  \/  A  =  B  \/  B  e.  A )
)
3 nnaordex 6542 . . . . . . 7  |-  ( ( A  e.  om  /\  B  e.  om )  ->  ( A  e.  B  <->  E. x  e.  om  ( (/) 
e.  x  /\  ( A  +o  x )  =  B ) ) )
4 simpr 110 . . . . . . . 8  |-  ( (
(/)  e.  x  /\  ( A  +o  x
)  =  B )  ->  ( A  +o  x )  =  B )
54reximi 2584 . . . . . . 7  |-  ( E. x  e.  om  ( (/) 
e.  x  /\  ( A  +o  x )  =  B )  ->  E. x  e.  om  ( A  +o  x )  =  B )
63, 5biimtrdi 163 . . . . . 6  |-  ( ( A  e.  om  /\  B  e.  om )  ->  ( A  e.  B  ->  E. x  e.  om  ( A  +o  x
)  =  B ) )
763adant3 1018 . . . . 5  |-  ( ( A  e.  om  /\  B  e.  om  /\  A  C_  B )  ->  ( A  e.  B  ->  E. x  e.  om  ( A  +o  x )  =  B ) )
8 nna0 6488 . . . . . . . 8  |-  ( A  e.  om  ->  ( A  +o  (/) )  =  A )
983ad2ant1 1019 . . . . . . 7  |-  ( ( A  e.  om  /\  B  e.  om  /\  A  C_  B )  ->  ( A  +o  (/) )  =  A )
10 eqeq2 2197 . . . . . . 7  |-  ( A  =  B  ->  (
( A  +o  (/) )  =  A  <->  ( A  +o  (/) )  =  B ) )
119, 10syl5ibcom 155 . . . . . 6  |-  ( ( A  e.  om  /\  B  e.  om  /\  A  C_  B )  ->  ( A  =  B  ->  ( A  +o  (/) )  =  B ) )
12 peano1 4605 . . . . . . 7  |-  (/)  e.  om
13 oveq2 5896 . . . . . . . . 9  |-  ( x  =  (/)  ->  ( A  +o  x )  =  ( A  +o  (/) ) )
1413eqeq1d 2196 . . . . . . . 8  |-  ( x  =  (/)  ->  ( ( A  +o  x )  =  B  <->  ( A  +o  (/) )  =  B ) )
1514rspcev 2853 . . . . . . 7  |-  ( (
(/)  e.  om  /\  ( A  +o  (/) )  =  B )  ->  E. x  e.  om  ( A  +o  x )  =  B )
1612, 15mpan 424 . . . . . 6  |-  ( ( A  +o  (/) )  =  B  ->  E. x  e.  om  ( A  +o  x )  =  B )
1711, 16syl6 33 . . . . 5  |-  ( ( A  e.  om  /\  B  e.  om  /\  A  C_  B )  ->  ( A  =  B  ->  E. x  e.  om  ( A  +o  x )  =  B ) )
18 nntri1 6510 . . . . . . 7  |-  ( ( A  e.  om  /\  B  e.  om )  ->  ( A  C_  B  <->  -.  B  e.  A ) )
1918biimp3a 1355 . . . . . 6  |-  ( ( A  e.  om  /\  B  e.  om  /\  A  C_  B )  ->  -.  B  e.  A )
2019pm2.21d 620 . . . . 5  |-  ( ( A  e.  om  /\  B  e.  om  /\  A  C_  B )  ->  ( B  e.  A  ->  E. x  e.  om  ( A  +o  x )  =  B ) )
217, 17, 203jaod 1314 . . . 4  |-  ( ( A  e.  om  /\  B  e.  om  /\  A  C_  B )  ->  (
( A  e.  B  \/  A  =  B  \/  B  e.  A
)  ->  E. x  e.  om  ( A  +o  x )  =  B ) )
222, 21mpd 13 . . 3  |-  ( ( A  e.  om  /\  B  e.  om  /\  A  C_  B )  ->  E. x  e.  om  ( A  +o  x )  =  B )
23223expia 1206 . 2  |-  ( ( A  e.  om  /\  B  e.  om )  ->  ( A  C_  B  ->  E. x  e.  om  ( A  +o  x
)  =  B ) )
24 nnaword1 6527 . . . . 5  |-  ( ( A  e.  om  /\  x  e.  om )  ->  A  C_  ( A  +o  x ) )
25 sseq2 3191 . . . . 5  |-  ( ( A  +o  x )  =  B  ->  ( A  C_  ( A  +o  x )  <->  A  C_  B
) )
2624, 25syl5ibcom 155 . . . 4  |-  ( ( A  e.  om  /\  x  e.  om )  ->  ( ( A  +o  x )  =  B  ->  A  C_  B
) )
2726rexlimdva 2604 . . 3  |-  ( A  e.  om  ->  ( E. x  e.  om  ( A  +o  x
)  =  B  ->  A  C_  B ) )
2827adantr 276 . 2  |-  ( ( A  e.  om  /\  B  e.  om )  ->  ( E. x  e. 
om  ( A  +o  x )  =  B  ->  A  C_  B
) )
2923, 28impbid 129 1  |-  ( ( A  e.  om  /\  B  e.  om )  ->  ( A  C_  B  <->  E. x  e.  om  ( A  +o  x )  =  B ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    <-> wb 105    \/ w3o 978    /\ w3a 979    = wceq 1363    e. wcel 2158   E.wrex 2466    C_ wss 3141   (/)c0 3434   omcom 4601  (class class class)co 5888    +o coa 6427
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 615  ax-in2 616  ax-io 710  ax-5 1457  ax-7 1458  ax-gen 1459  ax-ie1 1503  ax-ie2 1504  ax-8 1514  ax-10 1515  ax-11 1516  ax-i12 1517  ax-bndl 1519  ax-4 1520  ax-17 1536  ax-i9 1540  ax-ial 1544  ax-i5r 1545  ax-13 2160  ax-14 2161  ax-ext 2169  ax-coll 4130  ax-sep 4133  ax-nul 4141  ax-pow 4186  ax-pr 4221  ax-un 4445  ax-setind 4548  ax-iinf 4599
This theorem depends on definitions:  df-bi 117  df-3or 980  df-3an 981  df-tru 1366  df-fal 1369  df-nf 1471  df-sb 1773  df-eu 2039  df-mo 2040  df-clab 2174  df-cleq 2180  df-clel 2183  df-nfc 2318  df-ne 2358  df-ral 2470  df-rex 2471  df-reu 2472  df-rab 2474  df-v 2751  df-sbc 2975  df-csb 3070  df-dif 3143  df-un 3145  df-in 3147  df-ss 3154  df-nul 3435  df-pw 3589  df-sn 3610  df-pr 3611  df-op 3613  df-uni 3822  df-int 3857  df-iun 3900  df-br 4016  df-opab 4077  df-mpt 4078  df-tr 4114  df-id 4305  df-iord 4378  df-on 4380  df-suc 4383  df-iom 4602  df-xp 4644  df-rel 4645  df-cnv 4646  df-co 4647  df-dm 4648  df-rn 4649  df-res 4650  df-ima 4651  df-iota 5190  df-fun 5230  df-fn 5231  df-f 5232  df-f1 5233  df-fo 5234  df-f1o 5235  df-fv 5236  df-ov 5891  df-oprab 5892  df-mpo 5893  df-1st 6154  df-2nd 6155  df-recs 6319  df-irdg 6384  df-1o 6430  df-oadd 6434
This theorem is referenced by:  prarloclemn  7511
  Copyright terms: Public domain W3C validator