MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  mirne Structured version   Visualization version   Unicode version

Theorem mirne 25562
Description: Mirror of non-center point cannot be the center point. (Contributed by Thierry Arnoux, 27-Sep-2020.)
Hypotheses
Ref Expression
mirval.p  |-  P  =  ( Base `  G
)
mirval.d  |-  .-  =  ( dist `  G )
mirval.i  |-  I  =  (Itv `  G )
mirval.l  |-  L  =  (LineG `  G )
mirval.s  |-  S  =  (pInvG `  G )
mirval.g  |-  ( ph  ->  G  e. TarskiG )
mirval.a  |-  ( ph  ->  A  e.  P )
mirfv.m  |-  M  =  ( S `  A
)
mirinv.b  |-  ( ph  ->  B  e.  P )
mirne.1  |-  ( ph  ->  B  =/=  A )
Assertion
Ref Expression
mirne  |-  ( ph  ->  ( M `  B
)  =/=  A )

Proof of Theorem mirne
StepHypRef Expression
1 simpr 477 . . . . 5  |-  ( (
ph  /\  ( M `  B )  =  A )  ->  ( M `  B )  =  A )
21fveq2d 6195 . . . 4  |-  ( (
ph  /\  ( M `  B )  =  A )  ->  ( M `  ( M `  B
) )  =  ( M `  A ) )
3 mirval.p . . . . . 6  |-  P  =  ( Base `  G
)
4 mirval.d . . . . . 6  |-  .-  =  ( dist `  G )
5 mirval.i . . . . . 6  |-  I  =  (Itv `  G )
6 mirval.l . . . . . 6  |-  L  =  (LineG `  G )
7 mirval.s . . . . . 6  |-  S  =  (pInvG `  G )
8 mirval.g . . . . . 6  |-  ( ph  ->  G  e. TarskiG )
9 mirval.a . . . . . 6  |-  ( ph  ->  A  e.  P )
10 mirfv.m . . . . . 6  |-  M  =  ( S `  A
)
11 mirinv.b . . . . . 6  |-  ( ph  ->  B  e.  P )
123, 4, 5, 6, 7, 8, 9, 10, 11mirmir 25557 . . . . 5  |-  ( ph  ->  ( M `  ( M `  B )
)  =  B )
1312adantr 481 . . . 4  |-  ( (
ph  /\  ( M `  B )  =  A )  ->  ( M `  ( M `  B
) )  =  B )
14 eqid 2622 . . . . . 6  |-  A  =  A
153, 4, 5, 6, 7, 8, 9, 10, 9mirinv 25561 . . . . . 6  |-  ( ph  ->  ( ( M `  A )  =  A  <-> 
A  =  A ) )
1614, 15mpbiri 248 . . . . 5  |-  ( ph  ->  ( M `  A
)  =  A )
1716adantr 481 . . . 4  |-  ( (
ph  /\  ( M `  B )  =  A )  ->  ( M `  A )  =  A )
182, 13, 173eqtr3d 2664 . . 3  |-  ( (
ph  /\  ( M `  B )  =  A )  ->  B  =  A )
19 mirne.1 . . . . 5  |-  ( ph  ->  B  =/=  A )
2019adantr 481 . . . 4  |-  ( (
ph  /\  ( M `  B )  =  A )  ->  B  =/=  A )
2120neneqd 2799 . . 3  |-  ( (
ph  /\  ( M `  B )  =  A )  ->  -.  B  =  A )
2218, 21pm2.65da 600 . 2  |-  ( ph  ->  -.  ( M `  B )  =  A )
2322neqned 2801 1  |-  ( ph  ->  ( M `  B
)  =/=  A )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ wa 384    = wceq 1483    e. wcel 1990    =/= wne 2794   ` cfv 5888   Basecbs 15857   distcds 15950  TarskiGcstrkg 25329  Itvcitv 25335  LineGclng 25336  pInvGcmir 25547
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-rep 4771  ax-sep 4781  ax-nul 4789  ax-pr 4906
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-reu 2919  df-rmo 2920  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-riota 6611  df-ov 6653  df-trkgc 25347  df-trkgb 25348  df-trkgcb 25349  df-trkg 25352  df-mir 25548
This theorem is referenced by:  sacgr  25722
  Copyright terms: Public domain W3C validator