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

Theorem oawordriexmid 6703
Description: A weak ordering property of ordinal addition which implies excluded middle. The property is proposition 8.7 of [TakeutiZaring] p. 59. Compare with oawordi 6702. (Contributed by Jim Kingdon, 15-May-2022.)
Hypothesis
Ref Expression
oawordriexmid.1  |-  ( ( a  e.  On  /\  b  e.  On  /\  c  e.  On )  ->  (
a  C_  b  ->  ( a  +o  c ) 
C_  ( b  +o  c ) ) )
Assertion
Ref Expression
oawordriexmid  |-  ( ph  \/  -.  ph )
Distinct variable groups:    a, b, c    ph, a
Allowed substitution hints:    ph( b, c)

Proof of Theorem oawordriexmid
StepHypRef Expression
1 1on 6654 . . . . 5  |-  1o  e.  On
2 oawordriexmid.1 . . . . . . . 8  |-  ( ( a  e.  On  /\  b  e.  On  /\  c  e.  On )  ->  (
a  C_  b  ->  ( a  +o  c ) 
C_  ( b  +o  c ) ) )
323expa 1230 . . . . . . 7  |-  ( ( ( a  e.  On  /\  b  e.  On )  /\  c  e.  On )  ->  ( a  C_  b  ->  ( a  +o  c )  C_  (
b  +o  c ) ) )
43expcom 116 . . . . . 6  |-  ( c  e.  On  ->  (
( a  e.  On  /\  b  e.  On )  ->  ( a  C_  b  ->  ( a  +o  c )  C_  (
b  +o  c ) ) ) )
54rgen 2595 . . . . 5  |-  A. c  e.  On  ( ( a  e.  On  /\  b  e.  On )  ->  (
a  C_  b  ->  ( a  +o  c ) 
C_  ( b  +o  c ) ) )
6 oveq2 6058 . . . . . . . . 9  |-  ( c  =  1o  ->  (
a  +o  c )  =  ( a  +o  1o ) )
7 oveq2 6058 . . . . . . . . 9  |-  ( c  =  1o  ->  (
b  +o  c )  =  ( b  +o  1o ) )
86, 7sseq12d 3269 . . . . . . . 8  |-  ( c  =  1o  ->  (
( a  +o  c
)  C_  ( b  +o  c )  <->  ( a  +o  1o )  C_  (
b  +o  1o ) ) )
98imbi2d 230 . . . . . . 7  |-  ( c  =  1o  ->  (
( a  C_  b  ->  ( a  +o  c
)  C_  ( b  +o  c ) )  <->  ( a  C_  b  ->  ( a  +o  1o )  C_  (
b  +o  1o ) ) ) )
109imbi2d 230 . . . . . 6  |-  ( c  =  1o  ->  (
( ( a  e.  On  /\  b  e.  On )  ->  (
a  C_  b  ->  ( a  +o  c ) 
C_  ( b  +o  c ) ) )  <-> 
( ( a  e.  On  /\  b  e.  On )  ->  (
a  C_  b  ->  ( a  +o  1o ) 
C_  ( b  +o  1o ) ) ) ) )
1110rspcv 2917 . . . . 5  |-  ( 1o  e.  On  ->  ( A. c  e.  On  ( ( a  e.  On  /\  b  e.  On )  ->  (
a  C_  b  ->  ( a  +o  c ) 
C_  ( b  +o  c ) ) )  ->  ( ( a  e.  On  /\  b  e.  On )  ->  (
a  C_  b  ->  ( a  +o  1o ) 
C_  ( b  +o  1o ) ) ) ) )
121, 5, 11mp2 16 . . . 4  |-  ( ( a  e.  On  /\  b  e.  On )  ->  ( a  C_  b  ->  ( a  +o  1o )  C_  ( b  +o  1o ) ) )
13 oa1suc 6700 . . . . . 6  |-  ( a  e.  On  ->  (
a  +o  1o )  =  suc  a )
1413adantr 276 . . . . 5  |-  ( ( a  e.  On  /\  b  e.  On )  ->  ( a  +o  1o )  =  suc  a )
15 oa1suc 6700 . . . . . 6  |-  ( b  e.  On  ->  (
b  +o  1o )  =  suc  b )
1615adantl 277 . . . . 5  |-  ( ( a  e.  On  /\  b  e.  On )  ->  ( b  +o  1o )  =  suc  b )
1714, 16sseq12d 3269 . . . 4  |-  ( ( a  e.  On  /\  b  e.  On )  ->  ( ( a  +o  1o )  C_  (
b  +o  1o )  <->  suc  a  C_  suc  b
) )
1812, 17sylibd 149 . . 3  |-  ( ( a  e.  On  /\  b  e.  On )  ->  ( a  C_  b  ->  suc  a  C_  suc  b ) )
1918rgen2a 2596 . 2  |-  A. a  e.  On  A. b  e.  On  ( a  C_  b  ->  suc  a  C_  suc  b )
2019onsucsssucexmid 4649 1  |-  ( ph  \/  -.  ph )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    \/ wo 716    /\ w3a 1005    = wceq 1398    e. wcel 2203   A.wral 2520    C_ wss 3211   Oncon0 4484   suc csuc 4486  (class class class)co 6050   1oc1o 6640    +o coa 6644
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-coll 4225  ax-sep 4228  ax-nul 4236  ax-pow 4287  ax-pr 4322  ax-un 4554  ax-setind 4659  ax-iinf 4710
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-ral 2525  df-rex 2526  df-reu 2527  df-rab 2529  df-v 2815  df-sbc 3043  df-csb 3139  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-nul 3509  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-int 3950  df-iun 3993  df-br 4110  df-opab 4172  df-mpt 4173  df-tr 4209  df-id 4414  df-iord 4487  df-on 4489  df-suc 4492  df-iom 4713  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-res 4761  df-ima 4762  df-iota 5312  df-fun 5354  df-fn 5355  df-f 5356  df-f1 5357  df-fo 5358  df-f1o 5359  df-fv 5360  df-ov 6053  df-oprab 6054  df-mpo 6055  df-1st 6334  df-2nd 6335  df-recs 6536  df-irdg 6601  df-1o 6647  df-oadd 6651
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator