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

Theorem oawordriexmid 6681
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 6680. (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 6632 . . . . 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 2586 . . . . 5  |-  A. c  e.  On  ( ( a  e.  On  /\  b  e.  On )  ->  (
a  C_  b  ->  ( a  +o  c ) 
C_  ( b  +o  c ) ) )
6 oveq2 6036 . . . . . . . . 9  |-  ( c  =  1o  ->  (
a  +o  c )  =  ( a  +o  1o ) )
7 oveq2 6036 . . . . . . . . 9  |-  ( c  =  1o  ->  (
b  +o  c )  =  ( b  +o  1o ) )
86, 7sseq12d 3259 . . . . . . . 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 2907 . . . . 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 6678 . . . . . 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 6678 . . . . . 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 3259 . . . 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 2587 . 2  |-  A. a  e.  On  A. b  e.  On  ( a  C_  b  ->  suc  a  C_  suc  b )
2019onsucsssucexmid 4631 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 2202   A.wral 2511    C_ wss 3201   Oncon0 4466   suc csuc 4468  (class class class)co 6028   1oc1o 6618    +o coa 6622
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 2204  ax-14 2205  ax-ext 2213  ax-coll 4209  ax-sep 4212  ax-nul 4220  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-iinf 4692
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-ral 2516  df-rex 2517  df-reu 2518  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-tr 4193  df-id 4396  df-iord 4469  df-on 4471  df-suc 4474  df-iom 4695  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-ov 6031  df-oprab 6032  df-mpo 6033  df-1st 6312  df-2nd 6313  df-recs 6514  df-irdg 6579  df-1o 6625  df-oadd 6629
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator