Users' Mathboxes Mathbox for Jim Kingdon < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >   Mathboxes  >  trirec0xor Unicode version

Theorem trirec0xor 14878
Description: Version of trirec0 14877 with exclusive-or.

The definition of a discrete field is sometimes stated in terms of exclusive-or but as proved here, this is equivalent to inclusive-or because the two disjuncts cannot be simultaneously true. (Contributed by Jim Kingdon, 10-Jun-2024.)

Assertion
Ref Expression
trirec0xor  |-  ( A. x  e.  RR  A. y  e.  RR  ( x  < 
y  \/  x  =  y  \/  y  < 
x )  <->  A. x  e.  RR  ( E. z  e.  RR  ( x  x.  z )  =  1 
\/_  x  =  0 ) )
Distinct variable group:    x, y, z

Proof of Theorem trirec0xor
StepHypRef Expression
1 trirec0 14877 . 2  |-  ( A. x  e.  RR  A. y  e.  RR  ( x  < 
y  \/  x  =  y  \/  y  < 
x )  <->  A. x  e.  RR  ( E. z  e.  RR  ( x  x.  z )  =  1  \/  x  =  0 ) )
2 1ne0 8989 . . . . . . . 8  |-  1  =/=  0
32nesymi 2393 . . . . . . 7  |-  -.  0  =  1
4 simpr 110 . . . . . . . . . . 11  |-  ( ( ( x  x.  z
)  =  1  /\  x  =  0 )  ->  x  =  0 )
54oveq1d 5892 . . . . . . . . . 10  |-  ( ( ( x  x.  z
)  =  1  /\  x  =  0 )  ->  ( x  x.  z )  =  ( 0  x.  z ) )
6 mul02lem2 8347 . . . . . . . . . 10  |-  ( z  e.  RR  ->  (
0  x.  z )  =  0 )
75, 6sylan9eqr 2232 . . . . . . . . 9  |-  ( ( z  e.  RR  /\  ( ( x  x.  z )  =  1  /\  x  =  0 ) )  ->  (
x  x.  z )  =  0 )
8 simprl 529 . . . . . . . . 9  |-  ( ( z  e.  RR  /\  ( ( x  x.  z )  =  1  /\  x  =  0 ) )  ->  (
x  x.  z )  =  1 )
97, 8eqtr3d 2212 . . . . . . . 8  |-  ( ( z  e.  RR  /\  ( ( x  x.  z )  =  1  /\  x  =  0 ) )  ->  0  =  1 )
109rexlimiva 2589 . . . . . . 7  |-  ( E. z  e.  RR  (
( x  x.  z
)  =  1  /\  x  =  0 )  ->  0  =  1 )
113, 10mto 662 . . . . . 6  |-  -.  E. z  e.  RR  (
( x  x.  z
)  =  1  /\  x  =  0 )
12 r19.41v 2633 . . . . . 6  |-  ( E. z  e.  RR  (
( x  x.  z
)  =  1  /\  x  =  0 )  <-> 
( E. z  e.  RR  ( x  x.  z )  =  1  /\  x  =  0 ) )
1311, 12mtbi 670 . . . . 5  |-  -.  ( E. z  e.  RR  ( x  x.  z
)  =  1  /\  x  =  0 )
1413biantru 302 . . . 4  |-  ( ( E. z  e.  RR  ( x  x.  z
)  =  1  \/  x  =  0 )  <-> 
( ( E. z  e.  RR  ( x  x.  z )  =  1  \/  x  =  0 )  /\  -.  ( E. z  e.  RR  ( x  x.  z
)  =  1  /\  x  =  0 ) ) )
15 df-xor 1376 . . . 4  |-  ( ( E. z  e.  RR  ( x  x.  z
)  =  1  \/_  x  =  0 )  <-> 
( ( E. z  e.  RR  ( x  x.  z )  =  1  \/  x  =  0 )  /\  -.  ( E. z  e.  RR  ( x  x.  z
)  =  1  /\  x  =  0 ) ) )
1614, 15bitr4i 187 . . 3  |-  ( ( E. z  e.  RR  ( x  x.  z
)  =  1  \/  x  =  0 )  <-> 
( E. z  e.  RR  ( x  x.  z )  =  1 
\/_  x  =  0 ) )
1716ralbii 2483 . 2  |-  ( A. x  e.  RR  ( E. z  e.  RR  ( x  x.  z
)  =  1  \/  x  =  0 )  <->  A. x  e.  RR  ( E. z  e.  RR  ( x  x.  z
)  =  1  \/_  x  =  0 ) )
181, 17bitri 184 1  |-  ( A. x  e.  RR  A. y  e.  RR  ( x  < 
y  \/  x  =  y  \/  y  < 
x )  <->  A. x  e.  RR  ( E. z  e.  RR  ( x  x.  z )  =  1 
\/_  x  =  0 ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    /\ wa 104    <-> wb 105    \/ wo 708    \/ w3o 977    = wceq 1353    \/_ wxo 1375    e. wcel 2148   A.wral 2455   E.wrex 2456   class class class wbr 4005  (class class class)co 5877   RRcr 7812   0cc0 7813   1c1 7814    x. cmul 7818    < clt 7994
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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-sep 4123  ax-pow 4176  ax-pr 4211  ax-un 4435  ax-setind 4538  ax-cnex 7904  ax-resscn 7905  ax-1cn 7906  ax-1re 7907  ax-icn 7908  ax-addcl 7909  ax-addrcl 7910  ax-mulcl 7911  ax-mulrcl 7912  ax-addcom 7913  ax-mulcom 7914  ax-addass 7915  ax-mulass 7916  ax-distr 7917  ax-i2m1 7918  ax-0lt1 7919  ax-1rid 7920  ax-0id 7921  ax-rnegex 7922  ax-precex 7923  ax-cnre 7924  ax-pre-ltirr 7925  ax-pre-ltwlin 7926  ax-pre-lttrn 7927  ax-pre-apti 7928  ax-pre-ltadd 7929  ax-pre-mulgt0 7930  ax-pre-mulext 7931
This theorem depends on definitions:  df-bi 117  df-3or 979  df-3an 980  df-tru 1356  df-fal 1359  df-xor 1376  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-nel 2443  df-ral 2460  df-rex 2461  df-reu 2462  df-rmo 2463  df-rab 2464  df-v 2741  df-sbc 2965  df-dif 3133  df-un 3135  df-in 3137  df-ss 3144  df-pw 3579  df-sn 3600  df-pr 3601  df-op 3603  df-uni 3812  df-br 4006  df-opab 4067  df-id 4295  df-po 4298  df-iso 4299  df-xp 4634  df-rel 4635  df-cnv 4636  df-co 4637  df-dm 4638  df-iota 5180  df-fun 5220  df-fv 5226  df-riota 5833  df-ov 5880  df-oprab 5881  df-mpo 5882  df-pnf 7996  df-mnf 7997  df-xr 7998  df-ltxr 7999  df-le 8000  df-sub 8132  df-neg 8133  df-reap 8534  df-ap 8541  df-div 8632
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator