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

Theorem apirr 8879
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 8270 . 2  |-  ( A  e.  CC  ->  E. x  e.  RR  E. y  e.  RR  A  =  ( x  +  ( _i  x.  y ) ) )
2 reapirr 8851 . . . . . . . . . 10  |-  ( x  e.  RR  ->  -.  x #  x )
3 apreap 8861 . . . . . . . . . . 11  |-  ( ( x  e.  RR  /\  x  e.  RR )  ->  ( x #  x  <->  x #  x )
)
43anidms 397 . . . . . . . . . 10  |-  ( x  e.  RR  ->  (
x #  x  <->  x #  x )
)
52, 4mtbird 680 . . . . . . . . 9  |-  ( x  e.  RR  ->  -.  x #  x )
6 reapirr 8851 . . . . . . . . . 10  |-  ( y  e.  RR  ->  -.  y #  y )
7 apreap 8861 . . . . . . . . . . 11  |-  ( ( y  e.  RR  /\  y  e.  RR )  ->  ( y #  y  <->  y #  y )
)
87anidms 397 . . . . . . . . . 10  |-  ( y  e.  RR  ->  (
y #  y  <->  y #  y )
)
96, 8mtbird 680 . . . . . . . . 9  |-  ( y  e.  RR  ->  -.  y #  y )
105, 9anim12i 338 . . . . . . . 8  |-  ( ( x  e.  RR  /\  y  e.  RR )  ->  ( -.  x #  x  /\  -.  y #  y ) )
11 ioran 760 . . . . . . . 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 8877 . . . . . . . 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 397 . . . . . . 7  |-  ( ( x  e.  RR  /\  y  e.  RR )  ->  ( ( x  +  ( _i  x.  y
) ) #  ( x  +  ( _i  x.  y ) )  <->  ( x #  x  \/  y #  y
) ) )
1512, 14mtbird 680 . . . . . 6  |-  ( ( x  e.  RR  /\  y  e.  RR )  ->  -.  ( x  +  ( _i  x.  y
) ) #  ( x  +  ( _i  x.  y ) ) )
1615ad2antlr 489 . . . . 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 4122 . . . . . . 7  |-  ( A  =  ( x  +  ( _i  x.  y
) )  ->  ( A #  A  <->  ( x  +  ( _i  x.  y
) ) #  ( x  +  ( _i  x.  y ) ) ) )
1918notbid 673 . . . . . 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 2668 . 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 716    = wceq 1398    e. wcel 2203   E.wrex 2521   class class class wbr 4109  (class class class)co 6050   CCcc 8125   RRcr 8126   _ici 8129    + caddc 8130    x. cmul 8132   # creap 8848   # cap 8855
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-sep 4228  ax-pow 4287  ax-pr 4322  ax-un 4554  ax-setind 4659  ax-cnex 8218  ax-resscn 8219  ax-1cn 8220  ax-1re 8221  ax-icn 8222  ax-addcl 8223  ax-addrcl 8224  ax-mulcl 8225  ax-mulrcl 8226  ax-addcom 8227  ax-mulcom 8228  ax-addass 8229  ax-mulass 8230  ax-distr 8231  ax-i2m1 8232  ax-0lt1 8233  ax-1rid 8234  ax-0id 8235  ax-rnegex 8236  ax-precex 8237  ax-cnre 8238  ax-pre-ltirr 8239  ax-pre-lttrn 8241  ax-pre-apti 8242  ax-pre-ltadd 8243  ax-pre-mulgt0 8244
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-nel 2508  df-ral 2525  df-rex 2526  df-reu 2527  df-rab 2529  df-v 2815  df-sbc 3043  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-br 4110  df-opab 4172  df-id 4414  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-iota 5312  df-fun 5354  df-fv 5360  df-riota 6003  df-ov 6053  df-oprab 6054  df-mpo 6055  df-pnf 8310  df-mnf 8311  df-ltxr 8313  df-sub 8446  df-neg 8447  df-reap 8849  df-ap 8856
This theorem is referenced by:  mulap0r  8889  aptap  8924  eirr  12465  dcapnconst  16847
  Copyright terms: Public domain W3C validator