Home | Intuitionistic Logic Explorer Theorem List (p. 94 of 95) | < Previous Next > |
Browser slow? Try the
Unicode version. |
||
Mirrors > Metamath Home Page > ILE Home Page > Theorem List Contents > Recent Proofs This page: Page List |
Type | Label | Description |
---|---|---|
Statement | ||
Theorem | bdcnulALT 9301 | Alternate proof of bdcnul 9300. Similarly, for the next few theorems proving boundedness of a class, one can either use their definition followed by bdceqir 9279, or use the corresponding characterizations of its elements followed by bdelir 9282. (Contributed by BJ, 3-Oct-2019.) (Proof modification is discouraged.) (New usage is discouraged.) |
BOUNDED | ||
Theorem | bdeq0 9302 | Boundedness of the formula expressing that a setvar is equal to the empty class. (Contributed by BJ, 21-Nov-2019.) |
BOUNDED | ||
Theorem | bj-bd0el 9303 | Boundedness of the formula "the empty set belongs to the setvar ". (Contributed by BJ, 30-Nov-2019.) |
BOUNDED | ||
Theorem | bdcpw 9304 | The power class of a bounded class is bounded. (Contributed by BJ, 3-Oct-2019.) |
BOUNDED BOUNDED | ||
Theorem | bdcsn 9305 | The singleton of a setvar is bounded. (Contributed by BJ, 16-Oct-2019.) |
BOUNDED | ||
Theorem | bdcpr 9306 | The pair of two setvars is bounded. (Contributed by BJ, 16-Oct-2019.) |
BOUNDED | ||
Theorem | bdctp 9307 | The unordered triple of three setvars is bounded. (Contributed by BJ, 16-Oct-2019.) |
BOUNDED | ||
Theorem | bdsnss 9308* | Inclusion of a singleton of a setvar in a bounded class is a bounded formula. (Contributed by BJ, 16-Oct-2019.) |
BOUNDED BOUNDED | ||
Theorem | bdvsn 9309* | Equality of a setvar with a singleton of a setvar is a bounded formula. (Contributed by BJ, 16-Oct-2019.) |
BOUNDED | ||
Theorem | bdop 9310 | The ordered pair of two setvars is a bounded class. (Contributed by BJ, 21-Nov-2019.) |
BOUNDED | ||
Theorem | bdcuni 9311 | The union of a setvar is a bounded class. (Contributed by BJ, 15-Oct-2019.) |
BOUNDED | ||
Theorem | bdcint 9312 | The intersection of a setvar is a bounded class. (Contributed by BJ, 16-Oct-2019.) |
BOUNDED | ||
Theorem | bdciun 9313* | The indexed union of a bounded class with a setvar indexing set is a bounded class. (Contributed by BJ, 16-Oct-2019.) |
BOUNDED BOUNDED | ||
Theorem | bdciin 9314* | The indexed intersection of a bounded class with a setvar indexing set is a bounded class. (Contributed by BJ, 16-Oct-2019.) |
BOUNDED BOUNDED | ||
Theorem | bdcsuc 9315 | The successor of a setvar is a bounded class. (Contributed by BJ, 16-Oct-2019.) |
BOUNDED | ||
Theorem | bdeqsuc 9316* | Boundedness of the formula expressing that a setvar is equal to the successor of another. (Contributed by BJ, 21-Nov-2019.) |
BOUNDED | ||
Theorem | bj-bdsucel 9317 | Boundedness of the formula "the successor of the setvar belongs to the setvar ". (Contributed by BJ, 30-Nov-2019.) |
BOUNDED | ||
Theorem | bdcriota 9318* | A class given by a restricted definition binder is bounded, under the given hypotheses. (Contributed by BJ, 24-Nov-2019.) |
BOUNDED BOUNDED | ||
In this section, we state the axiom scheme of bounded separation, which is part of CZF set theory. | ||
Axiom | ax-bdsep 9319* | 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 3866. (Contributed by BJ, 5-Oct-2019.) |
BOUNDED | ||
Theorem | bdsep2 9320* | Version of ax-bdsep 9319 with one DV condition removed and without initial universal quantifier. (Contributed by BJ, 5-Oct-2019.) |
BOUNDED | ||
Theorem | bdsepnft 9321* | Closed form of bdsepnf 9322. Version of ax-bdsep 9319 with one DV condition removed, the other DV condition replaced by a non-freeness antecedent, and without initial universal quantifier. (Contributed by BJ, 19-Oct-2019.) |
BOUNDED | ||
Theorem | bdsepnf 9322* | Version of ax-bdsep 9319 with one DV condition removed, the other DV condition replaced by a non-freeness hypothesis, and without initial universal quantifier. See also bdsepnfALT 9323. (Contributed by BJ, 5-Oct-2019.) |
BOUNDED | ||
Theorem | bdsepnfALT 9323* | Alternate proof of bdsepnf 9322, not using bdsepnft 9321. (Contributed by BJ, 5-Oct-2019.) (Proof modification is discouraged.) (New usage is discouraged.) |
BOUNDED | ||
Theorem | bdzfauscl 9324* | Closed form of the version of zfauscl 3868 for bounded formulas using bounded separation. (Contributed by BJ, 13-Nov-2019.) |
BOUNDED | ||
Theorem | bdbm1.3ii 9325* | Bounded version of bm1.3ii 3869. (Contributed by BJ, 5-Oct-2019.) (Proof modification is discouraged.) |
BOUNDED | ||
Theorem | bj-nalset 9326* | nalset 3878 from bounded separation. (Contributed by BJ, 18-Nov-2019.) (Proof modification is discouraged.) |
Theorem | bj-vprc 9327 | vprc 3879 from bounded separation. (Contributed by BJ, 18-Nov-2019.) (Proof modification is discouraged.) |
Theorem | bj-nvel 9328 | nvel 3880 from bounded separation. (Contributed by BJ, 18-Nov-2019.) (Proof modification is discouraged.) |
Theorem | bj-vnex 9329 | vnex 3881 from bounded separation. (Contributed by BJ, 18-Nov-2019.) (Proof modification is discouraged.) |
Theorem | bdinex1 9330 | Bounded version of inex1 3882. (Contributed by BJ, 13-Nov-2019.) (Proof modification is discouraged.) |
BOUNDED | ||
Theorem | bdinex2 9331 | Bounded version of inex2 3883. (Contributed by BJ, 13-Nov-2019.) (Proof modification is discouraged.) |
BOUNDED | ||
Theorem | bdinex1g 9332 | Bounded version of inex1g 3884. (Contributed by BJ, 13-Nov-2019.) (Proof modification is discouraged.) |
BOUNDED | ||
Theorem | bdssex 9333 | Bounded version of ssex 3885. (Contributed by BJ, 13-Nov-2019.) (Proof modification is discouraged.) |
BOUNDED | ||
Theorem | bdssexi 9334 | Bounded version of ssexi 3886. (Contributed by BJ, 13-Nov-2019.) (Proof modification is discouraged.) |
BOUNDED | ||
Theorem | bdssexg 9335 | Bounded version of ssexg 3887. (Contributed by BJ, 13-Nov-2019.) (Proof modification is discouraged.) |
BOUNDED | ||
Theorem | bdssexd 9336 | Bounded version of ssexd 3888. (Contributed by BJ, 13-Nov-2019.) (Proof modification is discouraged.) |
BOUNDED | ||
Theorem | bdrabexg 9337* | Bounded version of rabexg 3891. (Contributed by BJ, 19-Nov-2019.) (Proof modification is discouraged.) |
BOUNDED BOUNDED | ||
Theorem | bj-inex 9338 | The intersection of two sets is a set, from bounded separation. (Contributed by BJ, 19-Nov-2019.) (Proof modification is discouraged.) |
Theorem | bj-intexr 9339 | vnex 3881 from bounded separation. (Contributed by BJ, 18-Nov-2019.) (Proof modification is discouraged.) |
Theorem | bj-intnexr 9340 | vnex 3881 from bounded separation. (Contributed by BJ, 18-Nov-2019.) (Proof modification is discouraged.) |
Theorem | bj-zfpair2 9341 | Proof of zfpair2 3936 using only bounded separation. (Contributed by BJ, 5-Oct-2019.) (Proof modification is discouraged.) |
Theorem | bj-prexg 9342 | Proof of prexg 3938 using only bounded separation. (Contributed by BJ, 5-Oct-2019.) (Proof modification is discouraged.) |
Theorem | bj-snexg 9343 | snexg 3927 from bounded separation. (Contributed by BJ, 5-Oct-2019.) (Proof modification is discouraged.) |
Theorem | bj-snex 9344 | snex 3928 from bounded separation. (Contributed by BJ, 5-Oct-2019.) (Proof modification is discouraged.) |
Theorem | bj-sels 9345* | If a class is a set, then it is a member of a set. (Copied from set.mm.) (Contributed by BJ, 3-Apr-2019.) |
Theorem | bj-axun2 9346* | axun2 4138 from bounded separation. (Contributed by BJ, 15-Oct-2019.) (Proof modification is discouraged.) |
Theorem | bj-uniex2 9347* | uniex2 4139 from bounded separation. (Contributed by BJ, 15-Oct-2019.) (Proof modification is discouraged.) |
Theorem | bj-uniex 9348 | uniex 4140 from bounded separation. (Contributed by BJ, 13-Nov-2019.) (Proof modification is discouraged.) |
Theorem | bj-uniexg 9349 | uniexg 4141 from bounded separation. (Contributed by BJ, 13-Nov-2019.) (Proof modification is discouraged.) |
Theorem | bj-unex 9350 | unex 4142 from bounded separation. (Contributed by BJ, 13-Nov-2019.) (Proof modification is discouraged.) |
Theorem | bdunexb 9351 | Bounded version of unexb 4143. (Contributed by BJ, 13-Nov-2019.) (Proof modification is discouraged.) |
BOUNDED BOUNDED | ||
Theorem | bj-unexg 9352 | unexg 4144 from bounded separation. (Contributed by BJ, 13-Nov-2019.) (Proof modification is discouraged.) |
Theorem | bj-sucexg 9353 | sucexg 4190 from bounded separation. (Contributed by BJ, 13-Nov-2019.) (Proof modification is discouraged.) |
Theorem | bj-sucex 9354 | sucex 4191 from bounded separation. (Contributed by BJ, 13-Nov-2019.) (Proof modification is discouraged.) |
Axiom | ax-bj-d0cl 9355 | Axiom for Δ_{0}-classical logic. (Contributed by BJ, 2-Jan-2020.) |
BOUNDED DECID | ||
Theorem | bj-notbi 9356 | Equivalence property for negation. TODO: minimize all theorems using notbid 591 and notbii 593. (Contributed by BJ, 27-Jan-2020.) (Proof modification is discouraged.) |
Theorem | bj-notbii 9357 | Inference associated with bj-notbi 9356. (Contributed by BJ, 27-Jan-2020.) (Proof modification is discouraged.) |
Theorem | bj-notbid 9358 | Deduction form of bj-notbi 9356. (Contributed by BJ, 27-Jan-2020.) (Proof modification is discouraged.) |
Theorem | bj-dcbi 9359 | Equivalence property for DECID. TODO: solve conflict with dcbi 843; minimize dcbii 746 and dcbid 747 with it, as well as theorems using those. (Contributed by BJ, 27-Jan-2020.) (Proof modification is discouraged.) |
DECID DECID | ||
Theorem | bj-d0clsepcl 9360 | Δ_{0}-classical logic and separation implies classical logic. (Contributed by BJ, 2-Jan-2020.) (Proof modification is discouraged.) |
DECID | ||
Syntax | wind 9361 | Syntax for inductive classes. |
Ind | ||
Definition | df-bj-ind 9362* | Define the property of being an inductive class. (Contributed by BJ, 30-Nov-2019.) |
Ind | ||
Theorem | bj-indsuc 9363 | A direct consequence of the definition of Ind. (Contributed by BJ, 30-Nov-2019.) |
Ind | ||
Theorem | bj-indeq 9364 | Equality property for Ind. (Contributed by BJ, 30-Nov-2019.) |
Ind Ind | ||
Theorem | bj-bdind 9365 | Boundedness of the formula "the setvar is an inductive class". (Contributed by BJ, 30-Nov-2019.) |
BOUNDED Ind | ||
Theorem | bj-indint 9366* | The property of being an inductive class is closed under intersections. (Contributed by BJ, 30-Nov-2019.) |
Ind Ind | ||
Theorem | bj-dfom 9367 | Alternate definition of , as the intersection of all the inductive sets. Proposal: make this the definition. (Contributed by BJ, 30-Nov-2019.) |
Ind | ||
Theorem | bj-omind 9368 | is an inductive class. (Contributed by BJ, 30-Nov-2019.) |
Ind | ||
Theorem | bj-omssind 9369 | 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.) |
Ind | ||
Theorem | bj-ssom 9370* | A characterization of subclasses of . (Contributed by BJ, 30-Nov-2019.) (Proof modification is discouraged.) |
Ind | ||
Theorem | bj-om 9371* | A set is equal to if and only if it is the smallest inductive set. (Contributed by BJ, 30-Nov-2019.) (Proof modification is discouraged.) |
Ind Ind | ||
Theorem | bj-2inf 9372* | Two formulations of the axiom of infinity (see ax-infvn 9375 and bj-omex 9376) . (Contributed by BJ, 30-Nov-2019.) (Proof modification is discouraged.) |
Ind Ind | ||
The first three Peano postulates do not require the axiom of infinity. We give constructive proofs (only the proof of the second postulate has to be modified). We also prove a preliminary version of the fifth Peano postulate. | ||
Theorem | bj-peano2 9373 | Constructive proof of peano2 4261. Temporary note: another possibility is to simply replace sucexg 4190 with bj-sucexg 9353 in the proof of peano2 4261. (Contributed by BJ, 18-Nov-2019.) (Proof modification is discouraged.) |
Theorem | peano5set 9374* | Version of peano5 4264 when 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.) |
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. | ||
In this section, we introduce the axiom of infinity in a constructive setting (ax-infvn 9375) and deduce that the class of finite ordinals is a set (bj-omex 9376). | ||
Axiom | ax-infvn 9375* | 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 4254) from which one then proves (omex 4259) using full separation that the wanted set exists. "vn" is for "Von Neumann". (Contributed by BJ, 14-Nov-2019.) |
Ind Ind | ||
Theorem | bj-omex 9376 | Proof of omex 4259 from ax-infvn 9375. (Contributed by BJ, 14-Nov-2019.) (Proof modification is discouraged.) |
In this section, we give constructive proofs of the remaining two (the fourth and fifth) Peano postulates. More precisely, we prove from the core axioms of CZF that the set of finite ordinals satisfies the Peano postulates and thus provides a model for the set of natural numbers. | ||
Theorem | bdpeano5 9377* | Bounded version of peano5 4264. (Contributed by BJ, 19-Nov-2019.) (Proof modification is discouraged.) |
BOUNDED | ||
Theorem | speano5 9378* | Version of peano5 4264 when 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.) |
In this section, we prove various versions of bounded induction from the basic axioms of CZF (in particular, without the axiom of set induction). | ||
Theorem | findset 9379* | Bounded induction (principle of induction when is assumed to be a set) allowing a proof from basic constructive axioms. See find 4265 for a nonconstructive proof of the general case. See bdfind 9380 for a proof when is assumed to be bounded. (Contributed by BJ, 22-Nov-2019.) (Proof modification is discouraged.) |
Theorem | bdfind 9380* | Bounded induction (principle of induction when is assumed to be bounded), proved from basic constructive axioms. See find 4265 for a nonconstructive proof of the general case. See findset 9379 for a proof when is assumed to be a set. (Contributed by BJ, 22-Nov-2019.) (Proof modification is discouraged.) |
BOUNDED | ||
Theorem | bj-bdfindis 9381* | 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 4266 for a proof of full induction in IZF. From this version, it is easy to prove bounded versions of finds 4266, finds2 4267, finds1 4268. (Contributed by BJ, 21-Nov-2019.) (Proof modification is discouraged.) |
BOUNDED | ||
Theorem | bj-bdfindisg 9382* | Version of bj-bdfindis 9381 using a class term in the consequent. Constructive proof (from CZF). See the comment of bj-bdfindis 9381 for explanations. (Contributed by BJ, 21-Nov-2019.) (Proof modification is discouraged.) |
BOUNDED | ||
Theorem | bj-bdfindes 9383 | Bounded induction (principle of induction for bounded formulas), using explicit substitutions. Constructive proof (from CZF). See the comment of bj-bdfindis 9381 for explanations. From this version, it is easy to prove the bounded version of findes 4269. (Contributed by BJ, 21-Nov-2019.) (Proof modification is discouraged.) |
BOUNDED | ||
Theorem | bj-nn0suc0 9384* | Constructive proof of a variant of nn0suc 4270. For a constructive proof of nn0suc 4270, see bj-nn0suc 9394. (Contributed by BJ, 19-Nov-2019.) (Proof modification is discouraged.) |
Theorem | bj-nntrans 9385 | A natural number is a transitive set. (Contributed by BJ, 22-Nov-2019.) (Proof modification is discouraged.) |
Theorem | bj-nntrans2 9386 | A natural number is a transitive set. (Contributed by BJ, 22-Nov-2019.) (Proof modification is discouraged.) |
Theorem | bj-nnelirr 9387 | A natural number does not belong to itself. Version of elirr 4224 for natural numbers, which does not require ax-setind 4220. (Contributed by BJ, 24-Nov-2019.) (Proof modification is discouraged.) |
Theorem | bj-nnen2lp 9388 |
A version of en2lp 4232 for natural numbers, which does not require
ax-setind 4220.
Note: using this theorem and bj-nnelirr 9387, one can remove dependency on ax-setind 4220 from nntri2 6012 and nndcel 6016; one can actually remove more dependencies from these. (Contributed by BJ, 28-Nov-2019.) (Proof modification is discouraged.) |
Theorem | bj-peano4 9389 | Remove from peano4 4263 dependency on ax-setind 4220. Therefore, it only requires core constructive axioms (albeit more of them). (Contributed by BJ, 28-Nov-2019.) (Proof modification is discouraged.) |
Theorem | bj-omtrans 9390 |
The set is
transitive. A natural number is included in
.
The idea is to use bounded induction with the formula . This formula, in a logic with terms, is bounded. So in our logic without terms, we need to temporarily replace it with and then deduce the original claim. (Contributed by BJ, 29-Dec-2019.) (Proof modification is discouraged.) |
Theorem | bj-omtrans2 9391 | The set is transitive. (Contributed by BJ, 29-Dec-2019.) (Proof modification is discouraged.) |
Theorem | bj-omord 9392 | The set is an ordinal. (Contributed by BJ, 29-Dec-2019.) (Proof modification is discouraged.) |
Theorem | bj-omelon 9393 | The set is an ordinal. Constructive proof of omelon 4274. (Contributed by BJ, 29-Dec-2019.) (Proof modification is discouraged.) |
Theorem | bj-nn0suc 9394* | Proof of (biconditional form of) nn0suc 4270 from the core axioms of CZF. See also bj-nn0sucALT 9408. As a characterization of the elements of , this could be labeled "elom". (Contributed by BJ, 19-Nov-2019.) (Proof modification is discouraged.) |
In this section, we add the axiom of set induction to the core axioms of CZF. | ||
In this section, we prove some variants of the axiom of set induction. | ||
Theorem | setindft 9395* | Axiom of set-induction with a DV condition replaced with a non-freeness hypothesis (Contributed by BJ, 22-Nov-2019.) |
Theorem | setindf 9396* | Axiom of set-induction with a DV condition replaced with a non-freeness hypothesis (Contributed by BJ, 22-Nov-2019.) |
Theorem | setindis 9397* | Axiom of set induction using implicit substitutions. (Contributed by BJ, 22-Nov-2019.) |
Axiom | ax-bdsetind 9398* | Axiom of bounded set induction. (Contributed by BJ, 28-Nov-2019.) |
BOUNDED | ||
Theorem | bdsetindis 9399* | Axiom of bounded set induction using implicit substitutions. (Contributed by BJ, 22-Nov-2019.) (Proof modification is discouraged.) |
BOUNDED | ||
Theorem | bj-inf2vnlem1 9400* | Lemma for bj-inf2vn 9404. Remark: unoptimized proof (have to use more deduction style). (Contributed by BJ, 8-Dec-2019.) (Proof modification is discouraged.) |
Ind |
< Previous Next > |
Copyright terms: Public domain | < Previous Next > |