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

Theorem trirec0xor 16649
Description: Version of trirec0 16648 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 16648 . 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 9210 . . . . . . . 8  |-  1  =/=  0
32nesymi 2448 . . . . . . 7  |-  -.  0  =  1
4 simpr 110 . . . . . . . . . . 11  |-  ( ( ( x  x.  z
)  =  1  /\  x  =  0 )  ->  x  =  0 )
54oveq1d 6032 . . . . . . . . . 10  |-  ( ( ( x  x.  z
)  =  1  /\  x  =  0 )  ->  ( x  x.  z )  =  ( 0  x.  z ) )
6 mul02lem2 8566 . . . . . . . . . 10  |-  ( z  e.  RR  ->  (
0  x.  z )  =  0 )
75, 6sylan9eqr 2286 . . . . . . . . 9  |-  ( ( z  e.  RR  /\  ( ( x  x.  z )  =  1  /\  x  =  0 ) )  ->  (
x  x.  z )  =  0 )
8 simprl 531 . . . . . . . . 9  |-  ( ( z  e.  RR  /\  ( ( x  x.  z )  =  1  /\  x  =  0 ) )  ->  (
x  x.  z )  =  1 )
97, 8eqtr3d 2266 . . . . . . . 8  |-  ( ( z  e.  RR  /\  ( ( x  x.  z )  =  1  /\  x  =  0 ) )  ->  0  =  1 )
109rexlimiva 2645 . . . . . . 7  |-  ( E. z  e.  RR  (
( x  x.  z
)  =  1  /\  x  =  0 )  ->  0  =  1 )
113, 10mto 668 . . . . . 6  |-  -.  E. z  e.  RR  (
( x  x.  z
)  =  1  /\  x  =  0 )
12 r19.41v 2689 . . . . . 6  |-  ( E. z  e.  RR  (
( x  x.  z
)  =  1  /\  x  =  0 )  <-> 
( E. z  e.  RR  ( x  x.  z )  =  1  /\  x  =  0 ) )
1311, 12mtbi 676 . . . . 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 1420 . . . 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 2538 . 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 715    \/ w3o 1003    = wceq 1397    \/_ wxo 1419    e. wcel 2202   A.wral 2510   E.wrex 2511   class class class wbr 4088  (class class class)co 6017   RRcr 8030   0cc0 8031   1c1 8032    x. cmul 8036    < clt 8213
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-cnex 8122  ax-resscn 8123  ax-1cn 8124  ax-1re 8125  ax-icn 8126  ax-addcl 8127  ax-addrcl 8128  ax-mulcl 8129  ax-mulrcl 8130  ax-addcom 8131  ax-mulcom 8132  ax-addass 8133  ax-mulass 8134  ax-distr 8135  ax-i2m1 8136  ax-0lt1 8137  ax-1rid 8138  ax-0id 8139  ax-rnegex 8140  ax-precex 8141  ax-cnre 8142  ax-pre-ltirr 8143  ax-pre-ltwlin 8144  ax-pre-lttrn 8145  ax-pre-apti 8146  ax-pre-ltadd 8147  ax-pre-mulgt0 8148  ax-pre-mulext 8149
This theorem depends on definitions:  df-bi 117  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  df-xor 1420  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-reu 2517  df-rmo 2518  df-rab 2519  df-v 2804  df-sbc 3032  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-br 4089  df-opab 4151  df-id 4390  df-po 4393  df-iso 4394  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-iota 5286  df-fun 5328  df-fv 5334  df-riota 5970  df-ov 6020  df-oprab 6021  df-mpo 6022  df-pnf 8215  df-mnf 8216  df-xr 8217  df-ltxr 8218  df-le 8219  df-sub 8351  df-neg 8352  df-reap 8754  df-ap 8761  df-div 8852
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator