HomeHome Intuitionistic Logic Explorer
Theorem List (p. 40 of 114)
< Previous  Next >
Bad symbols? Try the
GIF version.

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

Theorem List for Intuitionistic Logic Explorer - 3901-4000   *Has distinct variable group(s)
TypeLabelDescription
Statement
 
Theoremmpteq2ia 3901 An equality inference for the maps-to notation. (Contributed by Mario Carneiro, 16-Dec-2013.)
(𝑥𝐴𝐵 = 𝐶)       (𝑥𝐴𝐵) = (𝑥𝐴𝐶)
 
Theoremmpteq2i 3902 An equality inference for the maps-to notation. (Contributed by Mario Carneiro, 16-Dec-2013.)
𝐵 = 𝐶       (𝑥𝐴𝐵) = (𝑥𝐴𝐶)
 
Theoremmpteq12i 3903 An equality inference for the maps-to notation. (Contributed by Scott Fenton, 27-Oct-2010.) (Revised by Mario Carneiro, 16-Dec-2013.)
𝐴 = 𝐶    &   𝐵 = 𝐷       (𝑥𝐴𝐵) = (𝑥𝐶𝐷)
 
Theoremmpteq2da 3904 Slightly more general equality inference for the maps-to notation. (Contributed by FL, 14-Sep-2013.) (Revised by Mario Carneiro, 16-Dec-2013.)
𝑥𝜑    &   ((𝜑𝑥𝐴) → 𝐵 = 𝐶)       (𝜑 → (𝑥𝐴𝐵) = (𝑥𝐴𝐶))
 
Theoremmpteq2dva 3905* Slightly more general equality inference for the maps-to notation. (Contributed by Scott Fenton, 25-Apr-2012.)
((𝜑𝑥𝐴) → 𝐵 = 𝐶)       (𝜑 → (𝑥𝐴𝐵) = (𝑥𝐴𝐶))
 
Theoremmpteq2dv 3906* An equality inference for the maps-to notation. (Contributed by Mario Carneiro, 23-Aug-2014.)
(𝜑𝐵 = 𝐶)       (𝜑 → (𝑥𝐴𝐵) = (𝑥𝐴𝐶))
 
Theoremnfmpt 3907* Bound-variable hypothesis builder for the maps-to notation. (Contributed by NM, 20-Feb-2013.)
𝑥𝐴    &   𝑥𝐵       𝑥(𝑦𝐴𝐵)
 
Theoremnfmpt1 3908 Bound-variable hypothesis builder for the maps-to notation. (Contributed by FL, 17-Feb-2008.)
𝑥(𝑥𝐴𝐵)
 
Theoremcbvmptf 3909* Rule to change the bound variable in a maps-to function, using implicit substitution. This version has bound-variable hypotheses in place of distinct variable conditions. (Contributed by Thierry Arnoux, 9-Mar-2017.)
𝑥𝐴    &   𝑦𝐴    &   𝑦𝐵    &   𝑥𝐶    &   (𝑥 = 𝑦𝐵 = 𝐶)       (𝑥𝐴𝐵) = (𝑦𝐴𝐶)
 
Theoremcbvmpt 3910* Rule to change the bound variable in a maps-to function, using implicit substitution. This version has bound-variable hypotheses in place of distinct variable conditions. (Contributed by NM, 11-Sep-2011.)
𝑦𝐵    &   𝑥𝐶    &   (𝑥 = 𝑦𝐵 = 𝐶)       (𝑥𝐴𝐵) = (𝑦𝐴𝐶)
 
Theoremcbvmptv 3911* Rule to change the bound variable in a maps-to function, using implicit substitution. (Contributed by Mario Carneiro, 19-Feb-2013.)
(𝑥 = 𝑦𝐵 = 𝐶)       (𝑥𝐴𝐵) = (𝑦𝐴𝐶)
 
Theoremmptv 3912* Function with universal domain in maps-to notation. (Contributed by NM, 16-Aug-2013.)
(𝑥 ∈ V ↦ 𝐵) = {⟨𝑥, 𝑦⟩ ∣ 𝑦 = 𝐵}
 
2.1.24  Transitive classes
 
Syntaxwtr 3913 Extend wff notation to include transitive classes. Notation from [TakeutiZaring] p. 35.
wff Tr 𝐴
 
Definitiondf-tr 3914 Define the transitive class predicate. Definition of [Enderton] p. 71 extended to arbitrary classes. For alternate definitions, see dftr2 3915 (which is suggestive of the word "transitive"), dftr3 3917, dftr4 3918, and dftr5 3916. The term "complete" is used instead of "transitive" in Definition 3 of [Suppes] p. 130. (Contributed by NM, 29-Aug-1993.)
(Tr 𝐴 𝐴𝐴)
 
Theoremdftr2 3915* An alternate way of defining a transitive class. Exercise 7 of [TakeutiZaring] p. 40. (Contributed by NM, 24-Apr-1994.)
(Tr 𝐴 ↔ ∀𝑥𝑦((𝑥𝑦𝑦𝐴) → 𝑥𝐴))
 
Theoremdftr5 3916* An alternate way of defining a transitive class. (Contributed by NM, 20-Mar-2004.)
(Tr 𝐴 ↔ ∀𝑥𝐴𝑦𝑥 𝑦𝐴)
 
Theoremdftr3 3917* An alternate way of defining a transitive class. Definition 7.1 of [TakeutiZaring] p. 35. (Contributed by NM, 29-Aug-1993.)
(Tr 𝐴 ↔ ∀𝑥𝐴 𝑥𝐴)
 
Theoremdftr4 3918 An alternate way of defining a transitive class. Definition of [Enderton] p. 71. (Contributed by NM, 29-Aug-1993.)
(Tr 𝐴𝐴 ⊆ 𝒫 𝐴)
 
Theoremtreq 3919 Equality theorem for the transitive class predicate. (Contributed by NM, 17-Sep-1993.)
(𝐴 = 𝐵 → (Tr 𝐴 ↔ Tr 𝐵))
 
Theoremtrel 3920 In a transitive class, the membership relation is transitive. (Contributed by NM, 19-Apr-1994.) (Proof shortened by Andrew Salmon, 9-Jul-2011.)
(Tr 𝐴 → ((𝐵𝐶𝐶𝐴) → 𝐵𝐴))
 
Theoremtrel3 3921 In a transitive class, the membership relation is transitive. (Contributed by NM, 19-Apr-1994.)
(Tr 𝐴 → ((𝐵𝐶𝐶𝐷𝐷𝐴) → 𝐵𝐴))
 
Theoremtrss 3922 An element of a transitive class is a subset of the class. (Contributed by NM, 7-Aug-1994.)
(Tr 𝐴 → (𝐵𝐴𝐵𝐴))
 
Theoremtrin 3923 The intersection of transitive classes is transitive. (Contributed by NM, 9-May-1994.)
((Tr 𝐴 ∧ Tr 𝐵) → Tr (𝐴𝐵))
 
Theoremtr0 3924 The empty set is transitive. (Contributed by NM, 16-Sep-1993.)
Tr ∅
 
Theoremtrv 3925 The universe is transitive. (Contributed by NM, 14-Sep-2003.)
Tr V
 
Theoremtriun 3926* The indexed union of a class of transitive sets is transitive. (Contributed by Mario Carneiro, 16-Nov-2014.)
(∀𝑥𝐴 Tr 𝐵 → Tr 𝑥𝐴 𝐵)
 
Theoremtruni 3927* The union of a class of transitive sets is transitive. Exercise 5(a) of [Enderton] p. 73. (Contributed by Scott Fenton, 21-Feb-2011.) (Proof shortened by Mario Carneiro, 26-Apr-2014.)
(∀𝑥𝐴 Tr 𝑥 → Tr 𝐴)
 
Theoremtrint 3928* The intersection of a class of transitive sets is transitive. Exercise 5(b) of [Enderton] p. 73. (Contributed by Scott Fenton, 25-Feb-2011.)
(∀𝑥𝐴 Tr 𝑥 → Tr 𝐴)
 
Theoremtrintssm 3929* Any inhabited transitive class includes its intersection. Similar to Exercise 3 in [TakeutiZaring] p. 44 (which mistakenly does not include the inhabitedness hypothesis). (Contributed by Jim Kingdon, 22-Aug-2018.)
((Tr 𝐴 ∧ ∃𝑥 𝑥𝐴) → 𝐴𝐴)
 
TheoremtrintssmOLD 3930* Obsolete version of trintssm 3929 as of 30-Oct-2021. (Contributed by Jim Kingdon, 22-Aug-2018.) (Proof modification is discouraged.) (New usage is discouraged.)
((∃𝑥 𝑥𝐴 ∧ Tr 𝐴) → 𝐴𝐴)
 
2.2  IZF Set Theory - add the Axioms of Collection and Separation
 
2.2.1  Introduce the Axiom of Collection
 
Axiomax-coll 3931* Axiom of Collection. Axiom 7 of [Crosilla], p. "Axioms of CZF and IZF" (with unnecessary quantifier removed). It is similar to bnd 3984 but uses a freeness hypothesis in place of one of the distinct variable constraints. (Contributed by Jim Kingdon, 23-Aug-2018.)
𝑏𝜑       (∀𝑥𝑎𝑦𝜑 → ∃𝑏𝑥𝑎𝑦𝑏 𝜑)
 
Theoremrepizf 3932* Axiom of Replacement. Axiom 7' of [Crosilla], p. "Axioms of CZF and IZF" (with unnecessary quantifier removed). In our context this is not an axiom, but a theorem proved from ax-coll 3931. It is identical to zfrep6 3933 except for the choice of a freeness hypothesis rather than a distinct variable constraint between 𝑏 and 𝜑. (Contributed by Jim Kingdon, 23-Aug-2018.)
𝑏𝜑       (∀𝑥𝑎 ∃!𝑦𝜑 → ∃𝑏𝑥𝑎𝑦𝑏 𝜑)
 
Theoremzfrep6 3933* A version of the Axiom of Replacement. Normally 𝜑 would have free variables 𝑥 and 𝑦. Axiom 6 of [Kunen] p. 12. The Separation Scheme ax-sep 3934 cannot be derived from this version and must be stated as a separate axiom in an axiom system (such as Kunen's) that uses this version. (Contributed by NM, 10-Oct-2003.)
(∀𝑥𝑧 ∃!𝑦𝜑 → ∃𝑤𝑥𝑧𝑦𝑤 𝜑)
 
2.2.2  Introduce the Axiom of Separation
 
Axiomax-sep 3934* The Axiom of Separation of IZF set theory. Axiom 6 of [Crosilla], p. "Axioms of CZF and IZF" (with unnecessary quantifier removed, and with a 𝑦𝜑 condition replaced by a distinct variable constraint between 𝑦 and 𝜑).

The Separation Scheme is a weak form of Frege's Axiom of Comprehension, conditioning it (with 𝑥𝑧) so that it asserts the existence of a collection only if it is smaller than some other collection 𝑧 that already exists. This prevents Russell's paradox ru 2828. In some texts, this scheme is called "Aussonderung" or the Subset Axiom.

(Contributed by NM, 11-Sep-2006.)

𝑦𝑥(𝑥𝑦 ↔ (𝑥𝑧𝜑))
 
Theoremaxsep2 3935* A less restrictive version of the Separation Scheme ax-sep 3934, where variables 𝑥 and 𝑧 can both appear free in the wff 𝜑, which can therefore be thought of as 𝜑(𝑥, 𝑧). This version was derived from the more restrictive ax-sep 3934 with no additional set theory axioms. (Contributed by NM, 10-Dec-2006.) (Proof shortened by Mario Carneiro, 17-Nov-2016.)
𝑦𝑥(𝑥𝑦 ↔ (𝑥𝑧𝜑))
 
Theoremzfauscl 3936* Separation Scheme (Aussonderung) using a class variable. To derive this from ax-sep 3934, we invoke the Axiom of Extensionality (indirectly via vtocl 2667), which is needed for the justification of class variable notation. (Contributed by NM, 5-Aug-1993.)
𝐴 ∈ V       𝑦𝑥(𝑥𝑦 ↔ (𝑥𝐴𝜑))
 
Theorembm1.3ii 3937* Convert implication to equivalence using the Separation Scheme (Aussonderung) ax-sep 3934. Similar to Theorem 1.3ii of [BellMachover] p. 463. (Contributed by NM, 5-Aug-1993.)
𝑥𝑦(𝜑𝑦𝑥)       𝑥𝑦(𝑦𝑥𝜑)
 
Theorema9evsep 3938* Derive a weakened version of ax-i9 1466, where 𝑥 and 𝑦 must be distinct, from Separation ax-sep 3934 and Extensionality ax-ext 2067. The theorem ¬ ∀𝑥¬ 𝑥 = 𝑦 also holds (ax9vsep 3939), but in intuitionistic logic 𝑥𝑥 = 𝑦 is stronger. (Contributed by Jim Kingdon, 25-Aug-2018.) (Proof modification is discouraged.) (New usage is discouraged.)
𝑥 𝑥 = 𝑦
 
Theoremax9vsep 3939* Derive a weakened version of ax-9 1467, where 𝑥 and 𝑦 must be distinct, from Separation ax-sep 3934 and Extensionality ax-ext 2067. In intuitionistic logic a9evsep 3938 is stronger and also holds. (Contributed by NM, 12-Nov-2013.) (Proof modification is discouraged.) (New usage is discouraged.)
¬ ∀𝑥 ¬ 𝑥 = 𝑦
 
2.2.3  Derive the Null Set Axiom
 
Theoremzfnuleu 3940* Show the uniqueness of the empty set (using the Axiom of Extensionality via bm1.1 2070 to strengthen the hypothesis in the form of axnul 3941). (Contributed by NM, 22-Dec-2007.)
𝑥𝑦 ¬ 𝑦𝑥       ∃!𝑥𝑦 ¬ 𝑦𝑥
 
Theoremaxnul 3941* The Null Set Axiom of ZF set theory: there exists a set with no elements. Axiom of Empty Set of [Enderton] p. 18. In some textbooks, this is presented as a separate axiom; here we show it can be derived from Separation ax-sep 3934. This version of the Null Set Axiom tells us that at least one empty set exists, but does not tell us that it is unique - we need the Axiom of Extensionality to do that (see zfnuleu 3940).

This theorem should not be referenced by any proof. Instead, use ax-nul 3942 below so that the uses of the Null Set Axiom can be more easily identified. (Contributed by Jeff Hoffman, 3-Feb-2008.) (Revised by NM, 4-Feb-2008.) (New usage is discouraged.) (Proof modification is discouraged.)

𝑥𝑦 ¬ 𝑦𝑥
 
Axiomax-nul 3942* The Null Set Axiom of IZF set theory. It was derived as axnul 3941 above and is therefore redundant, but we state it as a separate axiom here so that its uses can be identified more easily. Axiom 4 of [Crosilla] p. "Axioms of CZF and IZF". (Contributed by NM, 7-Aug-2003.)
𝑥𝑦 ¬ 𝑦𝑥
 
Theorem0ex 3943 The Null Set Axiom of ZF set theory: the empty set exists. Corollary 5.16 of [TakeutiZaring] p. 20. For the unabbreviated version, see ax-nul 3942. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Andrew Salmon, 9-Jul-2011.)
∅ ∈ V
 
Theoremcsbexga 3944 The existence of proper substitution into a class. (Contributed by NM, 10-Nov-2005.)
((𝐴𝑉 ∧ ∀𝑥 𝐵𝑊) → 𝐴 / 𝑥𝐵 ∈ V)
 
Theoremcsbexa 3945 The existence of proper substitution into a class. (Contributed by NM, 7-Aug-2007.) (Proof shortened by Andrew Salmon, 29-Jun-2011.)
𝐴 ∈ V    &   𝐵 ∈ V       𝐴 / 𝑥𝐵 ∈ V
 
2.2.4  Theorems requiring subset and intersection existence
 
Theoremnalset 3946* No set contains all sets. Theorem 41 of [Suppes] p. 30. (Contributed by NM, 23-Aug-1993.)
¬ ∃𝑥𝑦 𝑦𝑥
 
Theoremvnex 3947 The universal class does not exist as a set. (Contributed by NM, 4-Jul-2005.)
¬ ∃𝑥 𝑥 = V
 
Theoremvprc 3948 The universal class is not a member of itself (and thus is not a set). Proposition 5.21 of [TakeutiZaring] p. 21; our proof, however, does not depend on the Axiom of Regularity. (Contributed by NM, 23-Aug-1993.)
¬ V ∈ V
 
Theoremnvel 3949 The universal class does not belong to any class. (Contributed by FL, 31-Dec-2006.)
¬ V ∈ 𝐴
 
Theoreminex1 3950 Separation Scheme (Aussonderung) using class notation. Compare Exercise 4 of [TakeutiZaring] p. 22. (Contributed by NM, 5-Aug-1993.)
𝐴 ∈ V       (𝐴𝐵) ∈ V
 
Theoreminex2 3951 Separation Scheme (Aussonderung) using class notation. (Contributed by NM, 27-Apr-1994.)
𝐴 ∈ V       (𝐵𝐴) ∈ V
 
Theoreminex1g 3952 Closed-form, generalized Separation Scheme. (Contributed by NM, 7-Apr-1995.)
(𝐴𝑉 → (𝐴𝐵) ∈ V)
 
Theoremssex 3953 The subset of a set is also a set. Exercise 3 of [TakeutiZaring] p. 22. This is one way to express the Axiom of Separation ax-sep 3934 (a.k.a. Subset Axiom). (Contributed by NM, 27-Apr-1994.)
𝐵 ∈ V       (𝐴𝐵𝐴 ∈ V)
 
Theoremssexi 3954 The subset of a set is also a set. (Contributed by NM, 9-Sep-1993.)
𝐵 ∈ V    &   𝐴𝐵       𝐴 ∈ V
 
Theoremssexg 3955 The subset of a set is also a set. Exercise 3 of [TakeutiZaring] p. 22 (generalized). (Contributed by NM, 14-Aug-1994.)
((𝐴𝐵𝐵𝐶) → 𝐴 ∈ V)
 
Theoremssexd 3956 A subclass of a set is a set. Deduction form of ssexg 3955. (Contributed by David Moews, 1-May-2017.)
(𝜑𝐵𝐶)    &   (𝜑𝐴𝐵)       (𝜑𝐴 ∈ V)
 
Theoremdifexg 3957 Existence of a difference. (Contributed by NM, 26-May-1998.)
(𝐴𝑉 → (𝐴𝐵) ∈ V)
 
Theoremzfausab 3958* Separation Scheme (Aussonderung) in terms of a class abstraction. (Contributed by NM, 8-Jun-1994.)
𝐴 ∈ V       {𝑥 ∣ (𝑥𝐴𝜑)} ∈ V
 
Theoremrabexg 3959* Separation Scheme in terms of a restricted class abstraction. (Contributed by NM, 23-Oct-1999.)
(𝐴𝑉 → {𝑥𝐴𝜑} ∈ V)
 
Theoremrabex 3960* Separation Scheme in terms of a restricted class abstraction. (Contributed by NM, 19-Jul-1996.)
𝐴 ∈ V       {𝑥𝐴𝜑} ∈ V
 
Theoremelssabg 3961* Membership in a class abstraction involving a subset. Unlike elabg 2752, 𝐴 does not have to be a set. (Contributed by NM, 29-Aug-2006.)
(𝑥 = 𝐴 → (𝜑𝜓))       (𝐵𝑉 → (𝐴 ∈ {𝑥 ∣ (𝑥𝐵𝜑)} ↔ (𝐴𝐵𝜓)))
 
Theoreminteximm 3962* The intersection of an inhabited class exists. (Contributed by Jim Kingdon, 27-Aug-2018.)
(∃𝑥 𝑥𝐴 𝐴 ∈ V)
 
Theoremintexr 3963 If the intersection of a class exists, the class is nonempty. (Contributed by Jim Kingdon, 27-Aug-2018.)
( 𝐴 ∈ V → 𝐴 ≠ ∅)
 
Theoremintnexr 3964 If a class intersection is the universe, it is not a set. In classical logic this would be an equivalence. (Contributed by Jim Kingdon, 27-Aug-2018.)
( 𝐴 = V → ¬ 𝐴 ∈ V)
 
Theoremintexabim 3965 The intersection of an inhabited class abstraction exists. (Contributed by Jim Kingdon, 27-Aug-2018.)
(∃𝑥𝜑 {𝑥𝜑} ∈ V)
 
Theoremintexrabim 3966 The intersection of an inhabited restricted class abstraction exists. (Contributed by Jim Kingdon, 27-Aug-2018.)
(∃𝑥𝐴 𝜑 {𝑥𝐴𝜑} ∈ V)
 
Theoremiinexgm 3967* The existence of an indexed union. 𝑥 is normally a free-variable parameter in 𝐵, which should be read 𝐵(𝑥). (Contributed by Jim Kingdon, 28-Aug-2018.)
((∃𝑥 𝑥𝐴 ∧ ∀𝑥𝐴 𝐵𝐶) → 𝑥𝐴 𝐵 ∈ V)
 
Theoreminuni 3968* The intersection of a union 𝐴 with a class 𝐵 is equal to the union of the intersections of each element of 𝐴 with 𝐵. (Contributed by FL, 24-Mar-2007.)
( 𝐴𝐵) = {𝑥 ∣ ∃𝑦𝐴 𝑥 = (𝑦𝐵)}
 
Theoremelpw2g 3969 Membership in a power class. Theorem 86 of [Suppes] p. 47. (Contributed by NM, 7-Aug-2000.)
(𝐵𝑉 → (𝐴 ∈ 𝒫 𝐵𝐴𝐵))
 
Theoremelpw2 3970 Membership in a power class. Theorem 86 of [Suppes] p. 47. (Contributed by NM, 11-Oct-2007.)
𝐵 ∈ V       (𝐴 ∈ 𝒫 𝐵𝐴𝐵)
 
Theorempwnss 3971 The power set of a set is never a subset. (Contributed by Stefan O'Rear, 22-Feb-2015.)
(𝐴𝑉 → ¬ 𝒫 𝐴𝐴)
 
Theorempwne 3972 No set equals its power set. The sethood antecedent is necessary; compare pwv 3637. (Contributed by NM, 17-Nov-2008.) (Proof shortened by Mario Carneiro, 23-Dec-2016.)
(𝐴𝑉 → 𝒫 𝐴𝐴)
 
Theoremrepizf2lem 3973 Lemma for repizf2 3974. If we have a function-like proposition which provides at most one value of 𝑦 for each 𝑥 in a set 𝑤, we can change "at most one" to "exactly one" by restricting the values of 𝑥 to those values for which the proposition provides a value of 𝑦. (Contributed by Jim Kingdon, 7-Sep-2018.)
(∀𝑥𝑤 ∃*𝑦𝜑 ↔ ∀𝑥 ∈ {𝑥𝑤 ∣ ∃𝑦𝜑}∃!𝑦𝜑)
 
Theoremrepizf2 3974* Replacement. This version of replacement is stronger than repizf 3932 in the sense that 𝜑 does not need to map all values of 𝑥 in 𝑤 to a value of 𝑦. The resulting set contains those elements for which there is a value of 𝑦 and in that sense, this theorem combines repizf 3932 with ax-sep 3934. Another variation would be 𝑥𝑤∃*𝑦𝜑 → {𝑦 ∣ ∃𝑥(𝑥𝑤𝜑)} ∈ V but we don't have a proof of that yet. (Contributed by Jim Kingdon, 7-Sep-2018.)
𝑧𝜑       (∀𝑥𝑤 ∃*𝑦𝜑 → ∃𝑧𝑥 ∈ {𝑥𝑤 ∣ ∃𝑦𝜑}∃𝑦𝑧 𝜑)
 
2.2.5  Theorems requiring empty set existence
 
Theoremclass2seteq 3975* Equality theorem for classes and sets . (Contributed by NM, 13-Dec-2005.) (Proof shortened by Raph Levien, 30-Jun-2006.)
(𝐴𝑉 → {𝑥𝐴𝐴 ∈ V} = 𝐴)
 
Theorem0elpw 3976 Every power class contains the empty set. (Contributed by NM, 25-Oct-2007.)
∅ ∈ 𝒫 𝐴
 
Theorem0nep0 3977 The empty set and its power set are not equal. (Contributed by NM, 23-Dec-1993.)
∅ ≠ {∅}
 
Theorem0inp0 3978 Something cannot be equal to both the null set and the power set of the null set. (Contributed by NM, 30-Sep-2003.)
(𝐴 = ∅ → ¬ 𝐴 = {∅})
 
Theoremunidif0 3979 The removal of the empty set from a class does not affect its union. (Contributed by NM, 22-Mar-2004.)
(𝐴 ∖ {∅}) = 𝐴
 
Theoremiin0imm 3980* An indexed intersection of the empty set, with an inhabited index set, is empty. (Contributed by Jim Kingdon, 29-Aug-2018.)
(∃𝑦 𝑦𝐴 𝑥𝐴 ∅ = ∅)
 
Theoremiin0r 3981* If an indexed intersection of the empty set is empty, the index set is nonempty. (Contributed by Jim Kingdon, 29-Aug-2018.)
( 𝑥𝐴 ∅ = ∅ → 𝐴 ≠ ∅)
 
Theoremintv 3982 The intersection of the universal class is empty. (Contributed by NM, 11-Sep-2008.)
V = ∅
 
Theoremaxpweq 3983* Two equivalent ways to express the Power Set Axiom. Note that ax-pow 3986 is not used by the proof. (Contributed by NM, 22-Jun-2009.)
𝐴 ∈ V       (𝒫 𝐴 ∈ V ↔ ∃𝑥𝑦(∀𝑧(𝑧𝑦𝑧𝐴) → 𝑦𝑥))
 
2.2.6  Collection principle
 
Theorembnd 3984* A very strong generalization of the Axiom of Replacement (compare zfrep6 3933). Its strength lies in the rather profound fact that 𝜑(𝑥, 𝑦) does not have to be a "function-like" wff, as it does in the standard Axiom of Replacement. This theorem is sometimes called the Boundedness Axiom. In the context of IZF, it is just a slight variation of ax-coll 3931. (Contributed by NM, 17-Oct-2004.)
(∀𝑥𝑧𝑦𝜑 → ∃𝑤𝑥𝑧𝑦𝑤 𝜑)
 
Theorembnd2 3985* A variant of the Boundedness Axiom bnd 3984 that picks a subset 𝑧 out of a possibly proper class 𝐵 in which a property is true. (Contributed by NM, 4-Feb-2004.)
𝐴 ∈ V       (∀𝑥𝐴𝑦𝐵 𝜑 → ∃𝑧(𝑧𝐵 ∧ ∀𝑥𝐴𝑦𝑧 𝜑))
 
2.3  IZF Set Theory - add the Axioms of Power Sets and Pairing
 
2.3.1  Introduce the Axiom of Power Sets
 
Axiomax-pow 3986* Axiom of Power Sets. An axiom of Intuitionistic Zermelo-Fraenkel set theory. It states that a set 𝑦 exists that includes the power set of a given set 𝑥 i.e. contains every subset of 𝑥. This is Axiom 8 of [Crosilla] p. "Axioms of CZF and IZF" except (a) unnecessary quantifiers are removed, and (b) Crosilla has a biconditional rather than an implication (but the two are equivalent by bm1.3ii 3937).

The variant axpow2 3988 uses explicit subset notation. A version using class notation is pwex 3994. (Contributed by NM, 5-Aug-1993.)

𝑦𝑧(∀𝑤(𝑤𝑧𝑤𝑥) → 𝑧𝑦)
 
Theoremzfpow 3987* Axiom of Power Sets expressed with the fewest number of different variables. (Contributed by NM, 14-Aug-2003.)
𝑥𝑦(∀𝑥(𝑥𝑦𝑥𝑧) → 𝑦𝑥)
 
Theoremaxpow2 3988* A variant of the Axiom of Power Sets ax-pow 3986 using subset notation. Problem in {BellMachover] p. 466. (Contributed by NM, 4-Jun-2006.)
𝑦𝑧(𝑧𝑥𝑧𝑦)
 
Theoremaxpow3 3989* A variant of the Axiom of Power Sets ax-pow 3986. For any set 𝑥, there exists a set 𝑦 whose members are exactly the subsets of 𝑥 i.e. the power set of 𝑥. Axiom Pow of [BellMachover] p. 466. (Contributed by NM, 4-Jun-2006.)
𝑦𝑧(𝑧𝑥𝑧𝑦)
 
Theoremel 3990* Every set is an element of some other set. (Contributed by NM, 4-Jan-2002.) (Proof shortened by Andrew Salmon, 25-Jul-2011.)
𝑦 𝑥𝑦
 
Theoremvpwex 3991 Power set axiom: the powerclass of a set is a set. Axiom 4 of [TakeutiZaring] p. 17. (Contributed by NM, 30-Oct-2003.) (Proof shortened by Andrew Salmon, 25-Jul-2011.) Revised to prove pwexg 3992 from vpwex 3991. (Revised by BJ, 10-Aug-2022.)
𝒫 𝑥 ∈ V
 
Theorempwexg 3992 Power set axiom expressed in class notation, with the sethood requirement as an antecedent. (Contributed by NM, 30-Oct-2003.)
(𝐴𝑉 → 𝒫 𝐴 ∈ V)
 
Theoremabssexg 3993* Existence of a class of subsets. (Contributed by NM, 15-Jul-2006.) (Proof shortened by Andrew Salmon, 25-Jul-2011.)
(𝐴𝑉 → {𝑥 ∣ (𝑥𝐴𝜑)} ∈ V)
 
Theorempwex 3994 Power set axiom expressed in class notation. (Contributed by NM, 21-Jun-1993.)
𝐴 ∈ V       𝒫 𝐴 ∈ V
 
Theoremsnexg 3995 A singleton whose element exists is a set. The 𝐴 ∈ V case of Theorem 7.12 of [Quine] p. 51, proved using only Extensionality, Power Set, and Separation. Replacement is not needed. (Contributed by Jim Kingdon, 1-Sep-2018.)
(𝐴𝑉 → {𝐴} ∈ V)
 
Theoremsnex 3996 A singleton whose element exists is a set. (Contributed by NM, 7-Aug-1994.) (Revised by Mario Carneiro, 24-May-2019.)
𝐴 ∈ V       {𝐴} ∈ V
 
Theoremsnexprc 3997 A singleton whose element is a proper class is a set. The ¬ 𝐴 ∈ V case of Theorem 7.12 of [Quine] p. 51, proved using only Extensionality, Power Set, and Separation. Replacement is not needed. (Contributed by Jim Kingdon, 1-Sep-2018.)
𝐴 ∈ V → {𝐴} ∈ V)
 
Theoremnotnotsnex 3998 A singleton is never a proper class. (Contributed by Mario Carneiro and Jim Kingdon, 3-Jul-2022.)
¬ ¬ {𝐴} ∈ V
 
Theoremp0ex 3999 The power set of the empty set (the ordinal 1) is a set. (Contributed by NM, 23-Dec-1993.)
{∅} ∈ V
 
Theorempp0ex 4000 {∅, {∅}} (the ordinal 2) is a set. (Contributed by NM, 5-Aug-1993.)
{∅, {∅}} ∈ V
    < 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-10600 107 10601-10700 108 10701-10800 109 10801-10900 110 10901-11000 111 11001-11100 112 11101-11200 113 11201-11300 114 11301-11394
  Copyright terms: Public domain < Previous  Next >