Users' Mathboxes Mathbox for Scott Fenton < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  linecom Unicode version

Theorem linecom 25332
Description: Commutativity law for lines. Part of theorem 6.17 of [Schwabhauser] p. 45. (Contributed by Scott Fenton, 28-Oct-2013.) (Revised by Mario Carneiro, 19-Apr-2014.)
Assertion
Ref Expression
linecom  |-  ( ( N  e.  NN  /\  ( P  e.  ( EE `  N )  /\  Q  e.  ( EE `  N )  /\  P  =/=  Q ) )  -> 
( PLine Q )  =  ( QLine P
) )

Proof of Theorem linecom
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 simp1 955 . . . . 5  |-  ( ( N  e.  NN  /\  ( P  e.  ( EE `  N )  /\  Q  e.  ( EE `  N )  /\  P  =/=  Q )  /\  x  e.  ( EE `  N
) )  ->  N  e.  NN )
2 simp3 957 . . . . 5  |-  ( ( N  e.  NN  /\  ( P  e.  ( EE `  N )  /\  Q  e.  ( EE `  N )  /\  P  =/=  Q )  /\  x  e.  ( EE `  N
) )  ->  x  e.  ( EE `  N
) )
3 simp21 988 . . . . 5  |-  ( ( N  e.  NN  /\  ( P  e.  ( EE `  N )  /\  Q  e.  ( EE `  N )  /\  P  =/=  Q )  /\  x  e.  ( EE `  N
) )  ->  P  e.  ( EE `  N
) )
4 simp22 989 . . . . 5  |-  ( ( N  e.  NN  /\  ( P  e.  ( EE `  N )  /\  Q  e.  ( EE `  N )  /\  P  =/=  Q )  /\  x  e.  ( EE `  N
) )  ->  Q  e.  ( EE `  N
) )
5 colinearperm1 25244 . . . . 5  |-  ( ( N  e.  NN  /\  ( x  e.  ( EE `  N )  /\  P  e.  ( EE `  N )  /\  Q  e.  ( EE `  N
) ) )  -> 
( x  Colinear  <. P ,  Q >. 
<->  x  Colinear  <. Q ,  P >. ) )
61, 2, 3, 4, 5syl13anc 1184 . . . 4  |-  ( ( N  e.  NN  /\  ( P  e.  ( EE `  N )  /\  Q  e.  ( EE `  N )  /\  P  =/=  Q )  /\  x  e.  ( EE `  N
) )  ->  (
x  Colinear  <. P ,  Q >.  <-> 
x  Colinear  <. Q ,  P >. ) )
763expa 1151 . . 3  |-  ( ( ( N  e.  NN  /\  ( P  e.  ( EE `  N )  /\  Q  e.  ( EE `  N )  /\  P  =/=  Q
) )  /\  x  e.  ( EE `  N
) )  ->  (
x  Colinear  <. P ,  Q >.  <-> 
x  Colinear  <. Q ,  P >. ) )
87rabbidva 2855 . 2  |-  ( ( N  e.  NN  /\  ( P  e.  ( EE `  N )  /\  Q  e.  ( EE `  N )  /\  P  =/=  Q ) )  ->  { x  e.  ( EE `  N )  |  x  Colinear  <. P ,  Q >. }  =  { x  e.  ( EE `  N
)  |  x  Colinear  <. Q ,  P >. } )
9 fvline2 25328 . 2  |-  ( ( N  e.  NN  /\  ( P  e.  ( EE `  N )  /\  Q  e.  ( EE `  N )  /\  P  =/=  Q ) )  -> 
( PLine Q )  =  { x  e.  ( EE `  N
)  |  x  Colinear  <. P ,  Q >. } )
10 necom 2602 . . . . 5  |-  ( P  =/=  Q  <->  Q  =/=  P )
11103anbi3i 1144 . . . 4  |-  ( ( P  e.  ( EE
`  N )  /\  Q  e.  ( EE `  N )  /\  P  =/=  Q )  <->  ( P  e.  ( EE `  N
)  /\  Q  e.  ( EE `  N )  /\  Q  =/=  P
) )
12 3ancoma 941 . . . 4  |-  ( ( P  e.  ( EE
`  N )  /\  Q  e.  ( EE `  N )  /\  Q  =/=  P )  <->  ( Q  e.  ( EE `  N
)  /\  P  e.  ( EE `  N )  /\  Q  =/=  P
) )
1311, 12bitri 240 . . 3  |-  ( ( P  e.  ( EE
`  N )  /\  Q  e.  ( EE `  N )  /\  P  =/=  Q )  <->  ( Q  e.  ( EE `  N
)  /\  P  e.  ( EE `  N )  /\  Q  =/=  P
) )
14 fvline2 25328 . . 3  |-  ( ( N  e.  NN  /\  ( Q  e.  ( EE `  N )  /\  P  e.  ( EE `  N )  /\  Q  =/=  P ) )  -> 
( QLine P )  =  { x  e.  ( EE `  N
)  |  x  Colinear  <. Q ,  P >. } )
1513, 14sylan2b 461 . 2  |-  ( ( N  e.  NN  /\  ( P  e.  ( EE `  N )  /\  Q  e.  ( EE `  N )  /\  P  =/=  Q ) )  -> 
( QLine P )  =  { x  e.  ( EE `  N
)  |  x  Colinear  <. Q ,  P >. } )
168, 9, 153eqtr4d 2400 1  |-  ( ( N  e.  NN  /\  ( P  e.  ( EE `  N )  /\  Q  e.  ( EE `  N )  /\  P  =/=  Q ) )  -> 
( PLine Q )  =  ( QLine P
) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 176    /\ wa 358    /\ w3a 934    = wceq 1642    e. wcel 1710    =/= wne 2521   {crab 2623   <.cop 3719   class class class wbr 4104   ` cfv 5337  (class class class)co 5945   NNcn 9836   EEcee 25075    Colinear ccolin 25219  Linecline2 25316
This theorem is referenced by:  linerflx2  25333  linethru  25335
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1546  ax-5 1557  ax-17 1616  ax-9 1654  ax-8 1675  ax-13 1712  ax-14 1714  ax-6 1729  ax-7 1734  ax-11 1746  ax-12 1930  ax-ext 2339  ax-rep 4212  ax-sep 4222  ax-nul 4230  ax-pow 4269  ax-pr 4295  ax-un 4594  ax-inf2 7432  ax-cnex 8883  ax-resscn 8884  ax-1cn 8885  ax-icn 8886  ax-addcl 8887  ax-addrcl 8888  ax-mulcl 8889  ax-mulrcl 8890  ax-mulcom 8891  ax-addass 8892  ax-mulass 8893  ax-distr 8894  ax-i2m1 8895  ax-1ne0 8896  ax-1rid 8897  ax-rnegex 8898  ax-rrecex 8899  ax-cnre 8900  ax-pre-lttri 8901  ax-pre-lttrn 8902  ax-pre-ltadd 8903  ax-pre-mulgt0 8904  ax-pre-sup 8905
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3or 935  df-3an 936  df-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649  df-eu 2213  df-mo 2214  df-clab 2345  df-cleq 2351  df-clel 2354  df-nfc 2483  df-ne 2523  df-nel 2524  df-ral 2624  df-rex 2625  df-reu 2626  df-rmo 2627  df-rab 2628  df-v 2866  df-sbc 3068  df-csb 3158  df-dif 3231  df-un 3233  df-in 3235  df-ss 3242  df-pss 3244  df-nul 3532  df-if 3642  df-pw 3703  df-sn 3722  df-pr 3723  df-tp 3724  df-op 3725  df-uni 3909  df-int 3944  df-iun 3988  df-br 4105  df-opab 4159  df-mpt 4160  df-tr 4195  df-eprel 4387  df-id 4391  df-po 4396  df-so 4397  df-fr 4434  df-se 4435  df-we 4436  df-ord 4477  df-on 4478  df-lim 4479  df-suc 4480  df-om 4739  df-xp 4777  df-rel 4778  df-cnv 4779  df-co 4780  df-dm 4781  df-rn 4782  df-res 4783  df-ima 4784  df-iota 5301  df-fun 5339  df-fn 5340  df-f 5341  df-f1 5342  df-fo 5343  df-f1o 5344  df-fv 5345  df-isom 5346  df-ov 5948  df-oprab 5949  df-mpt2 5950  df-1st 6209  df-2nd 6210  df-riota 6391  df-recs 6475  df-rdg 6510  df-1o 6566  df-oadd 6570  df-er 6747  df-ec 6749  df-map 6862  df-en 6952  df-dom 6953  df-sdom 6954  df-fin 6955  df-sup 7284  df-oi 7315  df-card 7662  df-pnf 8959  df-mnf 8960  df-xr 8961  df-ltxr 8962  df-le 8963  df-sub 9129  df-neg 9130  df-div 9514  df-nn 9837  df-2 9894  df-3 9895  df-n0 10058  df-z 10117  df-uz 10323  df-rp 10447  df-ico 10754  df-icc 10755  df-fz 10875  df-fzo 10963  df-seq 11139  df-exp 11198  df-hash 11431  df-cj 11680  df-re 11681  df-im 11682  df-sqr 11816  df-abs 11817  df-clim 12058  df-sum 12256  df-ee 25078  df-btwn 25079  df-cgr 25080  df-colinear 25223  df-line2 25319
  Copyright terms: Public domain W3C validator