P. 140 of Theorem List - Intuitionistic Logic Explorer

Theorem List for Intuitionistic Logic Explorer - 13901-14000   *Has distinct variable group(s)

Type	Label	Description
Statement
Theorem	bdcnulALT 13901	Alternate proof of bdcnul 13900. Similarly, for the next few theorems proving boundedness of a class, one can either use their definition followed by bdceqir 13879, or use the corresponding characterizations of its elements followed by bdelir 13882. (Contributed by BJ, 3-Oct-2019.) (Proof modification is discouraged.) (New usage is discouraged.)
|- BOUNDED (/)
Theorem	bdeq0 13902	Boundedness of the formula expressing that a setvar is equal to the empty class. (Contributed by BJ, 21-Nov-2019.)
|- BOUNDED x = (/)
Theorem	bj-bd0el 13903	Boundedness of the formula "the empty set belongs to the setvar x". (Contributed by BJ, 30-Nov-2019.)
|- BOUNDED (/) e. x
Theorem	bdcpw 13904	The power class of a bounded class is bounded. (Contributed by BJ, 3-Oct-2019.)
|- BOUNDED A   =>    |- BOUNDED ~P A
Theorem	bdcsn 13905	The singleton of a setvar is bounded. (Contributed by BJ, 16-Oct-2019.)
|- BOUNDED { x }
Theorem	bdcpr 13906	The pair of two setvars is bounded. (Contributed by BJ, 16-Oct-2019.)
|- BOUNDED { x , y }
Theorem	bdctp 13907	The unordered triple of three setvars is bounded. (Contributed by BJ, 16-Oct-2019.)
|- BOUNDED { x , y , z }
Theorem	bdsnss 13908*	Inclusion of a singleton of a setvar in a bounded class is a bounded formula. (Contributed by BJ, 16-Oct-2019.)
|- BOUNDED A   =>    |- BOUNDED { x } C_ A
Theorem	bdvsn 13909*	Equality of a setvar with a singleton of a setvar is a bounded formula. (Contributed by BJ, 16-Oct-2019.)
|- BOUNDED x = { y }
Theorem	bdop 13910	The ordered pair of two setvars is a bounded class. (Contributed by BJ, 21-Nov-2019.)
|- BOUNDED <. x , y >.
Theorem	bdcuni 13911	The union of a setvar is a bounded class. (Contributed by BJ, 15-Oct-2019.)
|- BOUNDED U. x
Theorem	bdcint 13912	The intersection of a setvar is a bounded class. (Contributed by BJ, 16-Oct-2019.)
|- BOUNDED |^| x
Theorem	bdciun 13913*	The indexed union of a bounded class with a setvar indexing set is a bounded class. (Contributed by BJ, 16-Oct-2019.)
|- BOUNDED A   =>    |- BOUNDED U_ x e. y A
Theorem	bdciin 13914*	The indexed intersection of a bounded class with a setvar indexing set is a bounded class. (Contributed by BJ, 16-Oct-2019.)
|- BOUNDED A   =>    |- BOUNDED |^|_ x e. y A
Theorem	bdcsuc 13915	The successor of a setvar is a bounded class. (Contributed by BJ, 16-Oct-2019.)
|- BOUNDED suc x
Theorem	bdeqsuc 13916*	Boundedness of the formula expressing that a setvar is equal to the successor of another. (Contributed by BJ, 21-Nov-2019.)
|- BOUNDED x = suc y
Theorem	bj-bdsucel 13917	Boundedness of the formula "the successor of the setvar x belongs to the setvar y". (Contributed by BJ, 30-Nov-2019.)
|- BOUNDED suc x e. y
Theorem	bdcriota 13918*	A class given by a restricted definition binder is bounded, under the given hypotheses. (Contributed by BJ, 24-Nov-2019.)
|- BOUNDED ph   &    |- E! x e. y ph   =>    |- BOUNDED ( iota_ x e. y ph )
12.2.9  CZF: Bounded separation In this section, we state the axiom scheme of bounded separation, which is part of CZF set theory.
Axiom	ax-bdsep 13919*	Axiom scheme of bounded (or restricted, or Δ0) separation. It is stated with all possible disjoint variable conditions, to show that this weak form is sufficient. For the full axiom of separation, see ax-sep 4107. (Contributed by BJ, 5-Oct-2019.)
|- BOUNDED ph   =>    |- A. a E. b A. x ( x e. b <-> ( x e. a /\ ph ) )
Theorem	bdsep1 13920*	Version of ax-bdsep 13919 without initial universal quantifier. (Contributed by BJ, 5-Oct-2019.)
|- BOUNDED ph   =>    |- E. b A. x ( x e. b <-> ( x e. a /\ ph ) )
Theorem	bdsep2 13921*	Version of ax-bdsep 13919 with one disjoint variable condition removed and without initial universal quantifier. Use bdsep1 13920 when sufficient. (Contributed by BJ, 5-Oct-2019.)
|- BOUNDED ph   =>    |- E. b A. x ( x e. b <-> ( x e. a /\ ph ) )
Theorem	bdsepnft 13922*	Closed form of bdsepnf 13923. Version of ax-bdsep 13919 with one disjoint variable condition removed, the other disjoint variable condition replaced by a nonfreeness antecedent, and without initial universal quantifier. Use bdsep1 13920 when sufficient. (Contributed by BJ, 19-Oct-2019.)
|- BOUNDED ph   =>    |- ( A. x F/ b ph -> E. b A. x ( x e. b <-> ( x e. a /\ ph ) ) )
Theorem	bdsepnf 13923*	Version of ax-bdsep 13919 with one disjoint variable condition removed, the other disjoint variable condition replaced by a nonfreeness hypothesis, and without initial universal quantifier. See also bdsepnfALT 13924. Use bdsep1 13920 when sufficient. (Contributed by BJ, 5-Oct-2019.)
|- F/ b ph   &    |- BOUNDED ph   =>    |- E. b A. x ( x e. b <-> ( x e. a /\ ph ) )
Theorem	bdsepnfALT 13924*	Alternate proof of bdsepnf 13923, not using bdsepnft 13922. (Contributed by BJ, 5-Oct-2019.) (Proof modification is discouraged.) (New usage is discouraged.)
|- F/ b ph   &    |- BOUNDED ph   =>    |- E. b A. x ( x e. b <-> ( x e. a /\ ph ) )
Theorem	bdzfauscl 13925*	Closed form of the version of zfauscl 4109 for bounded formulas using bounded separation. (Contributed by BJ, 13-Nov-2019.)
|- BOUNDED ph   =>    |- ( A e. V -> E. y A. x ( x e. y <-> ( x e. A /\ ph ) ) )
Theorem	bdbm1.3ii 13926*	Bounded version of bm1.3ii 4110. (Contributed by BJ, 5-Oct-2019.) (Proof modification is discouraged.)
|- BOUNDED ph   &    |- E. x A. y ( ph -> y e. x )   =>    |- E. x A. y ( y e. x <-> ph )
Theorem	bj-axemptylem 13927*	Lemma for bj-axempty 13928 and bj-axempty2 13929. (Contributed by BJ, 25-Oct-2020.) (Proof modification is discouraged.) Use ax-nul 4115 instead. (New usage is discouraged.)
|- E. x A. y ( y e. x -> F. )
Theorem	bj-axempty 13928*	Axiom of the empty set from bounded separation. It is provable from bounded separation since the intuitionistic FOL used in iset.mm assumes a nonempty universe. See axnul 4114. (Contributed by BJ, 25-Oct-2020.) (Proof modification is discouraged.) Use ax-nul 4115 instead. (New usage is discouraged.)
|- E. x A. y e. x F.
Theorem	bj-axempty2 13929*	Axiom of the empty set from bounded separation, alternate version to bj-axempty 13928. (Contributed by BJ, 27-Oct-2020.) (Proof modification is discouraged.) Use ax-nul 4115 instead. (New usage is discouraged.)
|- E. x A. y -. y e. x
Theorem	bj-nalset 13930*	nalset 4119 from bounded separation. (Contributed by BJ, 18-Nov-2019.) (Proof modification is discouraged.)
|- -. E. x A. y y e. x
Theorem	bj-vprc 13931	vprc 4121 from bounded separation. (Contributed by BJ, 18-Nov-2019.) (Proof modification is discouraged.)
|- -. _V e. _V
Theorem	bj-nvel 13932	nvel 4122 from bounded separation. (Contributed by BJ, 18-Nov-2019.) (Proof modification is discouraged.)
|- -. _V e. A
Theorem	bj-vnex 13933	vnex 4120 from bounded separation. (Contributed by BJ, 18-Nov-2019.) (Proof modification is discouraged.)
|- -. E. x x = _V
Theorem	bdinex1 13934	Bounded version of inex1 4123. (Contributed by BJ, 13-Nov-2019.) (Proof modification is discouraged.)
|- BOUNDED B   &    |- A e. _V   =>    |- ( A i^i B ) e. _V
Theorem	bdinex2 13935	Bounded version of inex2 4124. (Contributed by BJ, 13-Nov-2019.) (Proof modification is discouraged.)
|- BOUNDED B   &    |- A e. _V   =>    |- ( B i^i A ) e. _V
Theorem	bdinex1g 13936	Bounded version of inex1g 4125. (Contributed by BJ, 13-Nov-2019.) (Proof modification is discouraged.)
|- BOUNDED B   =>    |- ( A e. V -> ( A i^i B ) e. _V )
Theorem	bdssex 13937	Bounded version of ssex 4126. (Contributed by BJ, 13-Nov-2019.) (Proof modification is discouraged.)
|- BOUNDED A   &    |- B e. _V   =>    |- ( A C_ B -> A e. _V )
Theorem	bdssexi 13938	Bounded version of ssexi 4127. (Contributed by BJ, 13-Nov-2019.) (Proof modification is discouraged.)
|- BOUNDED A   &    |- B e. _V   &    |- A C_ B   =>    |- A e. _V
Theorem	bdssexg 13939	Bounded version of ssexg 4128. (Contributed by BJ, 13-Nov-2019.) (Proof modification is discouraged.)
|- BOUNDED A   =>    |- ( ( A C_ B /\ B e. C ) -> A e. _V )
Theorem	bdssexd 13940	Bounded version of ssexd 4129. (Contributed by BJ, 13-Nov-2019.) (Proof modification is discouraged.)
|- ( ph -> B e. C )   &    |- ( ph -> A C_ B )   &    |- BOUNDED A   =>    |- ( ph -> A e. _V )
Theorem	bdrabexg 13941*	Bounded version of rabexg 4132. (Contributed by BJ, 19-Nov-2019.) (Proof modification is discouraged.)
|- BOUNDED ph   &    |- BOUNDED A   =>    |- ( A e. V -> { x e. A | ph } e. _V )
Theorem	bj-inex 13942	The intersection of two sets is a set, from bounded separation. (Contributed by BJ, 19-Nov-2019.) (Proof modification is discouraged.)
|- ( ( A e. V /\ B e. W ) -> ( A i^i B ) e. _V )
Theorem	bj-intexr 13943	intexr 4136 from bounded separation. (Contributed by BJ, 18-Nov-2019.) (Proof modification is discouraged.)
|- ( |^| A e. _V -> A =/= (/) )
Theorem	bj-intnexr 13944	intnexr 4137 from bounded separation. (Contributed by BJ, 18-Nov-2019.) (Proof modification is discouraged.)
|- ( |^| A = _V -> -. |^| A e. _V )
Theorem	bj-zfpair2 13945	Proof of zfpair2 4195 using only bounded separation. (Contributed by BJ, 5-Oct-2019.) (Proof modification is discouraged.)
|- { x , y } e. _V
Theorem	bj-prexg 13946	Proof of prexg 4196 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 13947	snexg 4170 from bounded separation. (Contributed by BJ, 5-Oct-2019.) (Proof modification is discouraged.)
|- ( A e. V -> { A } e. _V )
Theorem	bj-snex 13948	snex 4171 from bounded separation. (Contributed by BJ, 5-Oct-2019.) (Proof modification is discouraged.)
|- A e. _V   =>    |- { A } e. _V
Theorem	bj-sels 13949*	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 13950*	axun2 4420 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 13951*	uniex2 4421 from bounded separation. (Contributed by BJ, 15-Oct-2019.) (Proof modification is discouraged.)
|- E. y y = U. x
Theorem	bj-uniex 13952	uniex 4422 from bounded separation. (Contributed by BJ, 13-Nov-2019.) (Proof modification is discouraged.)
|- A e. _V   =>    |- U. A e. _V
Theorem	bj-uniexg 13953	uniexg 4424 from bounded separation. (Contributed by BJ, 13-Nov-2019.) (Proof modification is discouraged.)
|- ( A e. V -> U. A e. _V )
Theorem	bj-unex 13954	unex 4426 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 13955	Bounded version of unexb 4427. (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 13956	unexg 4428 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 13957	sucexg 4482 from bounded separation. (Contributed by BJ, 13-Nov-2019.) (Proof modification is discouraged.)
|- ( A e. V -> suc A e. _V )
Theorem	bj-sucex 13958	sucex 4483 from bounded separation. (Contributed by BJ, 13-Nov-2019.) (Proof modification is discouraged.)
|- A e. _V   =>    |- suc A e. _V
12.2.9.1  Delta_0-classical logic
Axiom	ax-bj-d0cl 13959	Axiom for Δ0-classical logic. (Contributed by BJ, 2-Jan-2020.)
|- BOUNDED ph   =>    |- DECID ph
Theorem	bj-d0clsepcl 13960	Δ0-classical logic and separation implies classical logic. (Contributed by BJ, 2-Jan-2020.) (Proof modification is discouraged.)
|- DECID ph
12.2.9.2  Inductive classes and the class of natural number ordinals
Syntax	wind 13961	Syntax for inductive classes.
wff Ind A
Definition	df-bj-ind 13962*	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 13963	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 13964	Equality property for Ind. (Contributed by BJ, 30-Nov-2019.)
|- ( A = B -> (Ind A <-> Ind B ) )
Theorem	bj-bdind 13965	Boundedness of the formula "the setvar x is an inductive class". (Contributed by BJ, 30-Nov-2019.)
|- BOUNDED Ind x
Theorem	bj-indint 13966*	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 13967*	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 13968	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 13969	om is an inductive class. (Contributed by BJ, 30-Nov-2019.)
|- Ind om
Theorem	bj-omssind 13970	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 13971*	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 13972*	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 13973*	Two formulations of the axiom of infinity (see ax-infvn 13976 and bj-omex 13977) . (Contributed by BJ, 30-Nov-2019.) (Proof modification is discouraged.)
|- ( om e. _V <-> E. x (Ind x /\ A. y (Ind y -> x C_ y ) ) )
12.2.9.3  The first three Peano postulates The first three Peano postulates follow from constructive set theory (actually, from its core axioms). The proofs peano1 4578 and peano3 4580 already show this. In this section, we prove bj-peano2 13974 to complete this program. We also prove a preliminary version of the fifth Peano postulate from the core axioms.
Theorem	bj-peano2 13974	Constructive proof of peano2 4579. Temporary note: another possibility is to simply replace sucexg 4482 with bj-sucexg 13957 in the proof of peano2 4579. (Contributed by BJ, 18-Nov-2019.) (Proof modification is discouraged.)
|- ( A e. om -> suc A e. om )
Theorem	peano5set 13975*	Version of peano5 4582 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 ) )
12.2.10  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.
12.2.10.1  The set of natural number ordinals In this section, we introduce the axiom of infinity in a constructive setting (ax-infvn 13976) and deduce that the class om of natural number ordinals is a set (bj-omex 13977).
Axiom	ax-infvn 13976*	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 4572) from which one then proves, using full separation, that the wanted set exists (omex 4577). "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 13977	Proof of omex 4577 from ax-infvn 13976. (Contributed by BJ, 14-Nov-2019.) (Proof modification is discouraged.)
|- om e. _V
12.2.10.2  Peano's fifth postulate In this section, we give constructive proofs of two versions of Peano's fifth postulate.
Theorem	bdpeano5 13978*	Bounded version of peano5 4582. (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 13979*	Version of peano5 4582 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 )
12.2.10.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 natural number ordinals satisfies the five Peano postulates and thus provides a model for the set of natural numbers.
Theorem	findset 13980*	Bounded induction (principle of induction when A is assumed to be a set) allowing a proof from basic constructive axioms. See find 4583 for a nonconstructive proof of the general case. See bdfind 13981 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 13981*	Bounded induction (principle of induction when A is assumed to be bounded), proved from basic constructive axioms. See find 4583 for a nonconstructive proof of the general case. See findset 13980 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 13982*	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 4584 for a proof of full induction in IZF. From this version, it is easy to prove bounded versions of finds 4584, finds2 4585, finds1 4586. (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 13983*	Version of bj-bdfindis 13982 using a class term in the consequent. Constructive proof (from CZF). See the comment of bj-bdfindis 13982 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 13984	Bounded induction (principle of induction for bounded formulas), using explicit substitutions. Constructive proof (from CZF). See the comment of bj-bdfindis 13982 for explanations. From this version, it is easy to prove the bounded version of findes 4587. (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 13985*	Constructive proof of a variant of nn0suc 4588. For a constructive proof of nn0suc 4588, see bj-nn0suc 13999. (Contributed by BJ, 19-Nov-2019.) (Proof modification is discouraged.)
|- ( A e. om -> ( A = (/) \/ E. x e. A A = suc x ) )
Theorem	bj-nntrans 13986	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 13987	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 13988	A natural number does not belong to itself. Version of elirr 4525 for natural numbers, which does not require ax-setind 4521. (Contributed by BJ, 24-Nov-2019.) (Proof modification is discouraged.)
|- ( A e. om -> -. A e. A )
Theorem	bj-nnen2lp 13989	A version of en2lp 4538 for natural numbers, which does not require ax-setind 4521. Note: using this theorem and bj-nnelirr 13988, one can remove dependency on ax-setind 4521 from nntri2 6473 and nndcel 6479; 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 13990	Remove from peano4 4581 dependency on ax-setind 4521. 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 13991	The set om is transitive. A natural number is included in om. Constructive proof of elnn 4590. 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 13992	The set om is transitive. (Contributed by BJ, 29-Dec-2019.) (Proof modification is discouraged.)
|- Tr om
Theorem	bj-nnord 13993	A natural number is an ordinal class. Constructive proof of nnord 4596. Can also be proved from bj-nnelon 13994 if the latter is proved from bj-omssonALT 13998. (Contributed by BJ, 27-Oct-2020.) (Proof modification is discouraged.)
|- ( A e. om -> Ord A )
Theorem	bj-nnelon 13994	A natural number is an ordinal. Constructive proof of nnon 4594. Can also be proved from bj-omssonALT 13998. (Contributed by BJ, 27-Oct-2020.) (Proof modification is discouraged.)
|- ( A e. om -> A e. On )
Theorem	bj-omord 13995	The set om is an ordinal class. Constructive proof of ordom 4591. (Contributed by BJ, 29-Dec-2019.) (Proof modification is discouraged.)
|- Ord om
Theorem	bj-omelon 13996	The set om is an ordinal. Constructive proof of omelon 4593. (Contributed by BJ, 29-Dec-2019.) (Proof modification is discouraged.)
|- om e. On
Theorem	bj-omsson 13997	Constructive proof of omsson 4597. See also bj-omssonALT 13998. (Contributed by BJ, 27-Oct-2020.) (Proof modification is discouraged.) (New usage is discouraged.
|- om C_ On
Theorem	bj-omssonALT 13998	Alternate proof of bj-omsson 13997. (Contributed by BJ, 27-Oct-2020.) (Proof modification is discouraged.) (New usage is discouraged.)
|- om C_ On
Theorem	bj-nn0suc 13999*	Proof of (biconditional form of) nn0suc 4588 from the core axioms of CZF. See also bj-nn0sucALT 14013. 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 ) )
12.2.11  CZF: Set induction In this section, we add the axiom of set induction to the core axioms of CZF.
12.2.11.1  Set induction In this section, we prove some variants of the axiom of set induction.
Theorem	setindft 14000*	Axiom of set-induction with a disjoint variable condition replaced with a nonfreeness 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 ) )