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

Theorem apirr 8923
Description: Apartness is irreflexive. (Contributed by Jim Kingdon, 16-Feb-2020.)
Assertion
Ref Expression
apirr  |-  ( A  e.  CC  ->  -.  A #  A )

Proof of Theorem apirr
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 cnre 8312 . 2  |-  ( A  e.  CC  ->  E. x  e.  RR  E. y  e.  RR  A  =  ( x  +  ( _i  x.  y ) ) )
2 reapirr 8895 . . . . . . . . . 10  |-  ( x  e.  RR  ->  -.  x #  x )
3 apreap 8905 . . . . . . . . . . 11  |-  ( ( x  e.  RR  /\  x  e.  RR )  ->  ( x #  x  <->  x #  x )
)
43anidms 401 . . . . . . . . . 10  |-  ( x  e.  RR  ->  (
x #  x  <->  x #  x )
)
52, 4mtbird 684 . . . . . . . . 9  |-  ( x  e.  RR  ->  -.  x #  x )
6 reapirr 8895 . . . . . . . . . 10  |-  ( y  e.  RR  ->  -.  y #  y )
7 apreap 8905 . . . . . . . . . . 11  |-  ( ( y  e.  RR  /\  y  e.  RR )  ->  ( y #  y  <->  y #  y )
)
87anidms 401 . . . . . . . . . 10  |-  ( y  e.  RR  ->  (
y #  y  <->  y #  y )
)
96, 8mtbird 684 . . . . . . . . 9  |-  ( y  e.  RR  ->  -.  y #  y )
105, 9anim12i 338 . . . . . . . 8  |-  ( ( x  e.  RR  /\  y  e.  RR )  ->  ( -.  x #  x  /\  -.  y #  y ) )
11 ioran 764 . . . . . . . 8  |-  ( -.  ( x #  x  \/  y #  y )  <->  ( -.  x #  x  /\  -.  y #  y ) )
1210, 11sylibr 134 . . . . . . 7  |-  ( ( x  e.  RR  /\  y  e.  RR )  ->  -.  ( x #  x  \/  y #  y )
)
13 apreim 8921 . . . . . . . 8  |-  ( ( ( x  e.  RR  /\  y  e.  RR )  /\  ( x  e.  RR  /\  y  e.  RR ) )  -> 
( ( x  +  ( _i  x.  y
) ) #  ( x  +  ( _i  x.  y ) )  <->  ( x #  x  \/  y #  y
) ) )
1413anidms 401 . . . . . . 7  |-  ( ( x  e.  RR  /\  y  e.  RR )  ->  ( ( x  +  ( _i  x.  y
) ) #  ( x  +  ( _i  x.  y ) )  <->  ( x #  x  \/  y #  y
) ) )
1512, 14mtbird 684 . . . . . 6  |-  ( ( x  e.  RR  /\  y  e.  RR )  ->  -.  ( x  +  ( _i  x.  y
) ) #  ( x  +  ( _i  x.  y ) ) )
1615ad2antlr 493 . . . . 5  |-  ( ( ( A  e.  CC  /\  ( x  e.  RR  /\  y  e.  RR ) )  /\  A  =  ( x  +  ( _i  x.  y ) ) )  ->  -.  ( x  +  (
_i  x.  y )
) #  ( x  +  ( _i  x.  y
) ) )
17 id 19 . . . . . . . 8  |-  ( A  =  ( x  +  ( _i  x.  y
) )  ->  A  =  ( x  +  ( _i  x.  y
) ) )
1817, 17breq12d 4138 . . . . . . 7  |-  ( A  =  ( x  +  ( _i  x.  y
) )  ->  ( A #  A  <->  ( x  +  ( _i  x.  y
) ) #  ( x  +  ( _i  x.  y ) ) ) )
1918notbid 677 . . . . . 6  |-  ( A  =  ( x  +  ( _i  x.  y
) )  ->  ( -.  A #  A  <->  -.  (
x  +  ( _i  x.  y ) ) #  ( x  +  ( _i  x.  y ) ) ) )
2019adantl 277 . . . . 5  |-  ( ( ( A  e.  CC  /\  ( x  e.  RR  /\  y  e.  RR ) )  /\  A  =  ( x  +  ( _i  x.  y ) ) )  ->  ( -.  A #  A  <->  -.  (
x  +  ( _i  x.  y ) ) #  ( x  +  ( _i  x.  y ) ) ) )
2116, 20mpbird 167 . . . 4  |-  ( ( ( A  e.  CC  /\  ( x  e.  RR  /\  y  e.  RR ) )  /\  A  =  ( x  +  ( _i  x.  y ) ) )  ->  -.  A #  A )
2221ex 115 . . 3  |-  ( ( A  e.  CC  /\  ( x  e.  RR  /\  y  e.  RR ) )  ->  ( A  =  ( x  +  ( _i  x.  y
) )  ->  -.  A #  A ) )
2322rexlimdvva 2676 . 2  |-  ( A  e.  CC  ->  ( E. x  e.  RR  E. y  e.  RR  A  =  ( x  +  ( _i  x.  y
) )  ->  -.  A #  A ) )
241, 23mpd 13 1  |-  ( A  e.  CC  ->  -.  A #  A )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    <-> wb 105    \/ wo 720    = wceq 1402    e. wcel 2209   E.wrex 2529   class class class wbr 4125  (class class class)co 6075   CCcc 8167   RRcr 8168   _ici 8171    + caddc 8172    x. cmul 8174   # creap 8892   # cap 8899
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 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4244  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-cnex 8260  ax-resscn 8261  ax-1cn 8262  ax-1re 8263  ax-icn 8264  ax-addcl 8265  ax-addrcl 8266  ax-mulcl 8267  ax-mulrcl 8268  ax-addcom 8269  ax-mulcom 8270  ax-addass 8271  ax-mulass 8272  ax-distr 8273  ax-i2m1 8274  ax-0lt1 8275  ax-1rid 8276  ax-0id 8277  ax-rnegex 8278  ax-precex 8279  ax-cnre 8280  ax-pre-ltirr 8281  ax-pre-lttrn 8283  ax-pre-apti 8284  ax-pre-ltadd 8285  ax-pre-mulgt0 8286
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-br 4126  df-opab 4188  df-id 4433  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-iota 5332  df-fun 5374  df-fv 5380  df-riota 6028  df-ov 6078  df-oprab 6079  df-mpo 6080  df-pnf 8352  df-mnf 8353  df-ltxr 8355  df-sub 8489  df-neg 8490  df-reap 8893  df-ap 8900
This theorem is referenced by:  mulap0r  8933  aptap  8968  eirr  12524  dcapnconst  17016
  Copyright terms: Public domain W3C validator