HomeHome Intuitionistic Logic Explorer
Theorem List (p. 105 of 106)
< Previous  Next >
Browser slow? Try the
Unicode version.

Mirrors  >  Metamath Home Page  >  ILE Home Page  >  Theorem List Contents  >  Recent Proofs       This page: Page List

Theorem List for Intuitionistic Logic Explorer - 10401-10500   *Has distinct variable group(s)
TypeLabelDescription
Statement
 
Theorembj-axempty2 10401* Axiom of the empty set from bounded separation, alternate version to bj-axempty 10400. (Contributed by BJ, 27-Oct-2020.) (Proof modification is discouraged.) Use ax-nul 3911 instead. (New usage is discouraged.)
 |-  E. x A. y  -.  y  e.  x
 
Theorembj-nalset 10402* nalset 3915 from bounded separation. (Contributed by BJ, 18-Nov-2019.) (Proof modification is discouraged.)
 |-  -.  E. x A. y  y  e.  x
 
Theorembj-vprc 10403 vprc 3916 from bounded separation. (Contributed by BJ, 18-Nov-2019.) (Proof modification is discouraged.)
 |-  -.  _V  e.  _V
 
Theorembj-nvel 10404 nvel 3917 from bounded separation. (Contributed by BJ, 18-Nov-2019.) (Proof modification is discouraged.)
 |-  -.  _V  e.  A
 
Theorembj-vnex 10405 vnex 3918 from bounded separation. (Contributed by BJ, 18-Nov-2019.) (Proof modification is discouraged.)
 |-  -.  E. x  x  =  _V
 
Theorembdinex1 10406 Bounded version of inex1 3919. (Contributed by BJ, 13-Nov-2019.) (Proof modification is discouraged.)
 |- BOUNDED  B   &    |-  A  e.  _V   =>    |-  ( A  i^i  B )  e. 
 _V
 
Theorembdinex2 10407 Bounded version of inex2 3920. (Contributed by BJ, 13-Nov-2019.) (Proof modification is discouraged.)
 |- BOUNDED  B   &    |-  A  e.  _V   =>    |-  ( B  i^i  A )  e. 
 _V
 
Theorembdinex1g 10408 Bounded version of inex1g 3921. (Contributed by BJ, 13-Nov-2019.) (Proof modification is discouraged.)
 |- BOUNDED  B   =>    |-  ( A  e.  V  ->  ( A  i^i  B )  e.  _V )
 
Theorembdssex 10409 Bounded version of ssex 3922. (Contributed by BJ, 13-Nov-2019.) (Proof modification is discouraged.)
 |- BOUNDED  A   &    |-  B  e.  _V   =>    |-  ( A  C_  B  ->  A  e.  _V )
 
Theorembdssexi 10410 Bounded version of ssexi 3923. (Contributed by BJ, 13-Nov-2019.) (Proof modification is discouraged.)
 |- BOUNDED  A   &    |-  B  e.  _V   &    |-  A  C_  B   =>    |-  A  e.  _V
 
Theorembdssexg 10411 Bounded version of ssexg 3924. (Contributed by BJ, 13-Nov-2019.) (Proof modification is discouraged.)
 |- BOUNDED  A   =>    |-  ( ( A  C_  B  /\  B  e.  C )  ->  A  e.  _V )
 
Theorembdssexd 10412 Bounded version of ssexd 3925. (Contributed by BJ, 13-Nov-2019.) (Proof modification is discouraged.)
 |-  ( ph  ->  B  e.  C )   &    |-  ( ph  ->  A  C_  B )   &    |- BOUNDED  A   =>    |-  ( ph  ->  A  e.  _V )
 
Theorembdrabexg 10413* Bounded version of rabexg 3928. (Contributed by BJ, 19-Nov-2019.) (Proof modification is discouraged.)
 |- BOUNDED  ph   &    |- BOUNDED  A   =>    |-  ( A  e.  V  ->  { x  e.  A  |  ph }  e.  _V )
 
Theorembj-inex 10414 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 )
 
Theorembj-intexr 10415 intexr 3932 from bounded separation. (Contributed by BJ, 18-Nov-2019.) (Proof modification is discouraged.)
 |-  ( |^| A  e.  _V  ->  A  =/=  (/) )
 
Theorembj-intnexr 10416 intnexr 3933 from bounded separation. (Contributed by BJ, 18-Nov-2019.) (Proof modification is discouraged.)
 |-  ( |^| A  =  _V  ->  -. 
 |^| A  e.  _V )
 
Theorembj-zfpair2 10417 Proof of zfpair2 3973 using only bounded separation. (Contributed by BJ, 5-Oct-2019.) (Proof modification is discouraged.)
 |-  { x ,  y }  e.  _V
 
Theorembj-prexg 10418 Proof of prexg 3975 using only bounded separation. (Contributed by BJ, 5-Oct-2019.) (Proof modification is discouraged.)
 |-  (
 ( A  e.  V  /\  B  e.  W ) 
 ->  { A ,  B }  e.  _V )
 
Theorembj-snexg 10419 snexg 3964 from bounded separation. (Contributed by BJ, 5-Oct-2019.) (Proof modification is discouraged.)
 |-  ( A  e.  V  ->  { A }  e.  _V )
 
Theorembj-snex 10420 snex 3965 from bounded separation. (Contributed by BJ, 5-Oct-2019.) (Proof modification is discouraged.)
 |-  A  e.  _V   =>    |- 
 { A }  e.  _V
 
Theorembj-sels 10421* 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 )
 
Theorembj-axun2 10422* axun2 4200 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 ) )
 
Theorembj-uniex2 10423* uniex2 4201 from bounded separation. (Contributed by BJ, 15-Oct-2019.) (Proof modification is discouraged.)
 |-  E. y  y  =  U. x
 
Theorembj-uniex 10424 uniex 4202 from bounded separation. (Contributed by BJ, 13-Nov-2019.) (Proof modification is discouraged.)
 |-  A  e.  _V   =>    |- 
 U. A  e.  _V
 
Theorembj-uniexg 10425 uniexg 4203 from bounded separation. (Contributed by BJ, 13-Nov-2019.) (Proof modification is discouraged.)
 |-  ( A  e.  V  ->  U. A  e.  _V )
 
Theorembj-unex 10426 unex 4204 from bounded separation. (Contributed by BJ, 13-Nov-2019.) (Proof modification is discouraged.)
 |-  A  e.  _V   &    |-  B  e.  _V   =>    |-  ( A  u.  B )  e. 
 _V
 
Theorembdunexb 10427 Bounded version of unexb 4205. (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 )
 
Theorembj-unexg 10428 unexg 4206 from bounded separation. (Contributed by BJ, 13-Nov-2019.) (Proof modification is discouraged.)
 |-  (
 ( A  e.  V  /\  B  e.  W ) 
 ->  ( A  u.  B )  e.  _V )
 
Theorembj-sucexg 10429 sucexg 4252 from bounded separation. (Contributed by BJ, 13-Nov-2019.) (Proof modification is discouraged.)
 |-  ( A  e.  V  ->  suc 
 A  e.  _V )
 
Theorembj-sucex 10430 sucex 4253 from bounded separation. (Contributed by BJ, 13-Nov-2019.) (Proof modification is discouraged.)
 |-  A  e.  _V   =>    |- 
 suc  A  e.  _V
 
6.3.6.1  Delta_0-classical logic
 
Axiomax-bj-d0cl 10431 Axiom for Δ0-classical logic. (Contributed by BJ, 2-Jan-2020.)
 |- BOUNDED  ph   =>    |- DECID  ph
 
Theorembj-notbi 10432 Equivalence property for negation. TODO: minimize all theorems using notbid 602 and notbii 604. (Contributed by BJ, 27-Jan-2020.) (Proof modification is discouraged.)
 |-  (
 ( ph  <->  ps )  ->  ( -.  ph  <->  -.  ps ) )
 
Theorembj-notbii 10433 Inference associated with bj-notbi 10432. (Contributed by BJ, 27-Jan-2020.) (Proof modification is discouraged.)
 |-  ( ph 
 <->  ps )   =>    |-  ( -.  ph  <->  -.  ps )
 
Theorembj-notbid 10434 Deduction form of bj-notbi 10432. (Contributed by BJ, 27-Jan-2020.) (Proof modification is discouraged.)
 |-  ( ph  ->  ( ps  <->  ch ) )   =>    |-  ( ph  ->  ( -.  ps  <->  -.  ch ) )
 
Theorembj-dcbi 10435 Equivalence property for DECID. TODO: solve conflict with dcbi 855; minimize dcbii 758 and dcbid 759 with it, as well as theorems using those. (Contributed by BJ, 27-Jan-2020.) (Proof modification is discouraged.)
 |-  (
 ( ph  <->  ps )  ->  (DECID  ph  <-> DECID  ps ) )
 
Theorembj-d0clsepcl 10436 Δ0-classical logic and separation implies classical logic. (Contributed by BJ, 2-Jan-2020.) (Proof modification is discouraged.)
 |- DECID  ph
 
6.3.6.2  Inductive classes and the class of natural numbers (finite ordinals)
 
Syntaxwind 10437 Syntax for inductive classes.
 wff Ind  A
 
Definitiondf-bj-ind 10438* 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 ) )
 
Theorembj-indsuc 10439 A direct consequence of the definition of Ind. (Contributed by BJ, 30-Nov-2019.)
 |-  (Ind  A  ->  ( B  e.  A  ->  suc  B  e.  A ) )
 
Theorembj-indeq 10440 Equality property for Ind. (Contributed by BJ, 30-Nov-2019.)
 |-  ( A  =  B  ->  (Ind 
 A 
 <-> Ind 
 B ) )
 
Theorembj-bdind 10441 Boundedness of the formula "the setvar  x is an inductive class". (Contributed by BJ, 30-Nov-2019.)
 |- BOUNDED Ind  x
 
Theorembj-indint 10442* The property of being an inductive class is closed under intersections. (Contributed by BJ, 30-Nov-2019.)
 |- Ind  |^| { x  e.  A  | Ind  x }
 
Theorembj-indind 10443* 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 ) )
 
Theorembj-dfom 10444 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 }
 
Theorembj-omind 10445  om is an inductive class. (Contributed by BJ, 30-Nov-2019.)
 |- Ind  om
 
Theorembj-omssind 10446  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 ) )
 
Theorembj-ssom 10447* 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 )
 
Theorembj-om 10448* 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 ) ) ) )
 
Theorembj-2inf 10449* Two formulations of the axiom of infinity (see ax-infvn 10453 and bj-omex 10454) . (Contributed by BJ, 30-Nov-2019.) (Proof modification is discouraged.)
 |-  ( om  e.  _V  <->  E. x (Ind  x  /\  A. y (Ind  y  ->  x  C_  y )
 ) )
 
6.3.6.3  The first three Peano postulates

The first three Peano postulates follow from constructive set theory (actually, from its core axioms). The proofs peano1 4345 and peano3 4347 already show this. In this section, we prove bj-peano2 10450 to complete this program. We also prove a preliminary version of the fifth Peano postulate from the core axioms.

 
Theorembj-peano2 10450 Constructive proof of peano2 4346. Temporary note: another possibility is to simply replace sucexg 4252 with bj-sucexg 10429 in the proof of peano2 4346. (Contributed by BJ, 18-Nov-2019.) (Proof modification is discouraged.)
 |-  ( A  e.  om  ->  suc  A  e.  om )
 
Theorempeano5set 10451* Version of peano5 4349 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 ) )
 
Theorempeano5setOLD 10452* Obsolete version of peano5set 10451 as of 26-Oct-2020. (Contributed by BJ, 19-Nov-2019.) (Proof modification is discouraged.) (New usage is discouraged.)
 |-  (
 ( om  i^i  A )  e.  V  ->  (
 ( (/)  e.  A  /\  A. x  e.  om  ( x  e.  A  ->  suc 
 x  e.  A ) )  ->  om  C_  A ) )
 
6.3.7  Axiom of 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.

 
6.3.7.1  The set of natural numbers (finite ordinals)

In this section, we introduce the axiom of infinity in a constructive setting (ax-infvn 10453) and deduce that the class  om of finite ordinals is a set (bj-omex 10454).

 
Axiomax-infvn 10453* 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 4339) from which one then proves, using full separation, that the wanted set exists (omex 4344). "vn" is for "Von Neumann". (Contributed by BJ, 14-Nov-2019.)
 |-  E. x (Ind  x  /\  A. y
 (Ind  y  ->  x  C_  y ) )
 
Theorembj-omex 10454 Proof of omex 4344 from ax-infvn 10453. (Contributed by BJ, 14-Nov-2019.) (Proof modification is discouraged.)
 |-  om  e.  _V
 
6.3.7.2  Peano's fifth postulate

In this section, we give constructive proofs of two versions of Peano's fifth postulate.

 
Theorembdpeano5 10455* Bounded version of peano5 4349. (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 )
 
Theoremspeano5 10456* Version of peano5 4349 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 )
 
6.3.7.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.

 
Theoremfindset 10457* Bounded induction (principle of induction when  A is assumed to be a set) allowing a proof from basic constructive axioms. See find 4350 for a nonconstructive proof of the general case. See bdfind 10458 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 )
 )
 
Theorembdfind 10458* Bounded induction (principle of induction when  A is assumed to be bounded), proved from basic constructive axioms. See find 4350 for a nonconstructive proof of the general case. See findset 10457 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 )
 
Theorembj-bdfindis 10459* 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 4351 for a proof of full induction in IZF. From this version, it is easy to prove bounded versions of finds 4351, finds2 4352, finds1 4353. (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 )
 
Theorembj-bdfindisg 10460* Version of bj-bdfindis 10459 using a class term in the consequent. Constructive proof (from CZF). See the comment of bj-bdfindis 10459 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 )
 )
 
Theorembj-bdfindes 10461 Bounded induction (principle of induction for bounded formulas), using explicit substitutions. Constructive proof (from CZF). See the comment of bj-bdfindis 10459 for explanations. From this version, it is easy to prove the bounded version of findes 4354. (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 )
 
Theorembj-nn0suc0 10462* Constructive proof of a variant of nn0suc 4355. For a constructive proof of nn0suc 4355, see bj-nn0suc 10476. (Contributed by BJ, 19-Nov-2019.) (Proof modification is discouraged.)
 |-  ( A  e.  om  ->  ( A  =  (/)  \/  E. x  e.  A  A  =  suc  x ) )
 
Theorembj-nntrans 10463 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 ) )
 
Theorembj-nntrans2 10464 A natural number is a transitive set. (Contributed by BJ, 22-Nov-2019.) (Proof modification is discouraged.)
 |-  ( A  e.  om  ->  Tr  A )
 
Theorembj-nnelirr 10465 A natural number does not belong to itself. Version of elirr 4294 for natural numbers, which does not require ax-setind 4290. (Contributed by BJ, 24-Nov-2019.) (Proof modification is discouraged.)
 |-  ( A  e.  om  ->  -.  A  e.  A )
 
Theorembj-nnen2lp 10466 A version of en2lp 4306 for natural numbers, which does not require ax-setind 4290.

Note: using this theorem and bj-nnelirr 10465, one can remove dependency on ax-setind 4290 from nntri2 6104 and nndcel 6109; 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 ) )
 
Theorembj-peano4 10467 Remove from peano4 4348 dependency on ax-setind 4290. 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 ) )
 
Theorembj-omtrans 10468 The set  om is transitive. A natural number is included in  om. Constructive proof of elnn 4356.

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 )
 
Theorembj-omtrans2 10469 The set  om is transitive. (Contributed by BJ, 29-Dec-2019.) (Proof modification is discouraged.)
 |-  Tr  om
 
Theorembj-nnord 10470 A natural number is an ordinal. Constructive proof of nnord 4362. Can also be proved from bj-nnelon 10471 if the latter is proved from bj-omssonALT 10475. (Contributed by BJ, 27-Oct-2020.) (Proof modification is discouraged.)
 |-  ( A  e.  om  ->  Ord  A )
 
Theorembj-nnelon 10471 A natural number is an ordinal. Constructive proof of nnon 4360. Can also be proved from bj-omssonALT 10475. (Contributed by BJ, 27-Oct-2020.) (Proof modification is discouraged.)
 |-  ( A  e.  om  ->  A  e.  On )
 
Theorembj-omord 10472 The set  om is an ordinal. Constructive proof of ordom 4357. (Contributed by BJ, 29-Dec-2019.) (Proof modification is discouraged.)
 |-  Ord  om
 
Theorembj-omelon 10473 The set  om is an ordinal. Constructive proof of omelon 4359. (Contributed by BJ, 29-Dec-2019.) (Proof modification is discouraged.)
 |-  om  e.  On
 
Theorembj-omsson 10474 Constructive proof of omsson 4363. See also bj-omssonALT 10475. (Contributed by BJ, 27-Oct-2020.) (Proof modification is discouraged.) (New usage is discouraged.
 |-  om  C_ 
 On
 
Theorembj-omssonALT 10475 Alternate proof of bj-omsson 10474. (Contributed by BJ, 27-Oct-2020.) (Proof modification is discouraged.) (New usage is discouraged.)
 |-  om  C_ 
 On
 
Theorembj-nn0suc 10476* Proof of (biconditional form of) nn0suc 4355 from the core axioms of CZF. See also bj-nn0sucALT 10490. 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 ) )
 
6.3.8  Set induction

In this section, we add the axiom of set induction to the core axioms of CZF.

 
6.3.8.1  Set induction

In this section, we prove some variants of the axiom of set induction.

 
Theoremsetindft 10477* Axiom of set-induction with a DV 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 ) )
 
Theoremsetindf 10478* Axiom of set-induction with a DV 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 )
 
Theoremsetindis 10479* 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 )
 
Axiomax-bdsetind 10480* 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 )
 
Theorembdsetindis 10481* 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 )
 
Theorembj-inf2vnlem1 10482* Lemma for bj-inf2vn 10486. 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 )
 
Theorembj-inf2vnlem2 10483* Lemma for bj-inf2vnlem3 10484 and bj-inf2vnlem4 10485. 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 ) ) ) )
 
Theorembj-inf2vnlem3 10484* Lemma for bj-inf2vn 10486. (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 ) )
 
Theorembj-inf2vnlem4 10485* Lemma for bj-inf2vn2 10487. (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 ) )
 
Theorembj-inf2vn 10486* A sufficient condition for  om to be a set. See bj-inf2vn2 10487 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 )
 )
 
Theorembj-inf2vn2 10487* A sufficient condition for  om to be a set; unbounded version of bj-inf2vn 10486. (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 )
 )
 
Axiomax-inf2 10488* Another axiom of infinity in a constructive setting (see ax-infvn 10453). (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 ) )
 
Theorembj-omex2 10489 Using bounded set induction and the strong axiom of infinity,  om is a set, that is, we recover ax-infvn 10453 (see bj-2inf 10449 for the equivalence of the latter with bj-omex 10454). (Contributed by BJ, 8-Dec-2019.) (Proof modification is discouraged.) (New usage is discouraged.)
 |-  om  e.  _V
 
Theorembj-nn0sucALT 10490* Alternate proof of bj-nn0suc 10476, also constructive but from ax-inf2 10488, hence requiring ax-bdsetind 10480. (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 ) )
 
6.3.8.2  Full induction

In this section, using the axiom of set induction, we prove full induction on the set of natural numbers.

 
Theorembj-findis 10491* 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 10459 for a bounded version not requiring ax-setind 4290. See finds 4351 for a proof in IZF. From this version, it is easy to prove of finds 4351, finds2 4352, finds1 4353. (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 )
 
Theorembj-findisg 10492* Version of bj-findis 10491 using a class term in the consequent. Constructive proof (from CZF). See the comment of bj-findis 10491 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 )
 )
 
Theorembj-findes 10493 Principle of induction, using explicit substitutions. Constructive proof (from CZF). See the comment of bj-findis 10491 for explanations. From this version, it is easy to prove findes 4354. (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 )
 
6.3.9  Strong collection

In this section, we state the axiom scheme of strong collection, which is part of CZF set theory.

 
Axiomax-strcoll 10494* 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 ) )
 
Theoremstrcoll2 10495* Version of ax-strcoll 10494 with one DV 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 ) )
 
Theoremstrcollnft 10496* Closed form of strcollnf 10497. Version of ax-strcoll 10494 with one DV condition removed, the other DV condition replaced by 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 ) ) )
 
Theoremstrcollnf 10497* Version of ax-strcoll 10494 with one DV condition removed, the other DV condition replaced by 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 ) )
 
TheoremstrcollnfALT 10498* Alternate proof of strcollnf 10497, not using strcollnft 10496. (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 ) )
 
6.3.10  Subset collection

In this section, we state the axiom scheme of subset collection, which is part of CZF set theory.

 
Axiomax-sscoll 10499* 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 ) )
 
Theoremsscoll2 10500* Version of ax-sscoll 10499 with two DV 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 ) )
    < Previous  Next >

Page List
Jump to page: Contents  1 1-100 2 101-200 3 201-300 4 301-400 5 401-500 6 501-600 7 601-700 8 701-800 9 801-900 10 901-1000 11 1001-1100 12 1101-1200 13 1201-1300 14 1301-1400 15 1401-1500 16 1501-1600 17 1601-1700 18 1701-1800 19 1801-1900 20 1901-2000 21 2001-2100 22 2101-2200 23 2201-2300 24 2301-2400 25 2401-2500 26 2501-2600 27 2601-2700 28 2701-2800 29 2801-2900 30 2901-3000 31 3001-3100 32 3101-3200 33 3201-3300 34 3301-3400 35 3401-3500 36 3501-3600 37 3601-3700 38 3701-3800 39 3801-3900 40 3901-4000 41 4001-4100 42 4101-4200 43 4201-4300 44 4301-4400 45 4401-4500 46 4501-4600 47 4601-4700 48 4701-4800 49 4801-4900 50 4901-5000 51 5001-5100 52 5101-5200 53 5201-5300 54 5301-5400 55 5401-5500 56 5501-5600 57 5601-5700 58 5701-5800 59 5801-5900 60 5901-6000 61 6001-6100 62 6101-6200 63 6201-6300 64 6301-6400 65 6401-6500 66 6501-6600 67 6601-6700 68 6701-6800 69 6801-6900 70 6901-7000 71 7001-7100 72 7101-7200 73 7201-7300 74 7301-7400 75 7401-7500 76 7501-7600 77 7601-7700 78 7701-7800 79 7801-7900 80 7901-8000 81 8001-8100 82 8101-8200 83 8201-8300 84 8301-8400 85 8401-8500 86 8501-8600 87 8601-8700 88 8701-8800 89 8801-8900 90 8901-9000 91 9001-9100 92 9101-9200 93 9201-9300 94 9301-9400 95 9401-9500 96 9501-9600 97 9601-9700 98 9701-9800 99 9801-9900 100 9901-10000 101 10001-10100 102 10101-10200 103 10201-10300 104 10301-10400 105 10401-10500 106 10501-10511
  Copyright terms: Public domain < Previous  Next >