P. 321 of Theorem List - Metamath Proof Explorer

Theorem List for Metamath Proof Explorer - 32001-32100   *Has distinct variable group(s)

Type	Label	Description
Statement
Theorem	brtxpsd 32001*	Expansion of a common form used in quantifier-free definitions. (Contributed by Scott Fenton, 17-Apr-2014.) (Revised by Mario Carneiro, 19-Apr-2014.)
|- A e. _V   &    |- B e. _V   =>    |- ( -. A ran ( ( _V (x) _E ) /_\ ( R (x) _V ) ) B <-> A. x ( x e. B <-> x R A ) )
Theorem	brtxpsd2 32002*	Another common abbreviation for quantifier-free definitions. (Contributed by Scott Fenton, 21-Apr-2014.)
|- A e. _V   &    |- B e. _V   &    |- R = ( C \ ran ( ( _V (x) _E ) /_\ ( S (x) _V ) ) )   &    |- A C B   =>    |- ( A R B <-> A. x ( x e. B <-> x S A ) )
Theorem	brtxpsd3 32003*	A third common abbreviation for quantifier-free definitions. (Contributed by Scott Fenton, 3-May-2014.)
|- A e. _V   &    |- B e. _V   &    |- R = ( C \ ran ( ( _V (x) _E ) /_\ ( S (x) _V ) ) )   &    |- A C B   &    |- ( x e. X <-> x S A )   =>    |- ( A R B <-> B = X )
Theorem	relbigcup 32004	The Bigcup relationship is a relationship. (Contributed by Scott Fenton, 11-Apr-2012.)
|- Rel Bigcup
Theorem	brbigcup 32005	Binary relation over Bigcup. (Contributed by Scott Fenton, 11-Apr-2012.)
|- B e. _V   =>    |- ( A Bigcup B <-> U. A = B )
Theorem	dfbigcup2 32006	Bigcup using maps-to notation. (Contributed by Scott Fenton, 16-Apr-2012.)
|- Bigcup = ( x e. _V |-> U. x )
Theorem	fobigcup 32007	Bigcup maps the universe onto itself. (Contributed by Scott Fenton, 16-Apr-2012.)
|- Bigcup : _V -onto-> _V
Theorem	fnbigcup 32008	Bigcup is a function over the universal class. (Contributed by Scott Fenton, 11-Apr-2012.)
|- Bigcup Fn _V
Theorem	fvbigcup 32009	For sets, Bigcup yields union. (Contributed by Scott Fenton, 11-Apr-2012.)
|- A e. _V   =>    |- ( Bigcup ` A ) = U. A
Theorem	elfix 32010	Membership in the fixpoints of a class. (Contributed by Scott Fenton, 11-Apr-2012.)
|- A e. _V   =>    |- ( A e. Fix R <-> A R A )
Theorem	elfix2 32011	Alternative membership in the fixpoint of a class. (Contributed by Scott Fenton, 11-Apr-2012.)
|- Rel R   =>    |- ( A e. Fix R <-> A R A )
Theorem	dffix2 32012	The fixpoints of a class in terms of its range. (Contributed by Scott Fenton, 16-Apr-2012.)
|- Fix A = ran ( A i^i _I )
Theorem	fixssdm 32013	The fixpoints of a class are a subset of its domain. (Contributed by Scott Fenton, 16-Apr-2012.)
|- Fix A C_ dom A
Theorem	fixssrn 32014	The fixpoints of a class are a subset of its range. (Contributed by Scott Fenton, 16-Apr-2012.)
|- Fix A C_ ran A
Theorem	fixcnv 32015	The fixpoints of a class are the same as those of its converse. (Contributed by Scott Fenton, 16-Apr-2012.)
|- Fix A = Fix `' A
Theorem	fixun 32016	The fixpoint operator distributes over union. (Contributed by Scott Fenton, 16-Apr-2012.)
|- Fix ( A u. B ) = ( Fix A u. Fix B )
Theorem	ellimits 32017	Membership in the class of all limit ordinals. (Contributed by Scott Fenton, 11-Apr-2012.)
|- A e. _V   =>    |- ( A e. Limits <-> Lim A )
Theorem	limitssson 32018	The class of all limit ordinals is a subclass of the class of all ordinals. (Contributed by Scott Fenton, 11-Apr-2012.)
|- Limits C_ On
Theorem	dfom5b 32019	A quantifier-free definition of om that does not depend on ax-inf 8535. (Note: label was changed from dfom5 8547 to dfom5b 32019 to prevent naming conflict. NM, 12-Feb-2013.) (Contributed by Scott Fenton, 11-Apr-2012.)
|- om = ( On i^i |^| Limits )
Theorem	sscoid 32020	A condition for subset and composition with identity. (Contributed by Scott Fenton, 13-Apr-2018.)
|- ( A C_ ( _I o. B ) <-> ( Rel A /\ A C_ B ) )
Theorem	dffun10 32021	Another potential definition of functionhood. Based on statements in http://people.math.gatech.edu/~belinfan/research/autoreas/otter/sum/fs/. (Contributed by Scott Fenton, 30-Aug-2017.)
|- ( Fun F <-> F C_ ( _I o. ( _V \ ( ( _V \ _I ) o. F ) ) ) )
Theorem	elfuns 32022	Membership in the class of all functions. (Contributed by Scott Fenton, 18-Feb-2013.)
|- F e. _V   =>    |- ( F e. Funs <-> Fun F )
Theorem	elfunsg 32023	Closed form of elfuns 32022. (Contributed by Scott Fenton, 2-May-2014.)
|- ( F e. V -> ( F e. Funs <-> Fun F ) )
Theorem	brsingle 32024	The binary relation form of the singleton function. (Contributed by Scott Fenton, 4-Apr-2014.) (Revised by Mario Carneiro, 19-Apr-2014.)
|- A e. _V   &    |- B e. _V   =>    |- ( ASingleton B <-> B = { A } )
Theorem	elsingles 32025*	Membership in the class of all singletons. (Contributed by Scott Fenton, 19-Feb-2013.)
|- ( A e. Singletons <-> E. x A = { x } )
Theorem	fnsingle 32026	The singleton relationship is a function over the universe. (Contributed by Scott Fenton, 4-Apr-2014.) (Revised by Mario Carneiro, 19-Apr-2014.)
|- Singleton Fn _V
Theorem	fvsingle 32027	The value of the singleton function. (Contributed by Scott Fenton, 4-Apr-2014.) (Revised by Mario Carneiro, 19-Apr-2014.) (Revised by Scott Fenton, 13-Apr-2018.)
|- (Singleton ` A ) = { A }
Theorem	dfsingles2 32028*	Alternate definition of the class of all singletons. (Contributed by Scott Fenton, 20-Nov-2013.) (Revised by Mario Carneiro, 19-Apr-2014.)
|- Singletons = { x | E. y x = { y } }
Theorem	snelsingles 32029	A singleton is a member of the class of all singletons. (Contributed by Scott Fenton, 19-Feb-2013.)
|- A e. _V   =>    |- { A } e. Singletons
Theorem	dfiota3 32030	A definiton of iota using minimal quantifiers. (Contributed by Scott Fenton, 19-Feb-2013.)
|- ( iota x ph ) = U. U. ( { { x | ph } } i^i Singletons )
Theorem	dffv5 32031	Another quantifier free definition of function value. (Contributed by Scott Fenton, 19-Feb-2013.)
|- ( F ` A ) = U. U. ( { ( F " { A } ) } i^i Singletons )
Theorem	unisnif 32032	Express union of singleton in terms of if. (Contributed by Scott Fenton, 27-Mar-2014.) (Revised by Mario Carneiro, 19-Apr-2014.)
|- U. { A } = if ( A e. _V , A , (/) )
Theorem	brimage 32033	Binary relation form of the Image functor. (Contributed by Scott Fenton, 4-Apr-2014.) (Revised by Mario Carneiro, 19-Apr-2014.)
|- A e. _V   &    |- B e. _V   =>    |- ( AImage R B <-> B = ( R " A ) )
Theorem	brimageg 32034	Closed form of brimage 32033. (Contributed by Scott Fenton, 4-Apr-2014.) (Revised by Mario Carneiro, 19-Apr-2014.)
|- ( ( A e. V /\ B e. W ) -> ( AImage R B <-> B = ( R " A ) ) )
Theorem	funimage 32035	Image A is a function. (Contributed by Scott Fenton, 27-Mar-2014.) (Revised by Mario Carneiro, 19-Apr-2014.)
|- Fun Image A
Theorem	fnimage 32036*	Image R is a function over the set-like portion of R. (Contributed by Scott Fenton, 4-Apr-2014.) (Revised by Mario Carneiro, 19-Apr-2014.)
|- Image R Fn { x | ( R " x ) e. _V }
Theorem	imageval 32037*	The image functor in maps-to notation. (Contributed by Scott Fenton, 4-Apr-2014.) (Revised by Mario Carneiro, 19-Apr-2014.)
|- Image R = ( x e. _V |-> ( R " x ) )
Theorem	fvimage 32038	Value of the image functor. (Contributed by Scott Fenton, 4-Apr-2014.) (Revised by Mario Carneiro, 19-Apr-2014.)
|- ( ( A e. V /\ ( R " A ) e. W ) -> (Image R ` A ) = ( R " A ) )
Theorem	brcart 32039	Binary relation form of the cartesian product operator. (Contributed by Scott Fenton, 11-Apr-2014.) (Revised by Mario Carneiro, 19-Apr-2014.)
|- A e. _V   &    |- B e. _V   &    |- C e. _V   =>    |- ( <. A , B >.Cart C <-> C = ( A X. B ) )
Theorem	brdomain 32040	Binary relation form of the domain function. (Contributed by Scott Fenton, 11-Apr-2014.) (Revised by Mario Carneiro, 19-Apr-2014.)
|- A e. _V   &    |- B e. _V   =>    |- ( ADomain B <-> B = dom A )
Theorem	brrange 32041	Binary relation form of the range function. (Contributed by Scott Fenton, 11-Apr-2014.) (Revised by Mario Carneiro, 19-Apr-2014.)
|- A e. _V   &    |- B e. _V   =>    |- ( ARange B <-> B = ran A )
Theorem	brdomaing 32042	Closed form of brdomain 32040. (Contributed by Scott Fenton, 2-May-2014.)
|- ( ( A e. V /\ B e. W ) -> ( ADomain B <-> B = dom A ) )
Theorem	brrangeg 32043	Closed form of brrange 32041. (Contributed by Scott Fenton, 3-May-2014.)
|- ( ( A e. V /\ B e. W ) -> ( ARange B <-> B = ran A ) )
Theorem	brimg 32044	Binary relation form of the Img function. (Contributed by Scott Fenton, 12-Apr-2014.) (Revised by Mario Carneiro, 19-Apr-2014.)
|- A e. _V   &    |- B e. _V   &    |- C e. _V   =>    |- ( <. A , B >.Img C <-> C = ( A " B ) )
Theorem	brapply 32045	Binary relation form of the Apply function. (Contributed by Scott Fenton, 12-Apr-2014.) (Revised by Mario Carneiro, 19-Apr-2014.)
|- A e. _V   &    |- B e. _V   &    |- C e. _V   =>    |- ( <. A , B >.Apply C <-> C = ( A ` B ) )
Theorem	brcup 32046	Binary relation form of the Cup function. (Contributed by Scott Fenton, 14-Apr-2014.) (Revised by Mario Carneiro, 19-Apr-2014.)
|- A e. _V   &    |- B e. _V   &    |- C e. _V   =>    |- ( <. A , B >.Cup C <-> C = ( A u. B ) )
Theorem	brcap 32047	Binary relation form of the Cap function. (Contributed by Scott Fenton, 17-Apr-2014.) (Revised by Mario Carneiro, 19-Apr-2014.)
|- A e. _V   &    |- B e. _V   &    |- C e. _V   =>    |- ( <. A , B >.Cap C <-> C = ( A i^i B ) )
Theorem	brsuccf 32048	Binary relation form of the Succ function. (Contributed by Scott Fenton, 14-Apr-2014.) (Revised by Mario Carneiro, 19-Apr-2014.)
|- A e. _V   &    |- B e. _V   =>    |- ( ASucc B <-> B = suc A )
Theorem	funpartlem 32049*	Lemma for funpartfun 32050. Show membership in the restriction. (Contributed by Scott Fenton, 4-Dec-2017.)
|- ( A e. dom ( (Image F o. Singleton ) i^i ( _V X. Singletons ) ) <-> E. x ( F " { A } ) = { x } )
Theorem	funpartfun 32050	The functional part of F is a function. (Contributed by Scott Fenton, 16-Apr-2014.) (Revised by Mario Carneiro, 19-Apr-2014.)
|- Fun Funpart F
Theorem	funpartss 32051	The functional part of F is a subset of F. (Contributed by Scott Fenton, 17-Apr-2014.) (Revised by Mario Carneiro, 19-Apr-2014.)
|- Funpart F C_ F
Theorem	funpartfv 32052	The function value of the functional part is identical to the original functional value. (Contributed by Scott Fenton, 17-Apr-2014.) (Revised by Mario Carneiro, 19-Apr-2014.)
|- (Funpart F ` A ) = ( F ` A )
Theorem	fullfunfnv 32053	The full functional part of F is a function over _V. (Contributed by Scott Fenton, 17-Apr-2014.) (Revised by Mario Carneiro, 19-Apr-2014.)
|- FullFun F Fn _V
Theorem	fullfunfv 32054	The function value of the full function of F agrees with F. (Contributed by Scott Fenton, 17-Apr-2014.) (Revised by Mario Carneiro, 19-Apr-2014.)
|- (FullFun F ` A ) = ( F ` A )
Theorem	brfullfun 32055	A binary relation form condition for the full function. (Contributed by Scott Fenton, 17-Apr-2014.) (Revised by Mario Carneiro, 19-Apr-2014.)
|- A e. _V   &    |- B e. _V   =>    |- ( AFullFun F B <-> B = ( F ` A ) )
Theorem	brrestrict 32056	Binary relation form of the Restrict function. (Contributed by Scott Fenton, 17-Apr-2014.) (Revised by Mario Carneiro, 19-Apr-2014.)
|- A e. _V   &    |- B e. _V   &    |- C e. _V   =>    |- ( <. A , B >.Restrict C <-> C = ( A |` B ) )
Theorem	dfrecs2 32057	A quantifier-free definition of recs. (Contributed by Scott Fenton, 17-Jul-2020.)
|- recs ( F ) = U. ( ( Funs i^i ( `'Domain " On ) ) \ dom ( ( `' _E o. Domain ) \ Fix ( `'Apply o. (FullFun F o. Restrict ) ) ) )
Theorem	dfrdg4 32058	A quantifier-free definition of the recursive definition generator. (Contributed by Scott Fenton, 17-Apr-2014.) (Revised by Mario Carneiro, 19-Apr-2014.)
|- rec ( F , A ) = U. ( ( Funs i^i ( `'Domain " On ) ) \ dom ( ( `' _E o. Domain ) \ Fix ( `'Apply o. ( ( ( _V X. { (/) } ) X. { U. { A } } ) u. ( ( ( Bigcup o. Img ) |` ( _V X. Limits ) ) u. ( (FullFun F o. (Apply o. pprod ( _I , Bigcup ) ) ) |` ( _V X. ran Succ ) ) ) ) ) ) )
Theorem	dfint3 32059	Quantifier-free definition of class intersection. (Contributed by Scott Fenton, 13-Apr-2018.)
|- |^| A = ( _V \ ( `' ( _V \ _E ) " A ) )
Theorem	imagesset 32060	The Image functor applied to the converse of the subset relationship yields a subset of the subset relationship. (Contributed by Scott Fenton, 14-Apr-2018.)
|- Image `' SSet C_ SSet
Theorem	brub 32061*	Binary relation form of the upper bound functor. (Contributed by Scott Fenton, 3-May-2018.)
|- S e. _V   &    |- A e. _V   =>    |- ( SUB R A <-> A. x e. S x R A )
Theorem	brlb 32062*	Binary relation form of the lower bound functor. (Contributed by Scott Fenton, 3-May-2018.)
|- S e. _V   &    |- A e. _V   =>    |- ( SLB R A <-> A. x e. S A R x )
20.8.31  Alternate ordered pairs
Syntax	caltop 32063	Declare the syntax for an alternate ordered pair.
class << A , B >>
Syntax	caltxp 32064	Declare the syntax for an alternate Cartesian product.
class ( A XX. B )
Definition	df-altop 32065	An alternative definition of ordered pairs. This definition removes a hypothesis from its defining theorem (see altopth 32076), making it more convenient in some circumstances. (Contributed by Scott Fenton, 22-Mar-2012.)
|- << A , B >> = { { A } , { A , { B } } }
Definition	df-altxp 32066*	Define Cartesian products of alternative ordered pairs. (Contributed by Scott Fenton, 23-Mar-2012.)
|- ( A XX. B ) = { z | E. x e. A E. y e. B z = << x , y >> }
Theorem	altopex 32067	Alternative ordered pairs always exist. (Contributed by Scott Fenton, 22-Mar-2012.)
|- << A , B >> e. _V
Theorem	altopthsn 32068	Two alternate ordered pairs are equal iff the singletons of their respective elements are equal. Note that this holds regardless of sethood of any of the elements. (Contributed by Scott Fenton, 16-Apr-2012.)
|- ( << A , B >> = << C , D >> <-> ( { A } = { C } /\ { B } = { D } ) )
Theorem	altopeq12 32069	Equality for alternate ordered pairs. (Contributed by Scott Fenton, 22-Mar-2012.)
|- ( ( A = B /\ C = D ) -> << A , C >> = << B , D >> )
Theorem	altopeq1 32070	Equality for alternate ordered pairs. (Contributed by Scott Fenton, 22-Mar-2012.)
|- ( A = B -> << A , C >> = << B , C >> )
Theorem	altopeq2 32071	Equality for alternate ordered pairs. (Contributed by Scott Fenton, 22-Mar-2012.)
|- ( A = B -> << C , A >> = << C , B >> )
Theorem	altopth1 32072	Equality of the first members of equal alternate ordered pairs, which holds regardless of the second members' sethood. (Contributed by Scott Fenton, 22-Mar-2012.)
|- ( A e. V -> ( << A , B >> = << C , D >> -> A = C ) )
Theorem	altopth2 32073	Equality of the second members of equal alternate ordered pairs, which holds regardless of the first members' sethood. (Contributed by Scott Fenton, 22-Mar-2012.)
|- ( B e. V -> ( << A , B >> = << C , D >> -> B = D ) )
Theorem	altopthg 32074	Alternate ordered pair theorem. (Contributed by Scott Fenton, 22-Mar-2012.)
|- ( ( A e. V /\ B e. W ) -> ( << A , B >> = << C , D >> <-> ( A = C /\ B = D ) ) )
Theorem	altopthbg 32075	Alternate ordered pair theorem. (Contributed by Scott Fenton, 14-Apr-2012.)
|- ( ( A e. V /\ D e. W ) -> ( << A , B >> = << C , D >> <-> ( A = C /\ B = D ) ) )
Theorem	altopth 32076	The alternate ordered pair theorem. If two alternate ordered pairs are equal, their first elements are equal and their second elements are equal. Note that C and D are not required to be a set due to a peculiarity of our specific ordered pair definition, as opposed to the regular ordered pairs used here, which (as in opth 4945), requires D to be a set. (Contributed by Scott Fenton, 23-Mar-2012.)
|- A e. _V   &    |- B e. _V   =>    |- ( << A , B >> = << C , D >> <-> ( A = C /\ B = D ) )
Theorem	altopthb 32077	Alternate ordered pair theorem with different sethood requirements. See altopth 32076 for more comments. (Contributed by Scott Fenton, 14-Apr-2012.)
|- A e. _V   &    |- D e. _V   =>    |- ( << A , B >> = << C , D >> <-> ( A = C /\ B = D ) )
Theorem	altopthc 32078	Alternate ordered pair theorem with different sethood requirements. See altopth 32076 for more comments. (Contributed by Scott Fenton, 14-Apr-2012.)
|- B e. _V   &    |- C e. _V   =>    |- ( << A , B >> = << C , D >> <-> ( A = C /\ B = D ) )
Theorem	altopthd 32079	Alternate ordered pair theorem with different sethood requirements. See altopth 32076 for more comments. (Contributed by Scott Fenton, 14-Apr-2012.)
|- C e. _V   &    |- D e. _V   =>    |- ( << A , B >> = << C , D >> <-> ( A = C /\ B = D ) )
Theorem	altxpeq1 32080	Equality for alternate Cartesian products. (Contributed by Scott Fenton, 24-Mar-2012.)
|- ( A = B -> ( A XX. C ) = ( B XX. C ) )
Theorem	altxpeq2 32081	Equality for alternate Cartesian products. (Contributed by Scott Fenton, 24-Mar-2012.)
|- ( A = B -> ( C XX. A ) = ( C XX. B ) )
Theorem	elaltxp 32082*	Membership in alternate Cartesian products. (Contributed by Scott Fenton, 23-Mar-2012.)
|- ( X e. ( A XX. B ) <-> E. x e. A E. y e. B X = << x , y >> )
Theorem	altopelaltxp 32083	Alternate ordered pair membership in a Cartesian product. Note that, unlike opelxp 5146, there is no sethood requirement here. (Contributed by Scott Fenton, 22-Mar-2012.)
|- ( << X , Y >> e. ( A XX. B ) <-> ( X e. A /\ Y e. B ) )
Theorem	altxpsspw 32084	An inclusion rule for alternate Cartesian products. (Contributed by Scott Fenton, 24-Mar-2012.)
|- ( A XX. B ) C_ ~P ~P ( A u. ~P B )
Theorem	altxpexg 32085	The alternate Cartesian product of two sets is a set. (Contributed by Scott Fenton, 24-Mar-2012.)
|- ( ( A e. V /\ B e. W ) -> ( A XX. B ) e. _V )
Theorem	rankaltopb 32086	Compute the rank of an alternate ordered pair. (Contributed by Scott Fenton, 18-Dec-2013.) (Revised by Mario Carneiro, 19-Apr-2014.)
|- ( ( A e. U. ( R1 " On ) /\ B e. U. ( R1 " On ) ) -> ( rank ` << A , B >> ) = suc suc ( ( rank ` A ) u. suc ( rank ` B ) ) )
Theorem	nfaltop 32087	Bound-variable hypothesis builder for alternate ordered pairs. (Contributed by Scott Fenton, 25-Sep-2015.)
|- F/_ x A   &    |- F/_ x B   =>    |- F/_ x << A , B >>
Theorem	sbcaltop 32088*	Distribution of class substitution over alternate ordered pairs. (Contributed by Scott Fenton, 25-Sep-2015.)
|- ( A e. _V -> [_ A / x ]_ << C , D >> = << [_ A / x ]_ C , [_ A / x ]_ D >> )
20.8.32  Geometry in the Euclidean space
20.8.32.1  Congruence properties
Syntax	cofs 32089	Declare the syntax for the outer five segment configuration.
class OuterFiveSeg
Definition	df-ofs 32090*	The outer five segment configuration is an abbreviation for the conditions of the Five Segment Axiom (ax5seg 25818). See brofs 32112 and 5segofs 32113 for how it is used. Definition 2.10 of [Schwabhauser] p. 28. (Contributed by Scott Fenton, 21-Sep-2013.)
|- OuterFiveSeg = { <. p , q >. | E. n e. NN E. a e. ( EE ` n ) E. b e. ( EE ` n ) E. c e. ( EE ` n ) E. d e. ( EE ` n ) E. x e. ( EE ` n ) E. y e. ( EE ` n ) E. z e. ( EE ` n ) E. w e. ( EE ` n ) ( p = <. <. a , b >. , <. c , d >. >. /\ q = <. <. x , y >. , <. z , w >. >. /\ ( ( b Btwn <. a , c >. /\ y Btwn <. x , z >. ) /\ ( <. a , b >.Cgr <. x , y >. /\ <. b , c >.Cgr <. y , z >. ) /\ ( <. a , d >.Cgr <. x , w >. /\ <. b , d >.Cgr <. y , w >. ) ) ) }
Theorem	cgrrflx2d 32091	Deduction form of axcgrrflx 25794. (Contributed by Scott Fenton, 13-Oct-2013.)
|- ( ph -> N e. NN )   &    |- ( ph -> A e. ( EE ` N ) )   &    |- ( ph -> B e. ( EE ` N ) )   =>    |- ( ph -> <. A , B >.Cgr <. B , A >. )
Theorem	cgrtr4d 32092	Deduction form of axcgrtr 25795. (Contributed by Scott Fenton, 13-Oct-2013.)
|- ( ph -> N e. NN )   &    |- ( ph -> A e. ( EE ` N ) )   &    |- ( ph -> B e. ( EE ` N ) )   &    |- ( ph -> C e. ( EE ` N ) )   &    |- ( ph -> D e. ( EE ` N ) )   &    |- ( ph -> E e. ( EE ` N ) )   &    |- ( ph -> F e. ( EE ` N ) )   &    |- ( ph -> <. A , B >.Cgr <. C , D >. )   &    |- ( ph -> <. A , B >.Cgr <. E , F >. )   =>    |- ( ph -> <. C , D >.Cgr <. E , F >. )
Theorem	cgrtr4and 32093	Deduction form of axcgrtr 25795. (Contributed by Scott Fenton, 13-Oct-2013.)
|- ( ph -> N e. NN )   &    |- ( ph -> A e. ( EE ` N ) )   &    |- ( ph -> B e. ( EE ` N ) )   &    |- ( ph -> C e. ( EE ` N ) )   &    |- ( ph -> D e. ( EE ` N ) )   &    |- ( ph -> E e. ( EE ` N ) )   &    |- ( ph -> F e. ( EE ` N ) )   &    |- ( ( ph /\ ps ) -> <. A , B >.Cgr <. C , D >. )   &    |- ( ( ph /\ ps ) -> <. A , B >.Cgr <. E , F >. )   =>    |- ( ( ph /\ ps ) -> <. C , D >.Cgr <. E , F >. )
Theorem	cgrrflx 32094	Reflexivity law for congruence. Theorem 2.1 of [Schwabhauser] p. 27. (Contributed by Scott Fenton, 12-Jun-2013.)
|- ( ( N e. NN /\ A e. ( EE ` N ) /\ B e. ( EE ` N ) ) -> <. A , B >.Cgr <. A , B >. )
Theorem	cgrrflxd 32095	Deduction form of cgrrflx 32094. (Contributed by Scott Fenton, 13-Oct-2013.)
|- ( ph -> N e. NN )   &    |- ( ph -> A e. ( EE ` N ) )   &    |- ( ph -> B e. ( EE ` N ) )   =>    |- ( ph -> <. A , B >.Cgr <. A , B >. )
Theorem	cgrcomim 32096	Congruence commutes on the two sides. Implication version. Theorem 2.2 of [Schwabhauser] p. 27. (Contributed by Scott Fenton, 12-Jun-2013.)
|- ( ( N e. NN /\ ( A e. ( EE ` N ) /\ B e. ( EE ` N ) ) /\ ( C e. ( EE ` N ) /\ D e. ( EE ` N ) ) ) -> ( <. A , B >.Cgr <. C , D >. -> <. C , D >.Cgr <. A , B >. ) )
Theorem	cgrcom 32097	Congruence commutes between the two sides. (Contributed by Scott Fenton, 12-Jun-2013.)
|- ( ( N e. NN /\ ( A e. ( EE ` N ) /\ B e. ( EE ` N ) ) /\ ( C e. ( EE ` N ) /\ D e. ( EE ` N ) ) ) -> ( <. A , B >.Cgr <. C , D >. <-> <. C , D >.Cgr <. A , B >. ) )
Theorem	cgrcomand 32098	Deduction form of cgrcom 32097. (Contributed by Scott Fenton, 13-Oct-2013.)
|- ( ph -> N e. NN )   &    |- ( ph -> A e. ( EE ` N ) )   &    |- ( ph -> B e. ( EE ` N ) )   &    |- ( ph -> C e. ( EE ` N ) )   &    |- ( ph -> D e. ( EE ` N ) )   &    |- ( ( ph /\ ps ) -> <. A , B >.Cgr <. C , D >. )   =>    |- ( ( ph /\ ps ) -> <. C , D >.Cgr <. A , B >. )
Theorem	cgrtr 32099	Transitivity law for congruence. Theorem 2.3 of [Schwabhauser] p. 27. (Contributed by Scott Fenton, 24-Sep-2013.)
|- ( ( N e. NN /\ ( A e. ( EE ` N ) /\ B e. ( EE ` N ) /\ C e. ( EE ` N ) ) /\ ( D e. ( EE ` N ) /\ E e. ( EE ` N ) /\ F e. ( EE ` N ) ) ) -> ( ( <. A , B >.Cgr <. C , D >. /\ <. C , D >.Cgr <. E , F >. ) -> <. A , B >.Cgr <. E , F >. ) )
Theorem	cgrtrand 32100	Deduction form of cgrtr 32099. (Contributed by Scott Fenton, 13-Oct-2013.)
|- ( ph -> N e. NN )   &    |- ( ph -> A e. ( EE ` N ) )   &    |- ( ph -> B e. ( EE ` N ) )   &    |- ( ph -> C e. ( EE ` N ) )   &    |- ( ph -> D e. ( EE ` N ) )   &    |- ( ph -> E e. ( EE ` N ) )   &    |- ( ph -> F e. ( EE ` N ) )   &    |- ( ( ph /\ ps ) -> <. A , B >.Cgr <. C , D >. )   &    |- ( ( ph /\ ps ) -> <. C , D >.Cgr <. E , F >. )   =>    |- ( ( ph /\ ps ) -> <. A , B >.Cgr <. E , F >. )