P. 129 of Theorem List - Intuitionistic Logic Explorer

Theorem List for Intuitionistic Logic Explorer - 12801-12900   *Has distinct variable group(s)

Type	Label	Description
Statement
Theorem	bj-prexg 12801	Proof of prexg 4093 using only bounded separation. (Contributed by BJ, 5-Oct-2019.) (Proof modification is discouraged.)
|- ( ( A e. V /\ B e. W ) -> { A , B } e. _V )
Theorem	bj-snexg 12802	snexg 4068 from bounded separation. (Contributed by BJ, 5-Oct-2019.) (Proof modification is discouraged.)
|- ( A e. V -> { A } e. _V )
Theorem	bj-snex 12803	snex 4069 from bounded separation. (Contributed by BJ, 5-Oct-2019.) (Proof modification is discouraged.)
|- A e. _V   =>    |- { A } e. _V
Theorem	bj-sels 12804*	If a class is a set, then it is a member of a set. (Copied from set.mm.) (Contributed by BJ, 3-Apr-2019.)
|- ( A e. V -> E. x A e. x )
Theorem	bj-axun2 12805*	axun2 4317 from bounded separation. (Contributed by BJ, 15-Oct-2019.) (Proof modification is discouraged.)
|- E. y A. z ( z e. y <-> E. w ( z e. w /\ w e. x ) )
Theorem	bj-uniex2 12806*	uniex2 4318 from bounded separation. (Contributed by BJ, 15-Oct-2019.) (Proof modification is discouraged.)
|- E. y y = U. x
Theorem	bj-uniex 12807	uniex 4319 from bounded separation. (Contributed by BJ, 13-Nov-2019.) (Proof modification is discouraged.)
|- A e. _V   =>    |- U. A e. _V
Theorem	bj-uniexg 12808	uniexg 4321 from bounded separation. (Contributed by BJ, 13-Nov-2019.) (Proof modification is discouraged.)
|- ( A e. V -> U. A e. _V )
Theorem	bj-unex 12809	unex 4322 from bounded separation. (Contributed by BJ, 13-Nov-2019.) (Proof modification is discouraged.)
|- A e. _V   &    |- B e. _V   =>    |- ( A u. B ) e. _V
Theorem	bdunexb 12810	Bounded version of unexb 4323. (Contributed by BJ, 13-Nov-2019.) (Proof modification is discouraged.)
|- BOUNDED A   &    |- BOUNDED B   =>    |- ( ( A e. _V /\ B e. _V ) <-> ( A u. B ) e. _V )
Theorem	bj-unexg 12811	unexg 4324 from bounded separation. (Contributed by BJ, 13-Nov-2019.) (Proof modification is discouraged.)
|- ( ( A e. V /\ B e. W ) -> ( A u. B ) e. _V )
Theorem	bj-sucexg 12812	sucexg 4374 from bounded separation. (Contributed by BJ, 13-Nov-2019.) (Proof modification is discouraged.)
|- ( A e. V -> suc A e. _V )
Theorem	bj-sucex 12813	sucex 4375 from bounded separation. (Contributed by BJ, 13-Nov-2019.) (Proof modification is discouraged.)
|- A e. _V   =>    |- suc A e. _V
10.2.7.1  Delta_0-classical logic
Axiom	ax-bj-d0cl 12814	Axiom for Δ0-classical logic. (Contributed by BJ, 2-Jan-2020.)
|- BOUNDED ph   =>    |- DECID ph
Theorem	bj-d0clsepcl 12815	Δ0-classical logic and separation implies classical logic. (Contributed by BJ, 2-Jan-2020.) (Proof modification is discouraged.)
|- DECID ph
10.2.7.2  Inductive classes and the class of natural numbers (finite ordinals)
Syntax	wind 12816	Syntax for inductive classes.
wff Ind A
Definition	df-bj-ind 12817*	Define the property of being an inductive class. (Contributed by BJ, 30-Nov-2019.)
|- (Ind A <-> ( (/) e. A /\ A. x e. A suc x e. A ) )
Theorem	bj-indsuc 12818	A direct consequence of the definition of Ind. (Contributed by BJ, 30-Nov-2019.)
|- (Ind A -> ( B e. A -> suc B e. A ) )
Theorem	bj-indeq 12819	Equality property for Ind. (Contributed by BJ, 30-Nov-2019.)
|- ( A = B -> (Ind A <-> Ind B ) )
Theorem	bj-bdind 12820	Boundedness of the formula "the setvar x is an inductive class". (Contributed by BJ, 30-Nov-2019.)
|- BOUNDED Ind x
Theorem	bj-indint 12821*	The property of being an inductive class is closed under intersections. (Contributed by BJ, 30-Nov-2019.)
|- Ind |^| { x e. A | Ind x }
Theorem	bj-indind 12822*	If A is inductive and B is "inductive in A", then ( A i^i B ) is inductive. (Contributed by BJ, 25-Oct-2020.)
|- ( (Ind A /\ ( (/) e. B /\ A. x e. A ( x e. B -> suc x e. B ) ) ) -> Ind ( A i^i B ) )
Theorem	bj-dfom 12823	Alternate definition of om, as the intersection of all the inductive sets. Proposal: make this the definition. (Contributed by BJ, 30-Nov-2019.)
|- om = |^| { x | Ind x }
Theorem	bj-omind 12824	om is an inductive class. (Contributed by BJ, 30-Nov-2019.)
|- Ind om
Theorem	bj-omssind 12825	om is included in all the inductive sets (but for the moment, we cannot prove that it is included in all the inductive classes). (Contributed by BJ, 30-Nov-2019.) (Proof modification is discouraged.)
|- ( A e. V -> (Ind A -> om C_ A ) )
Theorem	bj-ssom 12826*	A characterization of subclasses of om. (Contributed by BJ, 30-Nov-2019.) (Proof modification is discouraged.)
|- ( A. x (Ind x -> A C_ x ) <-> A C_ om )
Theorem	bj-om 12827*	A set is equal to om if and only if it is the smallest inductive set. (Contributed by BJ, 30-Nov-2019.) (Proof modification is discouraged.)
|- ( A e. V -> ( A = om <-> (Ind A /\ A. x (Ind x -> A C_ x ) ) ) )
Theorem	bj-2inf 12828*	Two formulations of the axiom of infinity (see ax-infvn 12831 and bj-omex 12832) . (Contributed by BJ, 30-Nov-2019.) (Proof modification is discouraged.)
|- ( om e. _V <-> E. x (Ind x /\ A. y (Ind y -> x C_ y ) ) )
10.2.7.3  The first three Peano postulates The first three Peano postulates follow from constructive set theory (actually, from its core axioms). The proofs peano1 4468 and peano3 4470 already show this. In this section, we prove bj-peano2 12829 to complete this program. We also prove a preliminary version of the fifth Peano postulate from the core axioms.
Theorem	bj-peano2 12829	Constructive proof of peano2 4469. Temporary note: another possibility is to simply replace sucexg 4374 with bj-sucexg 12812 in the proof of peano2 4469. (Contributed by BJ, 18-Nov-2019.) (Proof modification is discouraged.)
|- ( A e. om -> suc A e. om )
Theorem	peano5set 12830*	Version of peano5 4472 when om i^i A is assumed to be a set, allowing a proof from the core axioms of CZF. (Contributed by BJ, 19-Nov-2019.) (Proof modification is discouraged.)
|- ( ( om i^i A ) e. V -> ( ( (/) e. A /\ A. x e. om ( x e. A -> suc x e. A ) ) -> om C_ A ) )
10.2.8  CZF: Infinity In the absence of full separation, the axiom of infinity has to be stated more precisely, as the existence of the smallest class containing the empty set and the successor of each of its elements.
10.2.8.1  The set of natural numbers (finite ordinals) In this section, we introduce the axiom of infinity in a constructive setting (ax-infvn 12831) and deduce that the class om of finite ordinals is a set (bj-omex 12832).
Axiom	ax-infvn 12831*	Axiom of infinity in a constructive setting. This asserts the existence of the special set we want (the set of natural numbers), instead of the existence of a set with some properties (ax-iinf 4462) from which one then proves, using full separation, that the wanted set exists (omex 4467). "vn" is for "von Neumann". (Contributed by BJ, 14-Nov-2019.)
|- E. x (Ind x /\ A. y (Ind y -> x C_ y ) )
Theorem	bj-omex 12832	Proof of omex 4467 from ax-infvn 12831. (Contributed by BJ, 14-Nov-2019.) (Proof modification is discouraged.)
|- om e. _V
10.2.8.2  Peano's fifth postulate In this section, we give constructive proofs of two versions of Peano's fifth postulate.
Theorem	bdpeano5 12833*	Bounded version of peano5 4472. (Contributed by BJ, 19-Nov-2019.) (Proof modification is discouraged.)
|- BOUNDED A   =>    |- ( ( (/) e. A /\ A. x e. om ( x e. A -> suc x e. A ) ) -> om C_ A )
Theorem	speano5 12834*	Version of peano5 4472 when A is assumed to be a set, allowing a proof from the core axioms of CZF. (Contributed by BJ, 19-Nov-2019.) (Proof modification is discouraged.)
|- ( ( A e. V /\ (/) e. A /\ A. x e. om ( x e. A -> suc x e. A ) ) -> om C_ A )
10.2.8.3  Bounded induction and Peano's fourth postulate In this section, we prove various versions of bounded induction from the basic axioms of CZF (in particular, without the axiom of set induction). We also prove Peano's fourth postulate. Together with the results from the previous sections, this proves from the core axioms of CZF (with infinity) that the set of finite ordinals satisfies the five Peano postulates and thus provides a model for the set of natural numbers.
Theorem	findset 12835*	Bounded induction (principle of induction when A is assumed to be a set) allowing a proof from basic constructive axioms. See find 4473 for a nonconstructive proof of the general case. See bdfind 12836 for a proof when A is assumed to be bounded. (Contributed by BJ, 22-Nov-2019.) (Proof modification is discouraged.)
|- ( A e. V -> ( ( A C_ om /\ (/) e. A /\ A. x e. A suc x e. A ) -> A = om ) )
Theorem	bdfind 12836*	Bounded induction (principle of induction when A is assumed to be bounded), proved from basic constructive axioms. See find 4473 for a nonconstructive proof of the general case. See findset 12835 for a proof when A is assumed to be a set. (Contributed by BJ, 22-Nov-2019.) (Proof modification is discouraged.)
|- BOUNDED A   =>    |- ( ( A C_ om /\ (/) e. A /\ A. x e. A suc x e. A ) -> A = om )
Theorem	bj-bdfindis 12837*	Bounded induction (principle of induction for bounded formulas), using implicit substitutions (the biconditional versions of the hypotheses are implicit substitutions, and we have weakened them to implications). Constructive proof (from CZF). See finds 4474 for a proof of full induction in IZF. From this version, it is easy to prove bounded versions of finds 4474, finds2 4475, finds1 4476. (Contributed by BJ, 21-Nov-2019.) (Proof modification is discouraged.)
|- BOUNDED ph   &    |- F/ x ps   &    |- F/ x ch   &    |- F/ x th   &    |- ( x = (/) -> ( ps -> ph ) )   &    |- ( x = y -> ( ph -> ch ) )   &    |- ( x = suc y -> ( th -> ph ) )   =>    |- ( ( ps /\ A. y e. om ( ch -> th ) ) -> A. x e. om ph )
Theorem	bj-bdfindisg 12838*	Version of bj-bdfindis 12837 using a class term in the consequent. Constructive proof (from CZF). See the comment of bj-bdfindis 12837 for explanations. (Contributed by BJ, 21-Nov-2019.) (Proof modification is discouraged.)
|- BOUNDED ph   &    |- F/ x ps   &    |- F/ x ch   &    |- F/ x th   &    |- ( x = (/) -> ( ps -> ph ) )   &    |- ( x = y -> ( ph -> ch ) )   &    |- ( x = suc y -> ( th -> ph ) )   &    |- F/_ x A   &    |- F/ x ta   &    |- ( x = A -> ( ph -> ta ) )   =>    |- ( ( ps /\ A. y e. om ( ch -> th ) ) -> ( A e. om -> ta ) )
Theorem	bj-bdfindes 12839	Bounded induction (principle of induction for bounded formulas), using explicit substitutions. Constructive proof (from CZF). See the comment of bj-bdfindis 12837 for explanations. From this version, it is easy to prove the bounded version of findes 4477. (Contributed by BJ, 21-Nov-2019.) (Proof modification is discouraged.)
|- BOUNDED ph   =>    |- ( ( [. (/) / x ]. ph /\ A. x e. om ( ph -> [. suc x / x ]. ph ) ) -> A. x e. om ph )
Theorem	bj-nn0suc0 12840*	Constructive proof of a variant of nn0suc 4478. For a constructive proof of nn0suc 4478, see bj-nn0suc 12854. (Contributed by BJ, 19-Nov-2019.) (Proof modification is discouraged.)
|- ( A e. om -> ( A = (/) \/ E. x e. A A = suc x ) )
Theorem	bj-nntrans 12841	A natural number is a transitive set. (Contributed by BJ, 22-Nov-2019.) (Proof modification is discouraged.)
|- ( A e. om -> ( B e. A -> B C_ A ) )
Theorem	bj-nntrans2 12842	A natural number is a transitive set. (Contributed by BJ, 22-Nov-2019.) (Proof modification is discouraged.)
|- ( A e. om -> Tr A )
Theorem	bj-nnelirr 12843	A natural number does not belong to itself. Version of elirr 4416 for natural numbers, which does not require ax-setind 4412. (Contributed by BJ, 24-Nov-2019.) (Proof modification is discouraged.)
|- ( A e. om -> -. A e. A )
Theorem	bj-nnen2lp 12844	A version of en2lp 4429 for natural numbers, which does not require ax-setind 4412. Note: using this theorem and bj-nnelirr 12843, one can remove dependency on ax-setind 4412 from nntri2 6344 and nndcel 6350; one can actually remove more dependencies from these. (Contributed by BJ, 28-Nov-2019.) (Proof modification is discouraged.)
|- ( ( A e. om /\ B e. om ) -> -. ( A e. B /\ B e. A ) )
Theorem	bj-peano4 12845	Remove from peano4 4471 dependency on ax-setind 4412. Therefore, it only requires core constructive axioms (albeit more of them). (Contributed by BJ, 28-Nov-2019.) (Proof modification is discouraged.)
|- ( ( A e. om /\ B e. om ) -> ( suc A = suc B <-> A = B ) )
Theorem	bj-omtrans 12846	The set om is transitive. A natural number is included in om. Constructive proof of elnn 4479. The idea is to use bounded induction with the formula x C_ om. This formula, in a logic with terms, is bounded. So in our logic without terms, we need to temporarily replace it with x C_ a and then deduce the original claim. (Contributed by BJ, 29-Dec-2019.) (Proof modification is discouraged.)
|- ( A e. om -> A C_ om )
Theorem	bj-omtrans2 12847	The set om is transitive. (Contributed by BJ, 29-Dec-2019.) (Proof modification is discouraged.)
|- Tr om
Theorem	bj-nnord 12848	A natural number is an ordinal. Constructive proof of nnord 4485. Can also be proved from bj-nnelon 12849 if the latter is proved from bj-omssonALT 12853. (Contributed by BJ, 27-Oct-2020.) (Proof modification is discouraged.)
|- ( A e. om -> Ord A )
Theorem	bj-nnelon 12849	A natural number is an ordinal. Constructive proof of nnon 4483. Can also be proved from bj-omssonALT 12853. (Contributed by BJ, 27-Oct-2020.) (Proof modification is discouraged.)
|- ( A e. om -> A e. On )
Theorem	bj-omord 12850	The set om is an ordinal. Constructive proof of ordom 4480. (Contributed by BJ, 29-Dec-2019.) (Proof modification is discouraged.)
|- Ord om
Theorem	bj-omelon 12851	The set om is an ordinal. Constructive proof of omelon 4482. (Contributed by BJ, 29-Dec-2019.) (Proof modification is discouraged.)
|- om e. On
Theorem	bj-omsson 12852	Constructive proof of omsson 4486. See also bj-omssonALT 12853. (Contributed by BJ, 27-Oct-2020.) (Proof modification is discouraged.) (New usage is discouraged.
|- om C_ On
Theorem	bj-omssonALT 12853	Alternate proof of bj-omsson 12852. (Contributed by BJ, 27-Oct-2020.) (Proof modification is discouraged.) (New usage is discouraged.)
|- om C_ On
Theorem	bj-nn0suc 12854*	Proof of (biconditional form of) nn0suc 4478 from the core axioms of CZF. See also bj-nn0sucALT 12868. As a characterization of the elements of om, this could be labeled "elom". (Contributed by BJ, 19-Nov-2019.) (Proof modification is discouraged.)
|- ( A e. om <-> ( A = (/) \/ E. x e. om A = suc x ) )
10.2.9  CZF: Set induction In this section, we add the axiom of set induction to the core axioms of CZF.
10.2.9.1  Set induction In this section, we prove some variants of the axiom of set induction.
Theorem	setindft 12855*	Axiom of set-induction with a disjoint variable condition replaced with a non-freeness hypothesis (Contributed by BJ, 22-Nov-2019.)
|- ( A. x F/ y ph -> ( A. x ( A. y e. x [ y / x ] ph -> ph ) -> A. x ph ) )
Theorem	setindf 12856*	Axiom of set-induction with a disjoint variable condition replaced with a non-freeness hypothesis (Contributed by BJ, 22-Nov-2019.)
|- F/ y ph   =>    |- ( A. x ( A. y e. x [ y / x ] ph -> ph ) -> A. x ph )
Theorem	setindis 12857*	Axiom of set induction using implicit substitutions. (Contributed by BJ, 22-Nov-2019.)
|- F/ x ps   &    |- F/ x ch   &    |- F/ y ph   &    |- F/ y ps   &    |- ( x = z -> ( ph -> ps ) )   &    |- ( x = y -> ( ch -> ph ) )   =>    |- ( A. y ( A. z e. y ps -> ch ) -> A. x ph )
Axiom	ax-bdsetind 12858*	Axiom of bounded set induction. (Contributed by BJ, 28-Nov-2019.)
|- BOUNDED ph   =>    |- ( A. a ( A. y e. a [ y / a ] ph -> ph ) -> A. a ph )
Theorem	bdsetindis 12859*	Axiom of bounded set induction using implicit substitutions. (Contributed by BJ, 22-Nov-2019.) (Proof modification is discouraged.)
|- BOUNDED ph   &    |- F/ x ps   &    |- F/ x ch   &    |- F/ y ph   &    |- F/ y ps   &    |- ( x = z -> ( ph -> ps ) )   &    |- ( x = y -> ( ch -> ph ) )   =>    |- ( A. y ( A. z e. y ps -> ch ) -> A. x ph )
Theorem	bj-inf2vnlem1 12860*	Lemma for bj-inf2vn 12864. Remark: unoptimized proof (have to use more deduction style). (Contributed by BJ, 8-Dec-2019.) (Proof modification is discouraged.)
|- ( A. x ( x e. A <-> ( x = (/) \/ E. y e. A x = suc y ) ) -> Ind A )
Theorem	bj-inf2vnlem2 12861*	Lemma for bj-inf2vnlem3 12862 and bj-inf2vnlem4 12863. Remark: unoptimized proof (have to use more deduction style). (Contributed by BJ, 8-Dec-2019.) (Proof modification is discouraged.)
|- ( A. x e. A ( x = (/) \/ E. y e. A x = suc y ) -> (Ind Z -> A. u ( A. t e. u ( t e. A -> t e. Z ) -> ( u e. A -> u e. Z ) ) ) )
Theorem	bj-inf2vnlem3 12862*	Lemma for bj-inf2vn 12864. (Contributed by BJ, 8-Dec-2019.) (Proof modification is discouraged.)
|- BOUNDED A   &    |- BOUNDED Z   =>    |- ( A. x e. A ( x = (/) \/ E. y e. A x = suc y ) -> (Ind Z -> A C_ Z ) )
Theorem	bj-inf2vnlem4 12863*	Lemma for bj-inf2vn2 12865. (Contributed by BJ, 8-Dec-2019.) (Proof modification is discouraged.)
|- ( A. x e. A ( x = (/) \/ E. y e. A x = suc y ) -> (Ind Z -> A C_ Z ) )
Theorem	bj-inf2vn 12864*	A sufficient condition for om to be a set. See bj-inf2vn2 12865 for the unbounded version from full set induction. (Contributed by BJ, 8-Dec-2019.) (Proof modification is discouraged.)
|- BOUNDED A   =>    |- ( A e. V -> ( A. x ( x e. A <-> ( x = (/) \/ E. y e. A x = suc y ) ) -> A = om ) )
Theorem	bj-inf2vn2 12865*	A sufficient condition for om to be a set; unbounded version of bj-inf2vn 12864. (Contributed by BJ, 8-Dec-2019.) (Proof modification is discouraged.)
|- ( A e. V -> ( A. x ( x e. A <-> ( x = (/) \/ E. y e. A x = suc y ) ) -> A = om ) )
Axiom	ax-inf2 12866*	Another axiom of infinity in a constructive setting (see ax-infvn 12831). (Contributed by BJ, 14-Nov-2019.) (New usage is discouraged.)
|- E. a A. x ( x e. a <-> ( x = (/) \/ E. y e. a x = suc y ) )
Theorem	bj-omex2 12867	Using bounded set induction and the strong axiom of infinity, om is a set, that is, we recover ax-infvn 12831 (see bj-2inf 12828 for the equivalence of the latter with bj-omex 12832). (Contributed by BJ, 8-Dec-2019.) (Proof modification is discouraged.) (New usage is discouraged.)
|- om e. _V
Theorem	bj-nn0sucALT 12868*	Alternate proof of bj-nn0suc 12854, also constructive but from ax-inf2 12866, hence requiring ax-bdsetind 12858. (Contributed by BJ, 8-Dec-2019.) (Proof modification is discouraged.) (New usage is discouraged.)
|- ( A e. om <-> ( A = (/) \/ E. x e. om A = suc x ) )
10.2.9.2  Full induction In this section, using the axiom of set induction, we prove full induction on the set of natural numbers.
Theorem	bj-findis 12869*	Principle of induction, using implicit substitutions (the biconditional versions of the hypotheses are implicit substitutions, and we have weakened them to implications). Constructive proof (from CZF). See bj-bdfindis 12837 for a bounded version not requiring ax-setind 4412. See finds 4474 for a proof in IZF. From this version, it is easy to prove of finds 4474, finds2 4475, finds1 4476. (Contributed by BJ, 22-Dec-2019.) (Proof modification is discouraged.)
|- F/ x ps   &    |- F/ x ch   &    |- F/ x th   &    |- ( x = (/) -> ( ps -> ph ) )   &    |- ( x = y -> ( ph -> ch ) )   &    |- ( x = suc y -> ( th -> ph ) )   =>    |- ( ( ps /\ A. y e. om ( ch -> th ) ) -> A. x e. om ph )
Theorem	bj-findisg 12870*	Version of bj-findis 12869 using a class term in the consequent. Constructive proof (from CZF). See the comment of bj-findis 12869 for explanations. (Contributed by BJ, 21-Nov-2019.) (Proof modification is discouraged.)
|- F/ x ps   &    |- F/ x ch   &    |- F/ x th   &    |- ( x = (/) -> ( ps -> ph ) )   &    |- ( x = y -> ( ph -> ch ) )   &    |- ( x = suc y -> ( th -> ph ) )   &    |- F/_ x A   &    |- F/ x ta   &    |- ( x = A -> ( ph -> ta ) )   =>    |- ( ( ps /\ A. y e. om ( ch -> th ) ) -> ( A e. om -> ta ) )
Theorem	bj-findes 12871	Principle of induction, using explicit substitutions. Constructive proof (from CZF). See the comment of bj-findis 12869 for explanations. From this version, it is easy to prove findes 4477. (Contributed by BJ, 21-Nov-2019.) (Proof modification is discouraged.)
|- ( ( [. (/) / x ]. ph /\ A. x e. om ( ph -> [. suc x / x ]. ph ) ) -> A. x e. om ph )
10.2.10  CZF: Strong collection In this section, we state the axiom scheme of strong collection, which is part of CZF set theory.
Axiom	ax-strcoll 12872*	Axiom scheme of strong collection. It is stated with all possible disjoint variable conditions, to show that this weak form is sufficient. (Contributed by BJ, 5-Oct-2019.)
|- A. a ( A. x e. a E. y ph -> E. b A. y ( y e. b <-> E. x e. a ph ) )
Theorem	strcoll2 12873*	Version of ax-strcoll 12872 with one disjoint variable condition removed and without initial universal quantifier. (Contributed by BJ, 5-Oct-2019.)
|- ( A. x e. a E. y ph -> E. b A. y ( y e. b <-> E. x e. a ph ) )
Theorem	strcollnft 12874*	Closed form of strcollnf 12875. Version of ax-strcoll 12872 with one disjoint variable condition removed, the other disjoint variable condition replaced with a non-freeness antecedent, and without initial universal quantifier. (Contributed by BJ, 21-Oct-2019.)
|- ( A. x A. y F/ b ph -> ( A. x e. a E. y ph -> E. b A. y ( y e. b <-> E. x e. a ph ) ) )
Theorem	strcollnf 12875*	Version of ax-strcoll 12872 with one disjoint variable condition removed, the other disjoint variable condition replaced with a non-freeness hypothesis, and without initial universal quantifier. (Contributed by BJ, 21-Oct-2019.)
|- F/ b ph   =>    |- ( A. x e. a E. y ph -> E. b A. y ( y e. b <-> E. x e. a ph ) )
Theorem	strcollnfALT 12876*	Alternate proof of strcollnf 12875, not using strcollnft 12874. (Contributed by BJ, 5-Oct-2019.) (Proof modification is discouraged.) (New usage is discouraged.)
|- F/ b ph   =>    |- ( A. x e. a E. y ph -> E. b A. y ( y e. b <-> E. x e. a ph ) )
10.2.11  CZF: Subset collection In this section, we state the axiom scheme of subset collection, which is part of CZF set theory.
Axiom	ax-sscoll 12877*	Axiom scheme of subset collection. It is stated with all possible disjoint variable conditions, to show that this weak form is sufficient. (Contributed by BJ, 5-Oct-2019.)
|- A. a A. b E. c A. z ( A. x e. a E. y e. b ph -> E. d e. c A. y ( y e. d <-> E. x e. a ph ) )
Theorem	sscoll2 12878*	Version of ax-sscoll 12877 with two disjoint variable conditions removed and without initial universal quantifiers. (Contributed by BJ, 5-Oct-2019.)
|- E. c A. z ( A. x e. a E. y e. b ph -> E. d e. c A. y ( y e. d <-> E. x e. a ph ) )
10.2.12  Real numbers
Axiom	ax-ddkcomp 12879	Axiom of Dedekind completeness for Dedekind real numbers: every inhabited upper-bounded located set of reals has a real upper bound. Ideally, this axiom should be "proved" as "axddkcomp" for the real numbers constructed from IZF, and then the axiom ax-ddkcomp 12879 should be used in place of construction specific results. In particular, axcaucvg 7635 should be proved from it. (Contributed by BJ, 24-Oct-2021.)
|- ( ( ( A C_ RR /\ E. x x e. A ) /\ E. x e. RR A. y e. A y < x /\ A. x e. RR A. y e. RR ( x < y -> ( E. z e. A x < z \/ A. z e. A z < y ) ) ) -> E. x e. RR ( A. y e. A y <_ x /\ ( ( B e. R /\ A. y e. A y <_ B ) -> x <_ B ) ) )
10.3  Mathbox for Jim Kingdon
10.3.1  Natural numbers
Theorem	el2oss1o 12880	Being an element of ordinal two implies being a subset of ordinal one. The converse is equivalent to excluded middle by ss1oel2o 12881. (Contributed by Jim Kingdon, 8-Aug-2022.)
|- ( A e. 2o -> A C_ 1o )
Theorem	ss1oel2o 12881	Any subset of ordinal one being an element of ordinal two is equivalent to excluded middle. A variation of exmid01 4081 which more directly illustrates the contrast with el2oss1o 12880. (Contributed by Jim Kingdon, 8-Aug-2022.)
|- (EXMID <-> A. x ( x C_ 1o -> x e. 2o ) )
Theorem	pw1dom2 12882	The power set of 1o dominates 2o. Also see pwpw0ss 3697 which is similar. (Contributed by Jim Kingdon, 21-Sep-2022.)
|- 2o ~<_ ~P 1o
Theorem	nnti 12883	Ordering on a natural number generates a tight apartness. (Contributed by Jim Kingdon, 7-Aug-2022.)
|- ( ph -> A e. om )   =>    |- ( ( ph /\ ( u e. A /\ v e. A ) ) -> ( u = v <-> ( -. u _E v /\ -. v _E u ) ) )
10.3.2  The power set of a singleton
Theorem	pwtrufal 12884	A subset of the singleton { (/) } cannot be anything other than (/) or { (/) }. Removing the double negation would change the meaning, as seen at exmid01 4081. If we view a subset of a singleton as a truth value (as seen in theorems like exmidexmid 4080), then this theorem states there are no truth values other than true and false, as described in section 1.1 of [Bauer], p. 481. (Contributed by Mario Carneiro and Jim Kingdon, 11-Sep-2023.)
|- ( A C_ { (/) } -> -. -. ( A = (/) \/ A = { (/) } ) )
Theorem	pwle2 12885*	An exercise related to N copies of a singleton and the power set of a singleton (where the latter can also be thought of as representing truth values). Posed as an exercise by Martin Escardo online. (Contributed by Jim Kingdon, 3-Sep-2023.)
|- T = U_ x e. N ( { x } X. 1o )   =>    |- ( ( N e. om /\ G : T -1-1-> ~P 1o ) -> N C_ 2o )
Theorem	pwf1oexmid 12886*	An exercise related to N copies of a singleton and the power set of a singleton (where the latter can also be thought of as representing truth values). Posed as an exercise by Martin Escardo online. (Contributed by Jim Kingdon, 3-Sep-2023.)
|- T = U_ x e. N ( { x } X. 1o )   =>    |- ( ( N e. om /\ G : T -1-1-> ~P 1o ) -> ( ran G = ~P 1o <-> ( N = 2o /\ EXMID ) ) )
Theorem	exmid1stab 12887*	If any proposition is stable, excluded middle follows. We are thinking of x as a proposition and x = { (/) } as "x is true". (Contributed by Jim Kingdon, 28-Nov-2023.)
|- ( ( ph /\ x C_ { (/) } ) -> STAB x = { (/) } )   =>    |- ( ph -> EXMID )
Theorem	subctctexmid 12888*	If every subcountable set is countable and Markov's principle holds, excluded middle follows. Proposition 2.6 of [BauerSwan], p. 14:4. The proof is taken from that paper. (Contributed by Jim Kingdon, 29-Nov-2023.)
|- ( ph -> A. x ( E. s ( s C_ om /\ E. f f : s -onto-> x ) -> E. g g : om -onto-> ( x ⊔ 1o ) ) )   &    |- ( ph -> om e. Markov )   =>    |- ( ph -> EXMID )
10.3.3  Omniscience of NN+oo
Theorem	0nninf 12889	The zero element of ℕ∞ (the constant sequence equal to (/)). (Contributed by Jim Kingdon, 14-Jul-2022.)
|- ( om X. { (/) } ) e. ℕ∞
Theorem	nninff 12890	An element of ℕ∞ is a sequence of zeroes and ones. (Contributed by Jim Kingdon, 4-Aug-2022.)
|- ( A e. ℕ∞ -> A : om --> 2o )
Theorem	nnsf 12891*	Domain and range of S. Part of Definition 3.3 of [PradicBrown2022], p. 5. (Contributed by Jim Kingdon, 30-Jul-2022.)
|- S = ( p e. ℕ∞ |-> ( i e. om |-> if ( i = (/) , 1o , ( p ` U. i ) ) ) )   =>    |- S :ℕ∞ -->ℕ∞
Theorem	peano4nninf 12892*	The successor function on ℕ∞ is one to one. Half of Lemma 3.4 of [PradicBrown2022], p. 5. (Contributed by Jim Kingdon, 31-Jul-2022.)
|- S = ( p e. ℕ∞ |-> ( i e. om |-> if ( i = (/) , 1o , ( p ` U. i ) ) ) )   =>    |- S :ℕ∞ -1-1->ℕ∞
Theorem	peano3nninf 12893*	The successor function on ℕ∞ is never zero. Half of Lemma 3.4 of [PradicBrown2022], p. 5. (Contributed by Jim Kingdon, 1-Aug-2022.)
|- S = ( p e. ℕ∞ |-> ( i e. om |-> if ( i = (/) , 1o , ( p ` U. i ) ) ) )   =>    |- ( A e. ℕ∞ -> ( S ` A ) =/= ( x e. om |-> (/) ) )
Theorem	nninfalllemn 12894*	Lemma for nninfall 12896. Mapping of a natural number to an element of ℕ∞. (Contributed by Jim Kingdon, 4-Aug-2022.)
|- ( ph -> P e. ℕ∞ )   &    |- ( ph -> N e. om )   &    |- ( ph -> A. x e. N ( P ` x ) = 1o )   &    |- ( ph -> ( P ` N ) = (/) )   =>    |- ( ph -> P = ( i e. om |-> if ( i e. N , 1o , (/) ) ) )
Theorem	nninfalllem1 12895*	Lemma for nninfall 12896. (Contributed by Jim Kingdon, 1-Aug-2022.)
|- ( ph -> Q e. ( 2o ^m ℕ∞ ) )   &    |- ( ph -> ( Q ` ( x e. om |-> 1o ) ) = 1o )   &    |- ( ph -> A. n e. om ( Q ` ( i e. om |-> if ( i e. n , 1o , (/) ) ) ) = 1o )   &    |- ( ph -> P e. ℕ∞ )   &    |- ( ph -> ( Q ` P ) = (/) )   =>    |- ( ph -> A. n e. om ( P ` n ) = 1o )
Theorem	nninfall 12896*	Given a decidable predicate on ℕ∞, showing it holds for natural numbers and the point at infinity suffices to show it holds everywhere. The sense in which Q is a decidable predicate is that it assigns a value of either (/) or 1o (which can be thought of as false and true) to every element of ℕ∞. Lemma 3.5 of [PradicBrown2022], p. 5. (Contributed by Jim Kingdon, 1-Aug-2022.)
|- ( ph -> Q e. ( 2o ^m ℕ∞ ) )   &    |- ( ph -> ( Q ` ( x e. om |-> 1o ) ) = 1o )   &    |- ( ph -> A. n e. om ( Q ` ( i e. om |-> if ( i e. n , 1o , (/) ) ) ) = 1o )   =>    |- ( ph -> A. p e. ℕ∞ ( Q ` p ) = 1o )
Theorem	nninfex 12897	ℕ∞ is a set. (Contributed by Jim Kingdon, 10-Aug-2022.)
|- ℕ∞ e. _V
Theorem	nninfsellemdc 12898*	Lemma for nninfself 12901. Showing that the selection function is well defined. (Contributed by Jim Kingdon, 8-Aug-2022.)
|- ( ( Q e. ( 2o ^m ℕ∞ ) /\ N e. om ) -> DECID A. k e. suc N ( Q ` ( i e. om |-> if ( i e. k , 1o , (/) ) ) ) = 1o )
Theorem	nninfsellemcl 12899*	Lemma for nninfself 12901. (Contributed by Jim Kingdon, 8-Aug-2022.)
|- ( ( Q e. ( 2o ^m ℕ∞ ) /\ N e. om ) -> if ( A. k e. suc N ( Q ` ( i e. om |-> if ( i e. k , 1o , (/) ) ) ) = 1o , 1o , (/) ) e. 2o )
Theorem	nninfsellemsuc 12900*	Lemma for nninfself 12901. (Contributed by Jim Kingdon, 6-Aug-2022.)
|- ( ( Q e. ( 2o ^m ℕ∞ ) /\ J e. om ) -> if ( A. k e. suc suc J ( Q ` ( i e. om |-> if ( i e. k , 1o , (/) ) ) ) = 1o , 1o , (/) ) C_ if ( A. k e. suc J ( Q ` ( i e. om |-> if ( i e. k , 1o , (/) ) ) ) = 1o , 1o , (/) ) )