P. 69 of Theorem List - Intuitionistic Logic Explorer

Theorem List for Intuitionistic Logic Explorer - 6801-6900   *Has distinct variable group(s)

Type	Label	Description
Statement
Theorem	xpdom1 6801	Dominance law for Cartesian product. Theorem 6L(c) of [Enderton] p. 149. (Contributed by NM, 28-Sep-2004.) (Revised by NM, 29-Mar-2006.) (Revised by Mario Carneiro, 7-May-2015.)
|- C e. _V   =>    |- ( A ~<_ B -> ( A X. C ) ~<_ ( B X. C ) )
Theorem	fopwdom 6802	Covering implies injection on power sets. (Contributed by Stefan O'Rear, 6-Nov-2014.) (Revised by Mario Carneiro, 24-Jun-2015.)
|- ( ( F e. _V /\ F : A -onto-> B ) -> ~P B ~<_ ~P A )
Theorem	0domg 6803	Any set dominates the empty set. (Contributed by NM, 26-Oct-2003.) (Revised by Mario Carneiro, 26-Apr-2015.)
|- ( A e. V -> (/) ~<_ A )
Theorem	dom0 6804	A set dominated by the empty set is empty. (Contributed by NM, 22-Nov-2004.)
|- ( A ~<_ (/) <-> A = (/) )
Theorem	0dom 6805	Any set dominates the empty set. (Contributed by NM, 26-Oct-2003.) (Revised by Mario Carneiro, 26-Apr-2015.)
|- A e. _V   =>    |- (/) ~<_ A
Theorem	enen1 6806	Equality-like theorem for equinumerosity. (Contributed by NM, 18-Dec-2003.)
|- ( A ~~ B -> ( A ~~ C <-> B ~~ C ) )
Theorem	enen2 6807	Equality-like theorem for equinumerosity. (Contributed by NM, 18-Dec-2003.)
|- ( A ~~ B -> ( C ~~ A <-> C ~~ B ) )
Theorem	domen1 6808	Equality-like theorem for equinumerosity and dominance. (Contributed by NM, 8-Nov-2003.)
|- ( A ~~ B -> ( A ~<_ C <-> B ~<_ C ) )
Theorem	domen2 6809	Equality-like theorem for equinumerosity and dominance. (Contributed by NM, 8-Nov-2003.)
|- ( A ~~ B -> ( C ~<_ A <-> C ~<_ B ) )
2.6.29  Equinumerosity (cont.)
Theorem	xpf1o 6810*	Construct a bijection on a Cartesian product given bijections on the factors. (Contributed by Mario Carneiro, 30-May-2015.)
|- ( ph -> ( x e. A |-> X ) : A -1-1-onto-> B )   &    |- ( ph -> ( y e. C |-> Y ) : C -1-1-onto-> D )   =>    |- ( ph -> ( x e. A , y e. C |-> <. X , Y >. ) : ( A X. C ) -1-1-onto-> ( B X. D ) )
Theorem	xpen 6811	Equinumerosity law for Cartesian product. Proposition 4.22(b) of [Mendelson] p. 254. (Contributed by NM, 24-Jul-2004.)
|- ( ( A ~~ B /\ C ~~ D ) -> ( A X. C ) ~~ ( B X. D ) )
Theorem	mapen 6812	Two set exponentiations are equinumerous when their bases and exponents are equinumerous. Theorem 6H(c) of [Enderton] p. 139. (Contributed by NM, 16-Dec-2003.) (Proof shortened by Mario Carneiro, 26-Apr-2015.)
|- ( ( A ~~ B /\ C ~~ D ) -> ( A ^m C ) ~~ ( B ^m D ) )
Theorem	mapdom1g 6813	Order-preserving property of set exponentiation. (Contributed by Jim Kingdon, 15-Jul-2022.)
|- ( ( A ~<_ B /\ C e. V ) -> ( A ^m C ) ~<_ ( B ^m C ) )
Theorem	mapxpen 6814	Equinumerosity law for double set exponentiation. Proposition 10.45 of [TakeutiZaring] p. 96. (Contributed by NM, 21-Feb-2004.) (Revised by Mario Carneiro, 24-Jun-2015.)
|- ( ( A e. V /\ B e. W /\ C e. X ) -> ( ( A ^m B ) ^m C ) ~~ ( A ^m ( B X. C ) ) )
Theorem	xpmapenlem 6815*	Lemma for xpmapen 6816. (Contributed by NM, 1-May-2004.) (Revised by Mario Carneiro, 16-Nov-2014.)
|- A e. _V   &    |- B e. _V   &    |- C e. _V   &    |- D = ( z e. C |-> ( 1st ` ( x ` z ) ) )   &    |- R = ( z e. C |-> ( 2nd ` ( x ` z ) ) )   &    |- S = ( z e. C |-> <. ( ( 1st ` y ) ` z ) , ( ( 2nd ` y ) ` z ) >. )   =>    |- ( ( A X. B ) ^m C ) ~~ ( ( A ^m C ) X. ( B ^m C ) )
Theorem	xpmapen 6816	Equinumerosity law for set exponentiation of a Cartesian product. Exercise 4.47 of [Mendelson] p. 255. (Contributed by NM, 23-Feb-2004.) (Proof shortened by Mario Carneiro, 16-Nov-2014.)
|- A e. _V   &    |- B e. _V   &    |- C e. _V   =>    |- ( ( A X. B ) ^m C ) ~~ ( ( A ^m C ) X. ( B ^m C ) )
Theorem	ssenen 6817*	Equinumerosity of equinumerous subsets of a set. (Contributed by NM, 30-Sep-2004.) (Revised by Mario Carneiro, 16-Nov-2014.)
|- ( A ~~ B -> { x | ( x C_ A /\ x ~~ C ) } ~~ { x | ( x C_ B /\ x ~~ C ) } )
2.6.30  Pigeonhole Principle
Theorem	phplem1 6818	Lemma for Pigeonhole Principle. If we join a natural number to itself minus an element, we end up with its successor minus the same element. (Contributed by NM, 25-May-1998.)
|- ( ( A e. om /\ B e. A ) -> ( { A } u. ( A \ { B } ) ) = ( suc A \ { B } ) )
Theorem	phplem2 6819	Lemma for Pigeonhole Principle. A natural number is equinumerous to its successor minus one of its elements. (Contributed by NM, 11-Jun-1998.) (Revised by Mario Carneiro, 16-Nov-2014.)
|- A e. _V   &    |- B e. _V   =>    |- ( ( A e. om /\ B e. A ) -> A ~~ ( suc A \ { B } ) )
Theorem	phplem3 6820	Lemma for Pigeonhole Principle. A natural number is equinumerous to its successor minus any element of the successor. For a version without the redundant hypotheses, see phplem3g 6822. (Contributed by NM, 26-May-1998.)
|- A e. _V   &    |- B e. _V   =>    |- ( ( A e. om /\ B e. suc A ) -> A ~~ ( suc A \ { B } ) )
Theorem	phplem4 6821	Lemma for Pigeonhole Principle. Equinumerosity of successors implies equinumerosity of the original natural numbers. (Contributed by NM, 28-May-1998.) (Revised by Mario Carneiro, 24-Jun-2015.)
|- A e. _V   &    |- B e. _V   =>    |- ( ( A e. om /\ B e. om ) -> ( suc A ~~ suc B -> A ~~ B ) )
Theorem	phplem3g 6822	A natural number is equinumerous to its successor minus any element of the successor. Version of phplem3 6820 with unnecessary hypotheses removed. (Contributed by Jim Kingdon, 1-Sep-2021.)
|- ( ( A e. om /\ B e. suc A ) -> A ~~ ( suc A \ { B } ) )
Theorem	nneneq 6823	Two equinumerous natural numbers are equal. Proposition 10.20 of [TakeutiZaring] p. 90 and its converse. Also compare Corollary 6E of [Enderton] p. 136. (Contributed by NM, 28-May-1998.)
|- ( ( A e. om /\ B e. om ) -> ( A ~~ B <-> A = B ) )
Theorem	php5 6824	A natural number is not equinumerous to its successor. Corollary 10.21(1) of [TakeutiZaring] p. 90. (Contributed by NM, 26-Jul-2004.)
|- ( A e. om -> -. A ~~ suc A )
Theorem	snnen2og 6825	A singleton { A } is never equinumerous with the ordinal number 2. If A is a proper class, see snnen2oprc 6826. (Contributed by Jim Kingdon, 1-Sep-2021.)
|- ( A e. V -> -. { A } ~~ 2o )
Theorem	snnen2oprc 6826	A singleton { A } is never equinumerous with the ordinal number 2. If A is a set, see snnen2og 6825. (Contributed by Jim Kingdon, 1-Sep-2021.)
|- ( -. A e. _V -> -. { A } ~~ 2o )
Theorem	1nen2 6827	One and two are not equinumerous. (Contributed by Jim Kingdon, 25-Jan-2022.)
|- -. 1o ~~ 2o
Theorem	phplem4dom 6828	Dominance of successors implies dominance of the original natural numbers. (Contributed by Jim Kingdon, 1-Sep-2021.)
|- ( ( A e. om /\ B e. om ) -> ( suc A ~<_ suc B -> A ~<_ B ) )
Theorem	php5dom 6829	A natural number does not dominate its successor. (Contributed by Jim Kingdon, 1-Sep-2021.)
|- ( A e. om -> -. suc A ~<_ A )
Theorem	nndomo 6830	Cardinal ordering agrees with natural number ordering. Example 3 of [Enderton] p. 146. (Contributed by NM, 17-Jun-1998.)
|- ( ( A e. om /\ B e. om ) -> ( A ~<_ B <-> A C_ B ) )
Theorem	phpm 6831*	Pigeonhole Principle. A natural number is not equinumerous to a proper subset of itself. By "proper subset" here we mean that there is an element which is in the natural number and not in the subset, or in symbols E. x x e. ( A \ B ) (which is stronger than not being equal in the absence of excluded middle). Theorem (Pigeonhole Principle) of [Enderton] p. 134. The theorem is so-called because you can't put n + 1 pigeons into n holes (if each hole holds only one pigeon). The proof consists of lemmas phplem1 6818 through phplem4 6821, nneneq 6823, and this final piece of the proof. (Contributed by NM, 29-May-1998.)
|- ( ( A e. om /\ B C_ A /\ E. x x e. ( A \ B ) ) -> -. A ~~ B )
Theorem	phpelm 6832	Pigeonhole Principle. A natural number is not equinumerous to an element of itself. (Contributed by Jim Kingdon, 6-Sep-2021.)
|- ( ( A e. om /\ B e. A ) -> -. A ~~ B )
Theorem	phplem4on 6833	Equinumerosity of successors of an ordinal and a natural number implies equinumerosity of the originals. (Contributed by Jim Kingdon, 5-Sep-2021.)
|- ( ( A e. On /\ B e. om ) -> ( suc A ~~ suc B -> A ~~ B ) )
2.6.31  Finite sets
Theorem	fict 6834	A finite set is dominated by om. Also see finct 7081. (Contributed by Thierry Arnoux, 27-Mar-2018.)
|- ( A e. Fin -> A ~<_ om )
Theorem	fidceq 6835	Equality of members of a finite set is decidable. This may be counterintuitive: cannot any two sets be elements of a finite set? Well, to show, for example, that { B , C } is finite would require showing it is equinumerous to 1o or to 2o but to show that you'd need to know B = C or -. B = C, respectively. (Contributed by Jim Kingdon, 5-Sep-2021.)
|- ( ( A e. Fin /\ B e. A /\ C e. A ) -> DECID B = C )
Theorem	fidifsnen 6836	All decrements of a finite set are equinumerous. (Contributed by Jim Kingdon, 9-Sep-2021.)
|- ( ( X e. Fin /\ A e. X /\ B e. X ) -> ( X \ { A } ) ~~ ( X \ { B } ) )
Theorem	fidifsnid 6837	If we remove a single element from a finite set then put it back in, we end up with the original finite set. This strengthens difsnss 3719 from subset to equality when the set is finite. (Contributed by Jim Kingdon, 9-Sep-2021.)
|- ( ( A e. Fin /\ B e. A ) -> ( ( A \ { B } ) u. { B } ) = A )
Theorem	nnfi 6838	Natural numbers are finite sets. (Contributed by Stefan O'Rear, 21-Mar-2015.)
|- ( A e. om -> A e. Fin )
Theorem	enfi 6839	Equinumerous sets have the same finiteness. (Contributed by NM, 22-Aug-2008.)
|- ( A ~~ B -> ( A e. Fin <-> B e. Fin ) )
Theorem	enfii 6840	A set equinumerous to a finite set is finite. (Contributed by Mario Carneiro, 12-Mar-2015.)
|- ( ( B e. Fin /\ A ~~ B ) -> A e. Fin )
Theorem	ssfilem 6841*	Lemma for ssfiexmid 6842. (Contributed by Jim Kingdon, 3-Feb-2022.)
|- { z e. { (/) } | ph } e. Fin   =>    |- ( ph \/ -. ph )
Theorem	ssfiexmid 6842*	If any subset of a finite set is finite, excluded middle follows. One direction of Theorem 2.1 of [Bauer], p. 485. (Contributed by Jim Kingdon, 19-May-2020.)
|- A. x A. y ( ( x e. Fin /\ y C_ x ) -> y e. Fin )   =>    |- ( ph \/ -. ph )
Theorem	infiexmid 6843*	If the intersection of any finite set and any other set is finite, excluded middle follows. (Contributed by Jim Kingdon, 5-Feb-2022.)
|- ( x e. Fin -> ( x i^i y ) e. Fin )   =>    |- ( ph \/ -. ph )
Theorem	domfiexmid 6844*	If any set dominated by a finite set is finite, excluded middle follows. (Contributed by Jim Kingdon, 3-Feb-2022.)
|- ( ( x e. Fin /\ y ~<_ x ) -> y e. Fin )   =>    |- ( ph \/ -. ph )
Theorem	dif1en 6845	If a set A is equinumerous to the successor of a natural number M, then A with an element removed is equinumerous to M. (Contributed by Jeff Madsen, 2-Sep-2009.) (Revised by Stefan O'Rear, 16-Aug-2015.)
|- ( ( M e. om /\ A ~~ suc M /\ X e. A ) -> ( A \ { X } ) ~~ M )
Theorem	dif1enen 6846	Subtracting one element from each of two equinumerous finite sets. (Contributed by Jim Kingdon, 5-Jun-2022.)
|- ( ph -> A e. Fin )   &    |- ( ph -> A ~~ B )   &    |- ( ph -> C e. A )   &    |- ( ph -> D e. B )   =>    |- ( ph -> ( A \ { C } ) ~~ ( B \ { D } ) )
Theorem	fiunsnnn 6847	Adding one element to a finite set which is equinumerous to a natural number. (Contributed by Jim Kingdon, 13-Sep-2021.)
|- ( ( ( A e. Fin /\ B e. ( _V \ A ) ) /\ ( N e. om /\ A ~~ N ) ) -> ( A u. { B } ) ~~ suc N )
Theorem	php5fin 6848	A finite set is not equinumerous to a set which adds one element. (Contributed by Jim Kingdon, 13-Sep-2021.)
|- ( ( A e. Fin /\ B e. ( _V \ A ) ) -> -. A ~~ ( A u. { B } ) )
Theorem	fisbth 6849	Schroeder-Bernstein Theorem for finite sets. (Contributed by Jim Kingdon, 12-Sep-2021.)
|- ( ( ( A e. Fin /\ B e. Fin ) /\ ( A ~<_ B /\ B ~<_ A ) ) -> A ~~ B )
Theorem	0fin 6850	The empty set is finite. (Contributed by FL, 14-Jul-2008.)
|- (/) e. Fin
Theorem	fin0 6851*	A nonempty finite set has at least one element. (Contributed by Jim Kingdon, 10-Sep-2021.)
|- ( A e. Fin -> ( A =/= (/) <-> E. x x e. A ) )
Theorem	fin0or 6852*	A finite set is either empty or inhabited. (Contributed by Jim Kingdon, 30-Sep-2021.)
|- ( A e. Fin -> ( A = (/) \/ E. x x e. A ) )
Theorem	diffitest 6853*	If subtracting any set from a finite set gives a finite set, any proposition of the form -. ph is decidable. This is not a proof of full excluded middle, but it is close enough to show we won't be able to prove A e. Fin -> ( A \ B ) e. Fin. (Contributed by Jim Kingdon, 8-Sep-2021.)
|- A. a e. Fin A. b ( a \ b ) e. Fin   =>    |- ( -. ph \/ -. -. ph )
Theorem	findcard 6854*	Schema for induction on the cardinality of a finite set. The inductive hypothesis is that the result is true on the given set with any one element removed. The result is then proven to be true for all finite sets. (Contributed by Jeff Madsen, 2-Sep-2009.)
|- ( x = (/) -> ( ph <-> ps ) )   &    |- ( x = ( y \ { z } ) -> ( ph <-> ch ) )   &    |- ( x = y -> ( ph <-> th ) )   &    |- ( x = A -> ( ph <-> ta ) )   &    |- ps   &    |- ( y e. Fin -> ( A. z e. y ch -> th ) )   =>    |- ( A e. Fin -> ta )
Theorem	findcard2 6855*	Schema for induction on the cardinality of a finite set. The inductive step shows that the result is true if one more element is added to the set. The result is then proven to be true for all finite sets. (Contributed by Jeff Madsen, 8-Jul-2010.)
|- ( x = (/) -> ( ph <-> ps ) )   &    |- ( x = y -> ( ph <-> ch ) )   &    |- ( x = ( y u. { z } ) -> ( ph <-> th ) )   &    |- ( x = A -> ( ph <-> ta ) )   &    |- ps   &    |- ( y e. Fin -> ( ch -> th ) )   =>    |- ( A e. Fin -> ta )
Theorem	findcard2s 6856*	Variation of findcard2 6855 requiring that the element added in the induction step not be a member of the original set. (Contributed by Paul Chapman, 30-Nov-2012.)
|- ( x = (/) -> ( ph <-> ps ) )   &    |- ( x = y -> ( ph <-> ch ) )   &    |- ( x = ( y u. { z } ) -> ( ph <-> th ) )   &    |- ( x = A -> ( ph <-> ta ) )   &    |- ps   &    |- ( ( y e. Fin /\ -. z e. y ) -> ( ch -> th ) )   =>    |- ( A e. Fin -> ta )
Theorem	findcard2d 6857*	Deduction version of findcard2 6855. If you also need y e. Fin (which doesn't come for free due to ssfiexmid 6842), use findcard2sd 6858 instead. (Contributed by SO, 16-Jul-2018.)
|- ( x = (/) -> ( ps <-> ch ) )   &    |- ( x = y -> ( ps <-> th ) )   &    |- ( x = ( y u. { z } ) -> ( ps <-> ta ) )   &    |- ( x = A -> ( ps <-> et ) )   &    |- ( ph -> ch )   &    |- ( ( ph /\ ( y C_ A /\ z e. ( A \ y ) ) ) -> ( th -> ta ) )   &    |- ( ph -> A e. Fin )   =>    |- ( ph -> et )
Theorem	findcard2sd 6858*	Deduction form of finite set induction . (Contributed by Jim Kingdon, 14-Sep-2021.)
|- ( x = (/) -> ( ps <-> ch ) )   &    |- ( x = y -> ( ps <-> th ) )   &    |- ( x = ( y u. { z } ) -> ( ps <-> ta ) )   &    |- ( x = A -> ( ps <-> et ) )   &    |- ( ph -> ch )   &    |- ( ( ( ph /\ y e. Fin ) /\ ( y C_ A /\ z e. ( A \ y ) ) ) -> ( th -> ta ) )   &    |- ( ph -> A e. Fin )   =>    |- ( ph -> et )
Theorem	diffisn 6859	Subtracting a singleton from a finite set produces a finite set. (Contributed by Jim Kingdon, 11-Sep-2021.)
|- ( ( A e. Fin /\ B e. A ) -> ( A \ { B } ) e. Fin )
Theorem	diffifi 6860	Subtracting one finite set from another produces a finite set. (Contributed by Jim Kingdon, 8-Sep-2021.)
|- ( ( A e. Fin /\ B e. Fin /\ B C_ A ) -> ( A \ B ) e. Fin )
Theorem	infnfi 6861	An infinite set is not finite. (Contributed by Jim Kingdon, 20-Feb-2022.)
|- ( om ~<_ A -> -. A e. Fin )
Theorem	ominf 6862	The set of natural numbers is not finite. Although we supply this theorem because we can, the more natural way to express " om is infinite" is om ~<_ om which is an instance of domrefg 6733. (Contributed by NM, 2-Jun-1998.)
|- -. om e. Fin
Theorem	isinfinf 6863*	An infinite set contains subsets of arbitrarily large finite cardinality. (Contributed by Jim Kingdon, 15-Jun-2022.)
|- ( om ~<_ A -> A. n e. om E. x ( x C_ A /\ x ~~ n ) )
Theorem	ac6sfi 6864*	Existence of a choice function for finite sets. (Contributed by Jeff Hankins, 26-Jun-2009.) (Proof shortened by Mario Carneiro, 29-Jan-2014.)
|- ( y = ( f ` x ) -> ( ph <-> ps ) )   =>    |- ( ( A e. Fin /\ A. x e. A E. y e. B ph ) -> E. f ( f : A --> B /\ A. x e. A ps ) )
Theorem	tridc 6865*	A trichotomous order is decidable. (Contributed by Jim Kingdon, 5-Sep-2022.)
|- ( ph -> R Po A )   &    |- ( ph -> A. x e. A A. y e. A ( x R y \/ x = y \/ y R x ) )   &    |- ( ph -> B e. A )   &    |- ( ph -> C e. A )   =>    |- ( ph -> DECID B R C )
Theorem	fimax2gtrilemstep 6866*	Lemma for fimax2gtri 6867. The induction step. (Contributed by Jim Kingdon, 5-Sep-2022.)
|- ( ph -> R Po A )   &    |- ( ph -> A. x e. A A. y e. A ( x R y \/ x = y \/ y R x ) )   &    |- ( ph -> A e. Fin )   &    |- ( ph -> A =/= (/) )   &    |- ( ph -> U e. Fin )   &    |- ( ph -> U C_ A )   &    |- ( ph -> Z e. A )   &    |- ( ph -> V e. A )   &    |- ( ph -> -. V e. U )   &    |- ( ph -> A. y e. U -. Z R y )   =>    |- ( ph -> E. x e. A A. y e. ( U u. { V } ) -. x R y )
Theorem	fimax2gtri 6867*	A finite set has a maximum under a trichotomous order. (Contributed by Jim Kingdon, 5-Sep-2022.)
|- ( ph -> R Po A )   &    |- ( ph -> A. x e. A A. y e. A ( x R y \/ x = y \/ y R x ) )   &    |- ( ph -> A e. Fin )   &    |- ( ph -> A =/= (/) )   =>    |- ( ph -> E. x e. A A. y e. A -. x R y )
Theorem	finexdc 6868*	Decidability of existence, over a finite set and defined by a decidable proposition. (Contributed by Jim Kingdon, 12-Jul-2022.)
|- ( ( A e. Fin /\ A. x e. A DECID ph ) -> DECID E. x e. A ph )
Theorem	dfrex2fin 6869*	Relationship between universal and existential quantifiers over a finite set. Remark in Section 2.2.1 of [Pierik], p. 8. Although Pierik does not mention the decidability condition explicitly, it does say "only finitely many x to check" which means there must be some way of checking each value of x. (Contributed by Jim Kingdon, 11-Jul-2022.)
|- ( ( A e. Fin /\ A. x e. A DECID ph ) -> ( E. x e. A ph <-> -. A. x e. A -. ph ) )
Theorem	infm 6870*	An infinite set is inhabited. (Contributed by Jim Kingdon, 18-Feb-2022.)
|- ( om ~<_ A -> E. x x e. A )
Theorem	infn0 6871	An infinite set is not empty. (Contributed by NM, 23-Oct-2004.)
|- ( om ~<_ A -> A =/= (/) )
Theorem	inffiexmid 6872*	If any given set is either finite or infinite, excluded middle follows. (Contributed by Jim Kingdon, 15-Jun-2022.)
|- ( x e. Fin \/ om ~<_ x )   =>    |- ( ph \/ -. ph )
Theorem	en2eqpr 6873	Building a set with two elements. (Contributed by FL, 11-Aug-2008.) (Revised by Mario Carneiro, 10-Sep-2015.)
|- ( ( C ~~ 2o /\ A e. C /\ B e. C ) -> ( A =/= B -> C = { A , B } ) )
Theorem	exmidpw 6874	Excluded middle is equivalent to the power set of 1o having two elements. Remark of [PradicBrown2022], p. 2. (Contributed by Jim Kingdon, 30-Jun-2022.)
|- (EXMID <-> ~P 1o ~~ 2o )
Theorem	exmidpweq 6875	Excluded middle is equivalent to the power set of 1o being 2o. (Contributed by Jim Kingdon, 28-Jul-2024.)
|- (EXMID <-> ~P 1o = 2o )
Theorem	pw1fin 6876	Excluded middle is equivalent to the power set of 1o being finite. (Contributed by SN and Jim Kingdon, 7-Aug-2024.)
|- (EXMID <-> ~P 1o e. Fin )
Theorem	pw1dc0el 6877	Another equivalent of excluded middle, which is a mere reformulation of the definition. (Contributed by BJ, 9-Aug-2024.)
|- (EXMID <-> A. x e. ~P 1oDECID (/) e. x )
Theorem	ss1o0el1o 6878	Reformulation of ss1o0el1 4176 using 1o instead of { (/) }. (Contributed by BJ, 9-Aug-2024.)
|- ( A C_ 1o -> ( (/) e. A <-> A = 1o ) )
Theorem	pw1dc1 6879	If, in the set of truth values (the powerset of 1o), equality to 1o is decidable, then excluded middle holds (and conversely). (Contributed by BJ and Jim Kingdon, 8-Aug-2024.)
|- (EXMID <-> A. x e. ~P 1oDECID x = 1o )
Theorem	fientri3 6880	Trichotomy of dominance for finite sets. (Contributed by Jim Kingdon, 15-Sep-2021.)
|- ( ( A e. Fin /\ B e. Fin ) -> ( A ~<_ B \/ B ~<_ A ) )
Theorem	nnwetri 6881*	A natural number is well-ordered by _E. More specifically, this order both satisfies We and is trichotomous. (Contributed by Jim Kingdon, 25-Sep-2021.)
|- ( A e. om -> ( _E We A /\ A. x e. A A. y e. A ( x _E y \/ x = y \/ y _E x ) ) )
Theorem	onunsnss 6882	Adding a singleton to create an ordinal. (Contributed by Jim Kingdon, 20-Oct-2021.)
|- ( ( B e. V /\ ( A u. { B } ) e. On ) -> B C_ A )
Theorem	unfiexmid 6883*	If the union of any two finite sets is finite, excluded middle follows. Remark 8.1.17 of [AczelRathjen], p. 74. (Contributed by Mario Carneiro and Jim Kingdon, 5-Mar-2022.)
|- ( ( x e. Fin /\ y e. Fin ) -> ( x u. y ) e. Fin )   =>    |- ( ph \/ -. ph )
Theorem	unsnfi 6884	Adding a singleton to a finite set yields a finite set. (Contributed by Jim Kingdon, 3-Feb-2022.)
|- ( ( A e. Fin /\ B e. V /\ -. B e. A ) -> ( A u. { B } ) e. Fin )
Theorem	unsnfidcex 6885	The B e. V condition in unsnfi 6884. This is intended to show that unsnfi 6884 without that condition would not be provable but it probably would need to be strengthened (for example, to imply included middle) to fully show that. (Contributed by Jim Kingdon, 6-Feb-2022.)
|- ( ( A e. Fin /\ -. B e. A /\ ( A u. { B } ) e. Fin ) -> DECID -. B e. _V )
Theorem	unsnfidcel 6886	The -. B e. A condition in unsnfi 6884. This is intended to show that unsnfi 6884 without that condition would not be provable but it probably would need to be strengthened (for example, to imply included middle) to fully show that. (Contributed by Jim Kingdon, 6-Feb-2022.)
|- ( ( A e. Fin /\ B e. V /\ ( A u. { B } ) e. Fin ) -> DECID -. B e. A )
Theorem	unfidisj 6887	The union of two disjoint finite sets is finite. (Contributed by Jim Kingdon, 25-Feb-2022.)
|- ( ( A e. Fin /\ B e. Fin /\ ( A i^i B ) = (/) ) -> ( A u. B ) e. Fin )
Theorem	undifdcss 6888*	Union of complementary parts into whole and decidability. (Contributed by Jim Kingdon, 17-Jun-2022.)
|- ( A = ( B u. ( A \ B ) ) <-> ( B C_ A /\ A. x e. A DECID x e. B ) )
Theorem	undifdc 6889*	Union of complementary parts into whole. This is a case where we can strengthen undifss 3489 from subset to equality. (Contributed by Jim Kingdon, 17-Jun-2022.)
|- ( ( A. x e. A A. y e. A DECID x = y /\ B e. Fin /\ B C_ A ) -> A = ( B u. ( A \ B ) ) )
Theorem	undiffi 6890	Union of complementary parts into whole. This is a case where we can strengthen undifss 3489 from subset to equality. (Contributed by Jim Kingdon, 2-Mar-2022.)
|- ( ( A e. Fin /\ B e. Fin /\ B C_ A ) -> A = ( B u. ( A \ B ) ) )
Theorem	unfiin 6891	The union of two finite sets is finite if their intersection is. (Contributed by Jim Kingdon, 2-Mar-2022.)
|- ( ( A e. Fin /\ B e. Fin /\ ( A i^i B ) e. Fin ) -> ( A u. B ) e. Fin )
Theorem	prfidisj 6892	A pair is finite if it consists of two unequal sets. For the case where A = B, see snfig 6780. For the cases where one or both is a proper class, see prprc1 3684, prprc2 3685, or prprc 3686. (Contributed by Jim Kingdon, 31-May-2022.)
|- ( ( A e. V /\ B e. W /\ A =/= B ) -> { A , B } e. Fin )
Theorem	tpfidisj 6893	A triple is finite if it consists of three unequal sets. (Contributed by Jim Kingdon, 1-Oct-2022.)
|- ( ph -> A e. V )   &    |- ( ph -> B e. W )   &    |- ( ph -> C e. X )   &    |- ( ph -> A =/= B )   &    |- ( ph -> A =/= C )   &    |- ( ph -> B =/= C )   =>    |- ( ph -> { A , B , C } e. Fin )
Theorem	fiintim 6894*	If a class is closed under pairwise intersections, then it is closed under nonempty finite intersections. The converse would appear to require an additional condition, such as x and y not being equal, or A having decidable equality. This theorem is applicable to a topology, which (among other axioms) is closed under finite intersections. Some texts use a pairwise intersection and some texts use a finite intersection, but most topology texts assume excluded middle (in which case the two intersection properties would be equivalent). (Contributed by NM, 22-Sep-2002.) (Revised by Jim Kingdon, 14-Jan-2023.)
|- ( A. x e. A A. y e. A ( x i^i y ) e. A -> A. x ( ( x C_ A /\ x =/= (/) /\ x e. Fin ) -> |^| x e. A ) )
Theorem	xpfi 6895	The Cartesian product of two finite sets is finite. Lemma 8.1.16 of [AczelRathjen], p. 74. (Contributed by Jeff Madsen, 2-Sep-2009.) (Revised by Mario Carneiro, 12-Mar-2015.)
|- ( ( A e. Fin /\ B e. Fin ) -> ( A X. B ) e. Fin )
Theorem	3xpfi 6896	The Cartesian product of three finite sets is a finite set. (Contributed by Alexander van der Vekens, 11-Mar-2018.)
|- ( V e. Fin -> ( ( V X. V ) X. V ) e. Fin )
Theorem	fisseneq 6897	A finite set is equal to its subset if they are equinumerous. (Contributed by FL, 11-Aug-2008.)
|- ( ( B e. Fin /\ A C_ B /\ A ~~ B ) -> A = B )
Theorem	phpeqd 6898	Corollary of the Pigeonhole Principle using equality. Strengthening of phpm 6831 expressed without negation. (Contributed by Rohan Ridenour, 3-Aug-2023.)
|- ( ph -> A e. Fin )   &    |- ( ph -> B C_ A )   &    |- ( ph -> A ~~ B )   =>    |- ( ph -> A = B )
Theorem	ssfirab 6899*	A subset of a finite set is finite if it is defined by a decidable property. (Contributed by Jim Kingdon, 27-May-2022.)
|- ( ph -> A e. Fin )   &    |- ( ph -> A. x e. A DECID ps )   =>    |- ( ph -> { x e. A | ps } e. Fin )
Theorem	ssfidc 6900*	A subset of a finite set is finite if membership in the subset is decidable. (Contributed by Jim Kingdon, 27-May-2022.)
|- ( ( A e. Fin /\ B C_ A /\ A. x e. A DECID x e. B ) -> B e. Fin )