P. 323 of Theorem List - Metamath Proof Explorer

Theorem List for Metamath Proof Explorer - 32201-32300   *Has distinct variable group(s)

Type	Label	Description
Statement
Theorem	btwnconn1lem8 32201	Lemma for btwnconn1 32208. Now, we introduce the last three points used in the construction: P, Q, and R will turn out to be equal further down, and will provide us with the key to the final statement. We begin by establishing congruence of R P and E d. (Contributed by Scott Fenton, 8-Oct-2013.)
|- ( ( ( ( N e. NN /\ A e. ( EE ` N ) /\ B e. ( EE ` N ) ) /\ ( ( C e. ( EE ` N ) /\ D e. ( EE ` N ) /\ c e. ( EE ` N ) ) /\ ( d e. ( EE ` N ) /\ b e. ( EE ` N ) /\ E e. ( EE ` N ) ) ) /\ ( P e. ( EE ` N ) /\ Q e. ( EE ` N ) /\ R e. ( EE ` N ) ) ) /\ ( ( ( ( A =/= B /\ B =/= C /\ C =/= c ) /\ ( B Btwn <. A , C >. /\ B Btwn <. A , D >. ) ) /\ ( ( D Btwn <. A , c >. /\ <. D , c >.Cgr <. C , D >. ) /\ ( C Btwn <. A , d >. /\ <. C , d >.Cgr <. C , D >. ) ) /\ ( ( c Btwn <. A , b >. /\ <. c , b >.Cgr <. C , B >. ) /\ ( d Btwn <. A , b >. /\ <. d , b >.Cgr <. D , B >. ) ) ) /\ ( ( E Btwn <. C , c >. /\ E Btwn <. D , d >. ) /\ ( ( C Btwn <. c , P >. /\ <. C , P >.Cgr <. C , d >. ) /\ ( C Btwn <. d , R >. /\ <. C , R >.Cgr <. C , E >. ) /\ ( R Btwn <. P , Q >. /\ <. R , Q >.Cgr <. R , P >. ) ) ) ) ) -> <. R , P >.Cgr <. E , d >. )
Theorem	btwnconn1lem9 32202	Lemma for btwnconn1 32208. Now, a quick use of transitivity to establish congruence on R Q and E D. (Contributed by Scott Fenton, 8-Oct-2013.)
|- ( ( ( ( N e. NN /\ A e. ( EE ` N ) /\ B e. ( EE ` N ) ) /\ ( ( C e. ( EE ` N ) /\ D e. ( EE ` N ) /\ c e. ( EE ` N ) ) /\ ( d e. ( EE ` N ) /\ b e. ( EE ` N ) /\ E e. ( EE ` N ) ) ) /\ ( P e. ( EE ` N ) /\ Q e. ( EE ` N ) /\ R e. ( EE ` N ) ) ) /\ ( ( ( ( A =/= B /\ B =/= C /\ C =/= c ) /\ ( B Btwn <. A , C >. /\ B Btwn <. A , D >. ) ) /\ ( ( D Btwn <. A , c >. /\ <. D , c >.Cgr <. C , D >. ) /\ ( C Btwn <. A , d >. /\ <. C , d >.Cgr <. C , D >. ) ) /\ ( ( c Btwn <. A , b >. /\ <. c , b >.Cgr <. C , B >. ) /\ ( d Btwn <. A , b >. /\ <. d , b >.Cgr <. D , B >. ) ) ) /\ ( ( E Btwn <. C , c >. /\ E Btwn <. D , d >. ) /\ ( ( C Btwn <. c , P >. /\ <. C , P >.Cgr <. C , d >. ) /\ ( C Btwn <. d , R >. /\ <. C , R >.Cgr <. C , E >. ) /\ ( R Btwn <. P , Q >. /\ <. R , Q >.Cgr <. R , P >. ) ) ) ) ) -> <. R , Q >.Cgr <. E , D >. )
Theorem	btwnconn1lem10 32203	Lemma for btwnconn1 32208. Now we establish a congruence that will give us D = d when we compute P = Q later on. (Contributed by Scott Fenton, 8-Oct-2013.)
|- ( ( ( ( N e. NN /\ A e. ( EE ` N ) /\ B e. ( EE ` N ) ) /\ ( ( C e. ( EE ` N ) /\ D e. ( EE ` N ) /\ c e. ( EE ` N ) ) /\ ( d e. ( EE ` N ) /\ b e. ( EE ` N ) /\ E e. ( EE ` N ) ) ) /\ ( P e. ( EE ` N ) /\ Q e. ( EE ` N ) /\ R e. ( EE ` N ) ) ) /\ ( ( ( ( A =/= B /\ B =/= C /\ C =/= c ) /\ ( B Btwn <. A , C >. /\ B Btwn <. A , D >. ) ) /\ ( ( D Btwn <. A , c >. /\ <. D , c >.Cgr <. C , D >. ) /\ ( C Btwn <. A , d >. /\ <. C , d >.Cgr <. C , D >. ) ) /\ ( ( c Btwn <. A , b >. /\ <. c , b >.Cgr <. C , B >. ) /\ ( d Btwn <. A , b >. /\ <. d , b >.Cgr <. D , B >. ) ) ) /\ ( ( E Btwn <. C , c >. /\ E Btwn <. D , d >. ) /\ ( ( C Btwn <. c , P >. /\ <. C , P >.Cgr <. C , d >. ) /\ ( C Btwn <. d , R >. /\ <. C , R >.Cgr <. C , E >. ) /\ ( R Btwn <. P , Q >. /\ <. R , Q >.Cgr <. R , P >. ) ) ) ) ) -> <. d , D >.Cgr <. P , Q >. )
Theorem	btwnconn1lem11 32204	Lemma for btwnconn1 32208. Now, we establish that D and Q are equidistant from C. (Contributed by Scott Fenton, 8-Oct-2013.)
|- ( ( ( ( N e. NN /\ A e. ( EE ` N ) /\ B e. ( EE ` N ) ) /\ ( ( C e. ( EE ` N ) /\ D e. ( EE ` N ) /\ c e. ( EE ` N ) ) /\ ( d e. ( EE ` N ) /\ b e. ( EE ` N ) /\ E e. ( EE ` N ) ) ) /\ ( P e. ( EE ` N ) /\ Q e. ( EE ` N ) /\ R e. ( EE ` N ) ) ) /\ ( ( ( ( A =/= B /\ B =/= C /\ C =/= c ) /\ ( B Btwn <. A , C >. /\ B Btwn <. A , D >. ) ) /\ ( ( D Btwn <. A , c >. /\ <. D , c >.Cgr <. C , D >. ) /\ ( C Btwn <. A , d >. /\ <. C , d >.Cgr <. C , D >. ) ) /\ ( ( c Btwn <. A , b >. /\ <. c , b >.Cgr <. C , B >. ) /\ ( d Btwn <. A , b >. /\ <. d , b >.Cgr <. D , B >. ) ) ) /\ ( ( E Btwn <. C , c >. /\ E Btwn <. D , d >. ) /\ ( ( C Btwn <. c , P >. /\ <. C , P >.Cgr <. C , d >. ) /\ ( C Btwn <. d , R >. /\ <. C , R >.Cgr <. C , E >. ) /\ ( R Btwn <. P , Q >. /\ <. R , Q >.Cgr <. R , P >. ) ) ) ) ) -> <. D , C >.Cgr <. Q , C >. )
Theorem	btwnconn1lem12 32205	Lemma for btwnconn1 32208. Using a long string of invocations of linecgr 32188, we show that D = d. (Contributed by Scott Fenton, 9-Oct-2013.)
|- ( ( ( ( N e. NN /\ A e. ( EE ` N ) /\ B e. ( EE ` N ) ) /\ ( ( C e. ( EE ` N ) /\ D e. ( EE ` N ) /\ c e. ( EE ` N ) ) /\ ( d e. ( EE ` N ) /\ b e. ( EE ` N ) /\ E e. ( EE ` N ) ) ) /\ ( P e. ( EE ` N ) /\ Q e. ( EE ` N ) /\ R e. ( EE ` N ) ) ) /\ ( ( ( ( A =/= B /\ B =/= C /\ C =/= c ) /\ ( B Btwn <. A , C >. /\ B Btwn <. A , D >. ) ) /\ ( ( D Btwn <. A , c >. /\ <. D , c >.Cgr <. C , D >. ) /\ ( C Btwn <. A , d >. /\ <. C , d >.Cgr <. C , D >. ) ) /\ ( ( c Btwn <. A , b >. /\ <. c , b >.Cgr <. C , B >. ) /\ ( d Btwn <. A , b >. /\ <. d , b >.Cgr <. D , B >. ) ) ) /\ ( ( E Btwn <. C , c >. /\ E Btwn <. D , d >. ) /\ ( ( C Btwn <. c , P >. /\ <. C , P >.Cgr <. C , d >. ) /\ ( C Btwn <. d , R >. /\ <. C , R >.Cgr <. C , E >. ) /\ ( R Btwn <. P , Q >. /\ <. R , Q >.Cgr <. R , P >. ) ) ) ) ) -> D = d )
Theorem	btwnconn1lem13 32206	Lemma for btwnconn1 32208. Begin back-filling and eliminating hypotheses. (Contributed by Scott Fenton, 9-Oct-2013.)
|- ( ( ( ( N e. NN /\ A e. ( EE ` N ) /\ B e. ( EE ` N ) ) /\ ( ( C e. ( EE ` N ) /\ D e. ( EE ` N ) /\ c e. ( EE ` N ) ) /\ ( d e. ( EE ` N ) /\ b e. ( EE ` N ) ) ) ) /\ ( ( ( A =/= B /\ B =/= C ) /\ ( B Btwn <. A , C >. /\ B Btwn <. A , D >. ) ) /\ ( ( D Btwn <. A , c >. /\ <. D , c >.Cgr <. C , D >. ) /\ ( C Btwn <. A , d >. /\ <. C , d >.Cgr <. C , D >. ) ) /\ ( ( c Btwn <. A , b >. /\ <. c , b >.Cgr <. C , B >. ) /\ ( d Btwn <. A , b >. /\ <. d , b >.Cgr <. D , B >. ) ) ) ) -> ( C = c \/ D = d ) )
Theorem	btwnconn1lem14 32207	Lemma for btwnconn1 32208. Final statement of the theorem when B =/= C. (Contributed by Scott Fenton, 9-Oct-2013.)
|- ( ( ( N e. NN /\ ( A e. ( EE ` N ) /\ B e. ( EE ` N ) ) /\ ( C e. ( EE ` N ) /\ D e. ( EE ` N ) ) ) /\ ( ( A =/= B /\ B =/= C ) /\ ( B Btwn <. A , C >. /\ B Btwn <. A , D >. ) ) ) -> ( C Btwn <. A , D >. \/ D Btwn <. A , C >. ) )
Theorem	btwnconn1 32208	Connectitivy law for betweenness. Theorem 5.1 of [Schwabhauser] p. 39-41. (Contributed by Scott Fenton, 9-Oct-2013.)
|- ( ( N e. NN /\ ( A e. ( EE ` N ) /\ B e. ( EE ` N ) ) /\ ( C e. ( EE ` N ) /\ D e. ( EE ` N ) ) ) -> ( ( A =/= B /\ B Btwn <. A , C >. /\ B Btwn <. A , D >. ) -> ( C Btwn <. A , D >. \/ D Btwn <. A , C >. ) ) )
Theorem	btwnconn2 32209	Another connectivity law for betweenness. Theorem 5.2 of [Schwabhauser] p. 41. (Contributed by Scott Fenton, 9-Oct-2013.)
|- ( ( N e. NN /\ ( A e. ( EE ` N ) /\ B e. ( EE ` N ) ) /\ ( C e. ( EE ` N ) /\ D e. ( EE ` N ) ) ) -> ( ( A =/= B /\ B Btwn <. A , C >. /\ B Btwn <. A , D >. ) -> ( C Btwn <. B , D >. \/ D Btwn <. B , C >. ) ) )
Theorem	btwnconn3 32210	Inner connectivity law for betweenness. Theorem 5.3 of [Schwabhauser] p. 41. (Contributed by Scott Fenton, 9-Oct-2013.)
|- ( ( N e. NN /\ ( A e. ( EE ` N ) /\ B e. ( EE ` N ) ) /\ ( C e. ( EE ` N ) /\ D e. ( EE ` N ) ) ) -> ( ( B Btwn <. A , D >. /\ C Btwn <. A , D >. ) -> ( B Btwn <. A , C >. \/ C Btwn <. A , B >. ) ) )
Theorem	midofsegid 32211	If two points fall in the same place in the middle of a segment, then they are identical. (Contributed by Scott Fenton, 16-Oct-2013.) (Revised by Mario Carneiro, 19-Apr-2014.)
|- ( ( N e. NN /\ ( A e. ( EE ` N ) /\ B e. ( EE ` N ) ) /\ ( D e. ( EE ` N ) /\ E e. ( EE ` N ) ) ) -> ( ( D Btwn <. A , B >. /\ E Btwn <. A , B >. /\ <. A , D >.Cgr <. A , E >. ) -> D = E ) )
Theorem	segcon2 32212*	Generalization of axsegcon 25807. This time, we generate an endpoint for a segment on the ray Q A congruent to B C and starting at Q, as opposed to axsegcon 25807, where the segment starts at A (Contributed by Scott Fenton, 14-Oct-2013.) (Removed unneeded inequality, 15-Oct-2013.)
|- ( ( N e. NN /\ ( Q e. ( EE ` N ) /\ A e. ( EE ` N ) ) /\ ( B e. ( EE ` N ) /\ C e. ( EE ` N ) ) ) -> E. x e. ( EE ` N ) ( ( A Btwn <. Q , x >. \/ x Btwn <. Q , A >. ) /\ <. Q , x >.Cgr <. B , C >. ) )
20.8.32.6  Segment less than or equal to
Syntax	csegle 32213	Declare the constant for the segment less than or equal to relationship.
class Seg<_
Definition	df-segle 32214*	Define the segment length comparison relationship. This relationship expresses that the segment A B is no longer than C D. In this section, we establish various properties of this relationship showing that it is a transitive, reflexive relationship on pairs of points that is substitutive under congruence. Definition 5.4 of [Schwabhauser] p. 41. (Contributed by Scott Fenton, 11-Oct-2013.)
|- Seg<_ = { <. 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 ) ( p = <. a , b >. /\ q = <. c , d >. /\ E. y e. ( EE ` n ) ( y Btwn <. c , d >. /\ <. a , b >.Cgr <. c , y >. ) ) }
Theorem	brsegle 32215*	Binary relation form of the segment comparison relationship. (Contributed by Scott Fenton, 11-Oct-2013.)
|- ( ( N e. NN /\ ( A e. ( EE ` N ) /\ B e. ( EE ` N ) ) /\ ( C e. ( EE ` N ) /\ D e. ( EE ` N ) ) ) -> ( <. A , B >. Seg<_ <. C , D >. <-> E. y e. ( EE ` N ) ( y Btwn <. C , D >. /\ <. A , B >.Cgr <. C , y >. ) ) )
Theorem	brsegle2 32216*	Alternate characterization of segment comparison. Theorem 5.5 of [Schwabhauser] p. 41-42. (Contributed by Scott Fenton, 11-Oct-2013.)
|- ( ( N e. NN /\ ( A e. ( EE ` N ) /\ B e. ( EE ` N ) ) /\ ( C e. ( EE ` N ) /\ D e. ( EE ` N ) ) ) -> ( <. A , B >. Seg<_ <. C , D >. <-> E. x e. ( EE ` N ) ( B Btwn <. A , x >. /\ <. A , x >.Cgr <. C , D >. ) ) )
Theorem	seglecgr12im 32217	Substitution law for segment comparison under congruence. Theorem 5.6 of [Schwabhauser] p. 42. (Contributed by Scott Fenton, 11-Oct-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 ) /\ G e. ( EE ` N ) /\ H e. ( EE ` N ) ) ) -> ( ( <. A , B >.Cgr <. E , F >. /\ <. C , D >.Cgr <. G , H >. /\ <. A , B >. Seg<_ <. C , D >. ) -> <. E , F >. Seg<_ <. G , H >. ) )
Theorem	seglecgr12 32218	Substitution law for segment comparison under congruence. Biconditional version. (Contributed by Scott Fenton, 15-Oct-2013.) (Revised by Mario Carneiro, 19-Apr-2014.)
|- ( ( ( 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 ) /\ G e. ( EE ` N ) /\ H e. ( EE ` N ) ) ) -> ( ( <. A , B >.Cgr <. E , F >. /\ <. C , D >.Cgr <. G , H >. ) -> ( <. A , B >. Seg<_ <. C , D >. <-> <. E , F >. Seg<_ <. G , H >. ) ) )
Theorem	seglerflx 32219	Segment comparison is reflexive. Theorem 5.7 of [Schwabhauser] p. 42. (Contributed by Scott Fenton, 11-Oct-2013.)
|- ( ( N e. NN /\ A e. ( EE ` N ) /\ B e. ( EE ` N ) ) -> <. A , B >. Seg<_ <. A , B >. )
Theorem	seglemin 32220	Any segment is at least as long as a degenerate segment. Theorem 5.11 of [Schwabhauser] p. 42. (Contributed by Scott Fenton, 11-Oct-2013.)
|- ( ( N e. NN /\ ( A e. ( EE ` N ) /\ B e. ( EE ` N ) /\ C e. ( EE ` N ) ) ) -> <. A , A >. Seg<_ <. B , C >. )
Theorem	segletr 32221	Segment less than is transitive. Theorem 5.8 of [Schwabhauser] p. 42. (Contributed by Scott Fenton, 11-Oct-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 >. Seg<_ <. C , D >. /\ <. C , D >. Seg<_ <. E , F >. ) -> <. A , B >. Seg<_ <. E , F >. ) )
Theorem	segleantisym 32222	Antisymmetry law for segment comparison. Theorem 5.9 of [Schwabhauser] p. 42. (Contributed by Scott Fenton, 14-Oct-2013.)
|- ( ( N e. NN /\ ( A e. ( EE ` N ) /\ B e. ( EE ` N ) ) /\ ( C e. ( EE ` N ) /\ D e. ( EE ` N ) ) ) -> ( ( <. A , B >. Seg<_ <. C , D >. /\ <. C , D >. Seg<_ <. A , B >. ) -> <. A , B >.Cgr <. C , D >. ) )
Theorem	seglelin 32223	Linearity law for segment comparison. Theorem 5.10 of [Schwabhauser] p. 42. (Contributed by Scott Fenton, 14-Oct-2013.)
|- ( ( N e. NN /\ ( A e. ( EE ` N ) /\ B e. ( EE ` N ) ) /\ ( C e. ( EE ` N ) /\ D e. ( EE ` N ) ) ) -> ( <. A , B >. Seg<_ <. C , D >. \/ <. C , D >. Seg<_ <. A , B >. ) )
Theorem	btwnsegle 32224	If B falls between A and C, then A B is no longer than A C. (Contributed by Scott Fenton, 16-Oct-2013.) (Revised by Mario Carneiro, 19-Apr-2014.)
|- ( ( N e. NN /\ ( A e. ( EE ` N ) /\ B e. ( EE ` N ) /\ C e. ( EE ` N ) ) ) -> ( B Btwn <. A , C >. -> <. A , B >. Seg<_ <. A , C >. ) )
Theorem	colinbtwnle 32225	Given three colinear points A, B, and C, B falls in the middle iff the two segments to B are no longer than A C. Theorem 5.12 of [Schwabhauser] p. 42. (Contributed by Scott Fenton, 15-Oct-2013.) (Revised by Mario Carneiro, 19-Apr-2014.)
|- ( ( N e. NN /\ ( A e. ( EE ` N ) /\ B e. ( EE ` N ) /\ C e. ( EE ` N ) ) ) -> ( A Colinear <. B , C >. -> ( B Btwn <. A , C >. <-> ( <. A , B >. Seg<_ <. A , C >. /\ <. B , C >. Seg<_ <. A , C >. ) ) ) )
20.8.32.7  Outside-of relationship
Syntax	coutsideof 32226	Declare the syntax for the outside of constant.
class OutsideOf
Definition	df-outsideof 32227	The outside of relationship. This relationship expresses that P, A, and B fall on a line, but P is not on the segment A B. This definition is taken from theorem 6.4 of [Schwabhauser] p. 43, since it requires no dummy variables. (Contributed by Scott Fenton, 17-Oct-2013.)
|- OutsideOf = ( Colinear \ Btwn )
Theorem	broutsideof 32228	Binary relation form of OutsideOf. Theorem 6.4 of [Schwabhauser] p. 43. (Contributed by Scott Fenton, 17-Oct-2013.) (Revised by Mario Carneiro, 19-Apr-2014.)
|- ( POutsideOf <. A , B >. <-> ( P Colinear <. A , B >. /\ -. P Btwn <. A , B >. ) )
Theorem	broutsideof2 32229	Alternate form of OutsideOf. Definition 6.1 of [Schwabhauser] p. 43. (Contributed by Scott Fenton, 17-Oct-2013.) (Revised by Mario Carneiro, 19-Apr-2014.)
|- ( ( N e. NN /\ ( P e. ( EE ` N ) /\ A e. ( EE ` N ) /\ B e. ( EE ` N ) ) ) -> ( POutsideOf <. A , B >. <-> ( A =/= P /\ B =/= P /\ ( A Btwn <. P , B >. \/ B Btwn <. P , A >. ) ) ) )
Theorem	outsidene1 32230	Outsideness implies inequality. (Contributed by Scott Fenton, 18-Oct-2013.) (Revised by Mario Carneiro, 19-Apr-2014.)
|- ( ( N e. NN /\ ( P e. ( EE ` N ) /\ A e. ( EE ` N ) /\ B e. ( EE ` N ) ) ) -> ( POutsideOf <. A , B >. -> A =/= P ) )
Theorem	outsidene2 32231	Outsideness implies inequality. (Contributed by Scott Fenton, 18-Oct-2013.) (Revised by Mario Carneiro, 19-Apr-2014.)
|- ( ( N e. NN /\ ( P e. ( EE ` N ) /\ A e. ( EE ` N ) /\ B e. ( EE ` N ) ) ) -> ( POutsideOf <. A , B >. -> B =/= P ) )
Theorem	btwnoutside 32232	A principle linking outsideness to betweenness. Theorem 6.2 of [Schwabhauser] p. 43. (Contributed by Scott Fenton, 18-Oct-2013.) (Revised by Mario Carneiro, 19-Apr-2014.)
|- ( ( N e. NN /\ ( A e. ( EE ` N ) /\ B e. ( EE ` N ) ) /\ ( C e. ( EE ` N ) /\ P e. ( EE ` N ) ) ) -> ( ( ( A =/= P /\ B =/= P /\ C =/= P ) /\ P Btwn <. A , C >. ) -> ( P Btwn <. B , C >. <-> POutsideOf <. A , B >. ) ) )
Theorem	broutsideof3 32233*	Characterization of outsideness in terms of relationship to a fourth point. Theorem 6.3 of [Schwabhauser] p. 43. (Contributed by Scott Fenton, 18-Oct-2013.) (Revised by Mario Carneiro, 19-Apr-2014.)
|- ( ( N e. NN /\ ( P e. ( EE ` N ) /\ A e. ( EE ` N ) /\ B e. ( EE ` N ) ) ) -> ( POutsideOf <. A , B >. <-> ( A =/= P /\ B =/= P /\ E. c e. ( EE ` N ) ( c =/= P /\ P Btwn <. A , c >. /\ P Btwn <. B , c >. ) ) ) )
Theorem	outsideofrflx 32234	Reflexitivity of outsideness. Theorem 6.5 of [Schwabhauser] p. 44. (Contributed by Scott Fenton, 18-Oct-2013.) (Revised by Mario Carneiro, 19-Apr-2014.)
|- ( ( N e. NN /\ P e. ( EE ` N ) /\ A e. ( EE ` N ) ) -> ( A =/= P -> POutsideOf <. A , A >. ) )
Theorem	outsideofcom 32235	Commutitivity law for outsideness. Theorem 6.6 of [Schwabhauser] p. 44. (Contributed by Scott Fenton, 18-Oct-2013.) (Revised by Mario Carneiro, 19-Apr-2014.)
|- ( ( N e. NN /\ ( P e. ( EE ` N ) /\ A e. ( EE ` N ) /\ B e. ( EE ` N ) ) ) -> ( POutsideOf <. A , B >. <-> POutsideOf <. B , A >. ) )
Theorem	outsideoftr 32236	Transitivity law for outsideness. Theorem 6.7 of [Schwabhauser] p. 44. (Contributed by Scott Fenton, 18-Oct-2013.) (Revised by Mario Carneiro, 19-Apr-2014.)
|- ( ( N e. NN /\ ( A e. ( EE ` N ) /\ B e. ( EE ` N ) ) /\ ( C e. ( EE ` N ) /\ P e. ( EE ` N ) ) ) -> ( ( POutsideOf <. A , B >. /\ POutsideOf <. B , C >. ) -> POutsideOf <. A , C >. ) )
Theorem	outsideofeq 32237	Uniqueness law for OutsideOf. Analogue of segconeq 32117. (Contributed by Scott Fenton, 24-Oct-2013.) (Revised by Mario Carneiro, 19-Apr-2014.)
|- ( ( N e. NN /\ ( A e. ( EE ` N ) /\ R e. ( EE ` N ) /\ B e. ( EE ` N ) ) /\ ( C e. ( EE ` N ) /\ X e. ( EE ` N ) /\ Y e. ( EE ` N ) ) ) -> ( ( ( AOutsideOf <. X , R >. /\ <. A , X >.Cgr <. B , C >. ) /\ ( AOutsideOf <. Y , R >. /\ <. A , Y >.Cgr <. B , C >. ) ) -> X = Y ) )
Theorem	outsideofeu 32238*	Given a non-degenerate ray, there is a unique point congruent to the segment B C lying on the ray A R. Theorem 6.11 of [Schwabhauser] p. 44. (Contributed by Scott Fenton, 23-Oct-2013.) (Revised by Mario Carneiro, 19-Apr-2014.)
|- ( ( N e. NN /\ ( A e. ( EE ` N ) /\ R e. ( EE ` N ) ) /\ ( B e. ( EE ` N ) /\ C e. ( EE ` N ) ) ) -> ( ( R =/= A /\ B =/= C ) -> E! x e. ( EE ` N ) ( AOutsideOf <. x , R >. /\ <. A , x >.Cgr <. B , C >. ) ) )
Theorem	outsidele 32239	Relate OutsideOf to Seg<_. Theorem 6.13 of [Schwabhauser] p. 45. (Contributed by Scott Fenton, 24-Oct-2013.) (Revised by Mario Carneiro, 19-Apr-2014.)
|- ( ( N e. NN /\ ( P e. ( EE ` N ) /\ A e. ( EE ` N ) /\ B e. ( EE ` N ) ) ) -> ( POutsideOf <. A , B >. -> ( <. P , A >. Seg<_ <. P , B >. <-> A Btwn <. P , B >. ) ) )
Theorem	outsideofcol 32240	Outside of implies colinearity. (Contributed by Scott Fenton, 26-Oct-2013.) (Revised by Mario Carneiro, 19-Apr-2014.)
|- ( POutsideOf <. Q , R >. -> P Colinear <. Q , R >. )
20.8.32.8  Lines and Rays
Syntax	cline2 32241	Declare the constant for the line function.
class Line
Syntax	cray 32242	Declare the constant for the ray function.
class Ray
Syntax	clines2 32243	Declare the constant for the set of all lines.
class LinesEE
Definition	df-line2 32244*	Define the Line function. This function generates the line passing through the distinct points a and b. Adapted from definition 6.14 of [Schwabhauser] p. 45. (Contributed by Scott Fenton, 25-Oct-2013.)
|- Line = { <. <. a , b >. , l >. | E. n e. NN ( ( a e. ( EE ` n ) /\ b e. ( EE ` n ) /\ a =/= b ) /\ l = [ <. a , b >. ] `' Colinear ) }
Definition	df-ray 32245*	Define the Ray function. This function generates the set of all points that lie on the ray starting at p and passing through a. Definition 6.8 of [Schwabhauser] p. 44. (Contributed by Scott Fenton, 21-Oct-2013.)
|- Ray = { <. <. p , a >. , r >. | E. n e. NN ( ( p e. ( EE ` n ) /\ a e. ( EE ` n ) /\ p =/= a ) /\ r = { x e. ( EE ` n ) | pOutsideOf <. a , x >. } ) }
Definition	df-lines2 32246	Define the set of all lines. Definition 6.14, part 2 of [Schwabhauser] p. 45. See ellines 32259 for membership. (Contributed by Scott Fenton, 28-Oct-2013.)
|- LinesEE = ran Line
Theorem	funray 32247	Show that the Ray relationship is a function. (Contributed by Scott Fenton, 21-Oct-2013.) (Revised by Mario Carneiro, 19-Apr-2014.)
|- Fun Ray
Theorem	fvray 32248*	Calculate the value of the Ray function. (Contributed by Scott Fenton, 21-Oct-2013.) (Revised by Mario Carneiro, 19-Apr-2014.)
|- ( ( N e. NN /\ ( P e. ( EE ` N ) /\ A e. ( EE ` N ) /\ P =/= A ) ) -> ( PRay A ) = { x e. ( EE ` N ) | POutsideOf <. A , x >. } )
Theorem	funline 32249	Show that the Line relationship is a function. (Contributed by Scott Fenton, 25-Oct-2013.) (Revised by Mario Carneiro, 19-Apr-2014.)
|- Fun Line
Theorem	linedegen 32250	When Line is applied with the same argument, the result is the empty set. (Contributed by Scott Fenton, 29-Oct-2013.) (Revised by Mario Carneiro, 19-Apr-2014.)
|- ( ALine A ) = (/)
Theorem	fvline 32251*	Calculate the value of the Line function. (Contributed by Scott Fenton, 25-Oct-2013.) (Revised by Mario Carneiro, 19-Apr-2014.)
|- ( ( N e. NN /\ ( A e. ( EE ` N ) /\ B e. ( EE ` N ) /\ A =/= B ) ) -> ( ALine B ) = { x | x Colinear <. A , B >. } )
Theorem	liness 32252	A line is a subset of the space its two points lie in. (Contributed by Scott Fenton, 25-Oct-2013.) (Revised by Mario Carneiro, 19-Apr-2014.)
|- ( ( N e. NN /\ ( A e. ( EE ` N ) /\ B e. ( EE ` N ) /\ A =/= B ) ) -> ( ALine B ) C_ ( EE ` N ) )
Theorem	fvline2 32253*	Alternate definition of a line. (Contributed by Scott Fenton, 25-Oct-2013.) (Revised by Mario Carneiro, 19-Apr-2014.)
|- ( ( N e. NN /\ ( A e. ( EE ` N ) /\ B e. ( EE ` N ) /\ A =/= B ) ) -> ( ALine B ) = { x e. ( EE ` N ) | x Colinear <. A , B >. } )
Theorem	lineunray 32254	A line is composed of a point and the two rays emerging from it. Theorem 6.15 of [Schwabhauser] p. 45. (Contributed by Scott Fenton, 26-Oct-2013.) (Revised by Mario Carneiro, 19-Apr-2014.)
|- ( ( N e. NN /\ ( P e. ( EE ` N ) /\ Q e. ( EE ` N ) /\ R e. ( EE ` N ) ) /\ ( P =/= Q /\ P =/= R ) ) -> ( P Btwn <. Q , R >. -> ( PLine Q ) = ( ( ( PRay Q ) u. { P } ) u. ( PRay R ) ) ) )
Theorem	lineelsb2 32255	If S lies on P Q, then P Q = P S. Theorem 6.16 of [Schwabhauser] p. 45. (Contributed by Scott Fenton, 27-Oct-2013.) (Revised by Mario Carneiro, 19-Apr-2014.)
|- ( ( N e. NN /\ ( P e. ( EE ` N ) /\ Q e. ( EE ` N ) /\ P =/= Q ) /\ ( S e. ( EE ` N ) /\ P =/= S ) ) -> ( S e. ( PLine Q ) -> ( PLine Q ) = ( PLine S ) ) )
Theorem	linerflx1 32256	Reflexivity law for line membership. Part of theorem 6.17 of [Schwabhauser] p. 45. (Contributed by Scott Fenton, 28-Oct-2013.) (Revised by Mario Carneiro, 19-Apr-2014.)
|- ( ( N e. NN /\ ( P e. ( EE ` N ) /\ Q e. ( EE ` N ) /\ P =/= Q ) ) -> P e. ( PLine Q ) )
Theorem	linecom 32257	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.)
|- ( ( N e. NN /\ ( P e. ( EE ` N ) /\ Q e. ( EE ` N ) /\ P =/= Q ) ) -> ( PLine Q ) = ( QLine P ) )
Theorem	linerflx2 32258	Reflexivity law for line membership. Part of theorem 6.17 of [Schwabhauser] p. 45. (Contributed by Scott Fenton, 28-Oct-2013.) (Revised by Mario Carneiro, 19-Apr-2014.)
|- ( ( N e. NN /\ ( P e. ( EE ` N ) /\ Q e. ( EE ` N ) /\ P =/= Q ) ) -> Q e. ( PLine Q ) )
Theorem	ellines 32259*	Membership in the set of all lines. (Contributed by Scott Fenton, 28-Oct-2013.) (Revised by Mario Carneiro, 19-Apr-2014.)
|- ( A e. LinesEE <-> E. n e. NN E. p e. ( EE ` n ) E. q e. ( EE ` n ) ( p =/= q /\ A = ( pLine q ) ) )
Theorem	linethru 32260	If A is a line containing two distinct points P and Q, then A is the line through P and Q. Theorem 6.18 of [Schwabhauser] p. 45. (Contributed by Scott Fenton, 28-Oct-2013.) (Revised by Mario Carneiro, 19-Apr-2014.)
|- ( ( A e. LinesEE /\ ( P e. A /\ Q e. A ) /\ P =/= Q ) -> A = ( PLine Q ) )
Theorem	hilbert1.1 32261*	There is a line through any two distinct points. Hilbert's axiom I.1 for geometry. (Contributed by Scott Fenton, 29-Oct-2013.) (Revised by Mario Carneiro, 19-Apr-2014.)
|- ( ( N e. NN /\ ( P e. ( EE ` N ) /\ Q e. ( EE ` N ) /\ P =/= Q ) ) -> E. x e. LinesEE ( P e. x /\ Q e. x ) )
Theorem	hilbert1.2 32262*	There is at most one line through any two distinct points. Hilbert's axiom I.2 for geometry. (Contributed by Scott Fenton, 29-Oct-2013.) (Revised by NM, 17-Jun-2017.)
|- ( P =/= Q -> E* x e. LinesEE ( P e. x /\ Q e. x ) )
Theorem	linethrueu 32263*	There is a unique line going through any two distinct points. Theorem 6.19 of [Schwabhauser] p. 46. (Contributed by Scott Fenton, 29-Oct-2013.) (Revised by Mario Carneiro, 19-Apr-2014.)
|- ( ( N e. NN /\ ( P e. ( EE ` N ) /\ Q e. ( EE ` N ) /\ P =/= Q ) ) -> E! x e. LinesEE ( P e. x /\ Q e. x ) )
Theorem	lineintmo 32264*	Two distinct lines intersect in at most one point. Theorem 6.21 of [Schwabhauser] p. 46. (Contributed by Scott Fenton, 29-Oct-2013.) (Revised by Mario Carneiro, 19-Apr-2014.)
|- ( ( A e. LinesEE /\ B e. LinesEE /\ A =/= B ) -> E* x ( x e. A /\ x e. B ) )
20.8.33  Forward difference
Syntax	cfwddif 32265	Declare the syntax for the forward difference operator.
class _/_\
Definition	df-fwddif 32266*	Define the forward difference operator. This is a discrete analogue of the derivative operator. Definition 2.42 of [GramKnuthPat], p. 47. (Contributed by Scott Fenton, 18-May-2020.)
|- _/_\ = ( f e. ( CC ^pm CC ) |-> ( x e. { y e. dom f | ( y + 1 ) e. dom f } |-> ( ( f ` ( x + 1 ) ) - ( f ` x ) ) ) )
Syntax	cfwddifn 32267	Declare the syntax for the nth forward difference operator.
class _/_\^nn
Definition	df-fwddifn 32268*	Define the nth forward difference operator. This works out to be the forward difference operator iterated n times. (Contributed by Scott Fenton, 28-May-2020.)
|- _/_\^nn = ( n e. NN0 , f e. ( CC ^pm CC ) |-> ( x e. { y e. CC | A. k e. ( 0 ... n ) ( y + k ) e. dom f } |-> sum_ k e. ( 0 ... n ) ( ( n _C k ) x. ( ( -u 1 ^ ( n - k ) ) x. ( f ` ( x + k ) ) ) ) ) )
Theorem	fwddifval 32269	Calculate the value of the forward difference operator at a point. (Contributed by Scott Fenton, 18-May-2020.)
|- ( ph -> A C_ CC )   &    |- ( ph -> F : A --> CC )   &    |- ( ph -> X e. A )   &    |- ( ph -> ( X + 1 ) e. A )   =>    |- ( ph -> ( ( _/_\ ` F ) ` X ) = ( ( F ` ( X + 1 ) ) - ( F ` X ) ) )
Theorem	fwddifnval 32270*	The value of the forward difference operator at a point. (Contributed by Scott Fenton, 28-May-2020.)
|- ( ph -> N e. NN0 )   &    |- ( ph -> A C_ CC )   &    |- ( ph -> F : A --> CC )   &    |- ( ph -> X e. CC )   &    |- ( ( ph /\ k e. ( 0 ... N ) ) -> ( X + k ) e. A )   =>    |- ( ph -> ( ( N _/_\^nn F ) ` X ) = sum_ k e. ( 0 ... N ) ( ( N _C k ) x. ( ( -u 1 ^ ( N - k ) ) x. ( F ` ( X + k ) ) ) ) )
Theorem	fwddifn0 32271	The value of the n-iterated forward difference operator at zero is just the function value. (Contributed by Scott Fenton, 28-May-2020.)
|- ( ph -> A C_ CC )   &    |- ( ph -> F : A --> CC )   &    |- ( ph -> X e. A )   =>    |- ( ph -> ( ( 0 _/_\^nn F ) ` X ) = ( F ` X ) )
Theorem	fwddifnp1 32272*	The value of the n-iterated forward difference at a successor. (Contributed by Scott Fenton, 28-May-2020.)
|- ( ph -> N e. NN0 )   &    |- ( ph -> A C_ CC )   &    |- ( ph -> F : A --> CC )   &    |- ( ph -> X e. CC )   &    |- ( ( ph /\ k e. ( 0 ... ( N + 1 ) ) ) -> ( X + k ) e. A )   =>    |- ( ph -> ( ( ( N + 1 ) _/_\^nn F ) ` X ) = ( ( ( N _/_\^nn F ) ` ( X + 1 ) ) - ( ( N _/_\^nn F ) ` X ) ) )
20.8.34  Rank theorems
Theorem	rankung 32273	The rank of the union of two sets. Closed form of rankun 8719. (Contributed by Scott Fenton, 15-Jul-2015.)
|- ( ( A e. V /\ B e. W ) -> ( rank ` ( A u. B ) ) = ( ( rank ` A ) u. ( rank ` B ) ) )
Theorem	ranksng 32274	The rank of a singleton. Closed form of ranksn 8717. (Contributed by Scott Fenton, 15-Jul-2015.)
|- ( A e. V -> ( rank ` { A } ) = suc ( rank ` A ) )
Theorem	rankelg 32275	The membership relation is inherited by the rank function. Closed form of rankel 8702. (Contributed by Scott Fenton, 16-Jul-2015.)
|- ( ( B e. V /\ A e. B ) -> ( rank ` A ) e. ( rank ` B ) )
Theorem	rankpwg 32276	The rank of a power set. Closed form of rankpw 8706. (Contributed by Scott Fenton, 16-Jul-2015.)
|- ( A e. V -> ( rank ` ~P A ) = suc ( rank ` A ) )
Theorem	rank0 32277	The rank of the empty set is (/). (Contributed by Scott Fenton, 17-Jul-2015.)
|- ( rank ` (/) ) = (/)
Theorem	rankeq1o 32278	The only set with rank 1o is the singleton of the empty set. (Contributed by Scott Fenton, 17-Jul-2015.)
|- ( ( rank ` A ) = 1o <-> A = { (/) } )
20.8.35  Hereditarily Finite Sets
Syntax	chf 32279	The constant Hf is a class.
class Hf
Definition	df-hf 32280	Define the hereditarily finite sets. These are the finite sets whose elements are finite, and so forth. (Contributed by Scott Fenton, 9-Jul-2015.)
|- Hf = U. ( R1 " om )
Theorem	elhf 32281*	Membership in the hereditarily finite sets. (Contributed by Scott Fenton, 9-Jul-2015.)
|- ( A e. Hf <-> E. x e. om A e. ( R1 ` x ) )
Theorem	elhf2 32282	Alternate form of membership in the hereditarily finite sets. (Contributed by Scott Fenton, 13-Jul-2015.)
|- A e. _V   =>    |- ( A e. Hf <-> ( rank ` A ) e. om )
Theorem	elhf2g 32283	Hereditarily finiteness via rank. Closed form of elhf2 32282. (Contributed by Scott Fenton, 15-Jul-2015.)
|- ( A e. V -> ( A e. Hf <-> ( rank ` A ) e. om ) )
Theorem	0hf 32284	The empty set is a hereditarily finite set. (Contributed by Scott Fenton, 9-Jul-2015.)
|- (/) e. Hf
Theorem	hfun 32285	The union of two HF sets is an HF set. (Contributed by Scott Fenton, 15-Jul-2015.)
|- ( ( A e. Hf /\ B e. Hf ) -> ( A u. B ) e. Hf )
Theorem	hfsn 32286	The singleton of an HF set is an HF set. (Contributed by Scott Fenton, 15-Jul-2015.)
|- ( A e. Hf -> { A } e. Hf )
Theorem	hfadj 32287	Adjoining one HF element to an HF set preserves HF status. (Contributed by Scott Fenton, 15-Jul-2015.)
|- ( ( A e. Hf /\ B e. Hf ) -> ( A u. { B } ) e. Hf )
Theorem	hfelhf 32288	Any member of an HF set is itself an HF set. (Contributed by Scott Fenton, 16-Jul-2015.)
|- ( ( A e. B /\ B e. Hf ) -> A e. Hf )
Theorem	hftr 32289	The class of all hereditarily finite sets is transitive. (Contributed by Scott Fenton, 16-Jul-2015.)
|- Tr Hf
Theorem	hfext 32290*	Extensionality for HF sets depends only on comparison of HF elements. (Contributed by Scott Fenton, 16-Jul-2015.)
|- ( ( A e. Hf /\ B e. Hf ) -> ( A = B <-> A. x e. Hf ( x e. A <-> x e. B ) ) )
Theorem	hfuni 32291	The union of an HF set is itself hereditarily finite. (Contributed by Scott Fenton, 16-Jul-2015.)
|- ( A e. Hf -> U. A e. Hf )
Theorem	hfpw 32292	The power class of an HF set is hereditarily finite. (Contributed by Scott Fenton, 16-Jul-2015.)
|- ( A e. Hf -> ~P A e. Hf )
Theorem	hfninf 32293	om is not hereditarily finite. (Contributed by Scott Fenton, 16-Jul-2015.)
|- -. om e. Hf
20.9  Mathbox for Jeff Hankins
20.9.1  Miscellany
Theorem	a1i14 32294	Add two antecedents to a wff. (Contributed by Jeff Hankins, 4-Aug-2009.)
|- ( ps -> ( ch -> ta ) )   =>    |- ( ph -> ( ps -> ( ch -> ( th -> ta ) ) ) )
Theorem	a1i24 32295	Add two antecedents to a wff. (Contributed by Jeff Hankins, 5-Aug-2009.)
|- ( ph -> ( ch -> ta ) )   =>    |- ( ph -> ( ps -> ( ch -> ( th -> ta ) ) ) )
Theorem	exp5d 32296	An exportation inference. (Contributed by Jeff Hankins, 7-Jul-2009.)
|- ( ( ( ph /\ ps ) /\ ch ) -> ( ( th /\ ta ) -> et ) )   =>    |- ( ph -> ( ps -> ( ch -> ( th -> ( ta -> et ) ) ) ) )
Theorem	exp5g 32297	An exportation inference. (Contributed by Jeff Hankins, 7-Jul-2009.)
|- ( ( ph /\ ps ) -> ( ( ( ch /\ th ) /\ ta ) -> et ) )   =>    |- ( ph -> ( ps -> ( ch -> ( th -> ( ta -> et ) ) ) ) )
Theorem	exp5k 32298	An exportation inference. (Contributed by Jeff Hankins, 7-Jul-2009.)
|- ( ph -> ( ( ( ps /\ ( ch /\ th ) ) /\ ta ) -> et ) )   =>    |- ( ph -> ( ps -> ( ch -> ( th -> ( ta -> et ) ) ) ) )
Theorem	exp56 32299	An exportation inference. (Contributed by Jeff Hankins, 7-Jul-2009.)
|- ( ( ( ( ph /\ ps ) /\ ch ) /\ ( th /\ ta ) ) -> et )   =>    |- ( ph -> ( ps -> ( ch -> ( th -> ( ta -> et ) ) ) ) )
Theorem	exp58 32300	An exportation inference. (Contributed by Jeff Hankins, 7-Jul-2009.)
|- ( ( ( ph /\ ps ) /\ ( ( ch /\ th ) /\ ta ) ) -> et )   =>    |- ( ph -> ( ps -> ( ch -> ( th -> ( ta -> et ) ) ) ) )