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

Theorem cgrcoml 24026
Description: Congruence commutes on the left. Biconditional version of Theorem 2.4 of [Schwabhauser] p. 27. (Contributed by Scott Fenton, 12-Jun-2013.)
Assertion
Ref Expression
cgrcoml  |-  ( ( N  e.  NN  /\  ( A  e.  ( EE `  N )  /\  B  e.  ( EE `  N ) )  /\  ( C  e.  ( EE `  N )  /\  D  e.  ( EE `  N ) ) )  ->  ( <. A ,  B >.Cgr <. C ,  D >.  <->  <. B ,  A >.Cgr <. C ,  D >. ) )

Proof of Theorem cgrcoml
StepHypRef Expression
1 simp1 957 . . . 4  |-  ( ( N  e.  NN  /\  ( A  e.  ( EE `  N )  /\  B  e.  ( EE `  N ) )  /\  ( C  e.  ( EE `  N )  /\  D  e.  ( EE `  N ) ) )  ->  N  e.  NN )
2 simp2l 983 . . . 4  |-  ( ( N  e.  NN  /\  ( A  e.  ( EE `  N )  /\  B  e.  ( EE `  N ) )  /\  ( C  e.  ( EE `  N )  /\  D  e.  ( EE `  N ) ) )  ->  A  e.  ( EE `  N ) )
3 simp2r 984 . . . 4  |-  ( ( N  e.  NN  /\  ( A  e.  ( EE `  N )  /\  B  e.  ( EE `  N ) )  /\  ( C  e.  ( EE `  N )  /\  D  e.  ( EE `  N ) ) )  ->  B  e.  ( EE `  N ) )
41, 2, 3cgrrflx2d 24014 . . 3  |-  ( ( N  e.  NN  /\  ( A  e.  ( EE `  N )  /\  B  e.  ( EE `  N ) )  /\  ( C  e.  ( EE `  N )  /\  D  e.  ( EE `  N ) ) )  ->  <. A ,  B >.Cgr
<. B ,  A >. )
5 simp3l 985 . . . 4  |-  ( ( N  e.  NN  /\  ( A  e.  ( EE `  N )  /\  B  e.  ( EE `  N ) )  /\  ( C  e.  ( EE `  N )  /\  D  e.  ( EE `  N ) ) )  ->  C  e.  ( EE `  N ) )
6 simp3r 986 . . . 4  |-  ( ( N  e.  NN  /\  ( A  e.  ( EE `  N )  /\  B  e.  ( EE `  N ) )  /\  ( C  e.  ( EE `  N )  /\  D  e.  ( EE `  N ) ) )  ->  D  e.  ( EE `  N ) )
7 axcgrtr 23950 . . . 4  |-  ( ( N  e.  NN  /\  ( A  e.  ( EE `  N )  /\  B  e.  ( EE `  N )  /\  B  e.  ( EE `  N
) )  /\  ( A  e.  ( EE `  N )  /\  C  e.  ( EE `  N
)  /\  D  e.  ( EE `  N ) ) )  ->  (
( <. A ,  B >.Cgr
<. B ,  A >.  /\ 
<. A ,  B >.Cgr <. C ,  D >. )  ->  <. B ,  A >.Cgr
<. C ,  D >. ) )
81, 2, 3, 3, 2, 5, 6, 7syl133anc 1207 . . 3  |-  ( ( N  e.  NN  /\  ( A  e.  ( EE `  N )  /\  B  e.  ( EE `  N ) )  /\  ( C  e.  ( EE `  N )  /\  D  e.  ( EE `  N ) ) )  ->  ( ( <. A ,  B >.Cgr <. B ,  A >.  /\ 
<. A ,  B >.Cgr <. C ,  D >. )  ->  <. B ,  A >.Cgr
<. C ,  D >. ) )
94, 8mpand 658 . 2  |-  ( ( N  e.  NN  /\  ( A  e.  ( EE `  N )  /\  B  e.  ( EE `  N ) )  /\  ( C  e.  ( EE `  N )  /\  D  e.  ( EE `  N ) ) )  ->  ( <. A ,  B >.Cgr <. C ,  D >.  ->  <. B ,  A >.Cgr
<. C ,  D >. ) )
101, 3, 2cgrrflx2d 24014 . . 3  |-  ( ( N  e.  NN  /\  ( A  e.  ( EE `  N )  /\  B  e.  ( EE `  N ) )  /\  ( C  e.  ( EE `  N )  /\  D  e.  ( EE `  N ) ) )  ->  <. B ,  A >.Cgr
<. A ,  B >. )
11 axcgrtr 23950 . . . 4  |-  ( ( N  e.  NN  /\  ( B  e.  ( EE `  N )  /\  A  e.  ( EE `  N )  /\  A  e.  ( EE `  N
) )  /\  ( B  e.  ( EE `  N )  /\  C  e.  ( EE `  N
)  /\  D  e.  ( EE `  N ) ) )  ->  (
( <. B ,  A >.Cgr
<. A ,  B >.  /\ 
<. B ,  A >.Cgr <. C ,  D >. )  ->  <. A ,  B >.Cgr
<. C ,  D >. ) )
121, 3, 2, 2, 3, 5, 6, 11syl133anc 1207 . . 3  |-  ( ( N  e.  NN  /\  ( A  e.  ( EE `  N )  /\  B  e.  ( EE `  N ) )  /\  ( C  e.  ( EE `  N )  /\  D  e.  ( EE `  N ) ) )  ->  ( ( <. B ,  A >.Cgr <. A ,  B >.  /\ 
<. B ,  A >.Cgr <. C ,  D >. )  ->  <. A ,  B >.Cgr
<. C ,  D >. ) )
1310, 12mpand 658 . 2  |-  ( ( N  e.  NN  /\  ( A  e.  ( EE `  N )  /\  B  e.  ( EE `  N ) )  /\  ( C  e.  ( EE `  N )  /\  D  e.  ( EE `  N ) ) )  ->  ( <. B ,  A >.Cgr <. C ,  D >.  ->  <. A ,  B >.Cgr
<. C ,  D >. ) )
149, 13impbid 185 1  |-  ( ( N  e.  NN  /\  ( A  e.  ( EE `  N )  /\  B  e.  ( EE `  N ) )  /\  ( C  e.  ( EE `  N )  /\  D  e.  ( EE `  N ) ) )  ->  ( <. A ,  B >.Cgr <. C ,  D >.  <->  <. B ,  A >.Cgr <. C ,  D >. ) )
Colors of variables: wff set class
Syntax hints:    -> wi 6    <-> wb 178    /\ wa 360    /\ w3a 936    e. wcel 1685   <.cop 3644   class class class wbr 4024   ` cfv 5221   NNcn 9741   EEcee 23923  Cgrccgr 23925
This theorem is referenced by:  cgrcomr  24027  cgrcomlr  24028  cgrcomland  24029
This theorem was proved from axioms:  ax-1 7  ax-2 8  ax-3 9  ax-mp 10  ax-gen 1534  ax-5 1545  ax-17 1604  ax-9 1637  ax-8 1645  ax-13 1687  ax-14 1689  ax-6 1704  ax-7 1709  ax-11 1716  ax-12 1867  ax-ext 2265  ax-sep 4142  ax-nul 4150  ax-pow 4187  ax-pr 4213  ax-un 4511  ax-cnex 8788  ax-resscn 8789  ax-1cn 8790  ax-icn 8791  ax-addcl 8792  ax-addrcl 8793  ax-mulcl 8794  ax-mulrcl 8795  ax-mulcom 8796  ax-addass 8797  ax-mulass 8798  ax-distr 8799  ax-i2m1 8800  ax-1ne0 8801  ax-1rid 8802  ax-rnegex 8803  ax-rrecex 8804  ax-cnre 8805  ax-pre-lttri 8806  ax-pre-lttrn 8807  ax-pre-ltadd 8808  ax-pre-mulgt0 8809
This theorem depends on definitions:  df-bi 179  df-or 361  df-an 362  df-3or 937  df-3an 938  df-tru 1312  df-ex 1530  df-nf 1533  df-sb 1632  df-eu 2148  df-mo 2149  df-clab 2271  df-cleq 2277  df-clel 2280  df-nfc 2409  df-ne 2449  df-nel 2450  df-ral 2549  df-rex 2550  df-reu 2551  df-rab 2553  df-v 2791  df-sbc 2993  df-csb 3083  df-dif 3156  df-un 3158  df-in 3160  df-ss 3167  df-pss 3169  df-nul 3457  df-if 3567  df-pw 3628  df-sn 3647  df-pr 3648  df-tp 3649  df-op 3650  df-uni 3829  df-iun 3908  df-br 4025  df-opab 4079  df-mpt 4080  df-tr 4115  df-eprel 4304  df-id 4308  df-po 4313  df-so 4314  df-fr 4351  df-we 4353  df-ord 4394  df-on 4395  df-lim 4396  df-suc 4397  df-om 4656  df-xp 4694  df-rel 4695  df-cnv 4696  df-co 4697  df-dm 4698  df-rn 4699  df-res 4700  df-ima 4701  df-fun 5223  df-fn 5224  df-f 5225  df-f1 5226  df-fo 5227  df-f1o 5228  df-fv 5229  df-ov 5822  df-oprab 5823  df-mpt2 5824  df-1st 6083  df-2nd 6084  df-iota 6252  df-riota 6299  df-recs 6383  df-rdg 6418  df-er 6655  df-map 6769  df-en 6859  df-dom 6860  df-sdom 6861  df-pnf 8864  df-mnf 8865  df-xr 8866  df-ltxr 8867  df-le 8868  df-sub 9034  df-neg 9035  df-nn 9742  df-2 9799  df-n0 9961  df-z 10020  df-uz 10226  df-fz 10777  df-seq 11041  df-exp 11099  df-sum 12153  df-ee 23926  df-cgr 23928
  Copyright terms: Public domain W3C validator