HomeHome Intuitionistic Logic Explorer
Theorem List (p. 33 of 74)
< 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 - 3201-3300   *Has distinct variable group(s)
TypeLabelDescription
Statement
 
Theoremnoel 3201 The empty set has no elements. Theorem 6.14 of [Quine] p. 44. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Mario Carneiro, 1-Sep-2015.)
¬ A
 
Theoremn0i 3202 If a set has elements, it is not empty. A set with elements is also inhabited, see elex2 2543. (Contributed by NM, 31-Dec-1993.)
(B A → ¬ A = ∅)
 
Theoremne0i 3203 If a set has elements, it is not empty. A set with elements is also inhabited, see elex2 2543. (Contributed by NM, 31-Dec-1993.)
(B AA ≠ ∅)
 
Theoremvn0 3204 The universal class is not equal to the empty set. (Contributed by NM, 11-Sep-2008.)
V ≠ ∅
 
Theoremvn0m 3205 The universal class is inhabited. (Contributed by Jim Kingdon, 17-Dec-2018.)
x x V
 
Theoremn0rf 3206 An inhabited class is nonempty. Following the Definition of [Bauer], p. 483, we call a class A nonempty if A ≠ ∅ and inhabited if it has at least one element. In classical logic these two concepts are equivalent, for example see Proposition 5.17(1) of [TakeutiZaring] p. 20. This version of n0r 3207 requires only that x not be free in, rather than not occur in, A. (Contributed by Jim Kingdon, 31-Jul-2018.)
xA       (x x AA ≠ ∅)
 
Theoremn0r 3207* An inhabited class is nonempty. See n0rf 3206 for more discussion. (Contributed by Jim Kingdon, 31-Jul-2018.)
(x x AA ≠ ∅)
 
Theoremneq0r 3208* An inhabited class is nonempty. See n0rf 3206 for more discussion. (Contributed by Jim Kingdon, 31-Jul-2018.)
(x x A → ¬ A = ∅)
 
Theoremreximdva0m 3209* Restricted existence deduced from inhabited class. (Contributed by Jim Kingdon, 31-Jul-2018.)
((φ x A) → ψ)       ((φ x x A) → x A ψ)
 
Theoremn0mmoeu 3210* A case of equivalence of "at most one" and "only one". If a class is inhabited, that class having at most one element is equivalent to it having only one element. (Contributed by Jim Kingdon, 31-Jul-2018.)
(x x A → (∃*x x A∃!x x A))
 
Theoremrex0 3211 Vacuous existential quantification is false. (Contributed by NM, 15-Oct-2003.)
¬ x φ
 
Theoremeq0 3212* The empty set has no elements. Theorem 2 of [Suppes] p. 22. (Contributed by NM, 29-Aug-1993.)
(A = ∅ ↔ x ¬ x A)
 
Theoremeqv 3213* The universe contains every set. (Contributed by NM, 11-Sep-2006.)
(A = V ↔ x x A)
 
Theorem0el 3214* Membership of the empty set in another class. (Contributed by NM, 29-Jun-2004.)
(∅ Ax A y ¬ y x)
 
Theoremabvor0dc 3215* The class builder of a decidable proposition not containing the abstraction variable is either the universal class or the empty set. (Contributed by Jim Kingdon, 1-Aug-2018.)
(DECID φ → ({xφ} = V {xφ} = ∅))
 
Theoremabn0r 3216 Nonempty class abstraction. (Contributed by Jim Kingdon, 1-Aug-2018.)
(xφ → {xφ} ≠ ∅)
 
Theoremrabn0r 3217 Non-empty restricted class abstraction. (Contributed by Jim Kingdon, 1-Aug-2018.)
(x A φ → {x Aφ} ≠ ∅)
 
Theoremrabn0m 3218* Inhabited restricted class abstraction. (Contributed by Jim Kingdon, 18-Sep-2018.)
(y y {x Aφ} ↔ x A φ)
 
Theoremrab0 3219 Any restricted class abstraction restricted to the empty set is empty. (Contributed by NM, 15-Oct-2003.) (Proof shortened by Andrew Salmon, 26-Jun-2011.)
{x ∅ ∣ φ} = ∅
 
Theoremrabeq0 3220 Condition for a restricted class abstraction to be empty. (Contributed by Jeff Madsen, 7-Jun-2010.)
({x Aφ} = ∅ ↔ x A ¬ φ)
 
Theoremabeq0 3221 Condition for a class abstraction to be empty. (Contributed by Jim Kingdon, 12-Aug-2018.)
({xφ} = ∅ ↔ x ¬ φ)
 
Theoremrabxmdc 3222* Law of excluded middle given decidability, in terms of restricted class abstractions. (Contributed by Jim Kingdon, 2-Aug-2018.)
(xDECID φA = ({x Aφ} ∪ {x A ∣ ¬ φ}))
 
Theoremrabnc 3223* Law of noncontradiction, in terms of restricted class abstractions. (Contributed by Jeff Madsen, 20-Jun-2011.)
({x Aφ} ∩ {x A ∣ ¬ φ}) = ∅
 
Theoremun0 3224 The union of a class with the empty set is itself. Theorem 24 of [Suppes] p. 27. (Contributed by NM, 5-Aug-1993.)
(A ∪ ∅) = A
 
Theoremin0 3225 The intersection of a class with the empty set is the empty set. Theorem 16 of [Suppes] p. 26. (Contributed by NM, 5-Aug-1993.)
(A ∩ ∅) = ∅
 
Theoreminv1 3226 The intersection of a class with the universal class is itself. Exercise 4.10(k) of [Mendelson] p. 231. (Contributed by NM, 17-May-1998.)
(A ∩ V) = A
 
Theoremunv 3227 The union of a class with the universal class is the universal class. Exercise 4.10(l) of [Mendelson] p. 231. (Contributed by NM, 17-May-1998.)
(A ∪ V) = V
 
Theorem0ss 3228 The null set is a subset of any class. Part of Exercise 1 of [TakeutiZaring] p. 22. (Contributed by NM, 5-Aug-1993.)
∅ ⊆ A
 
Theoremss0b 3229 Any subset of the empty set is empty. Theorem 5 of [Suppes] p. 23 and its converse. (Contributed by NM, 17-Sep-2003.)
(A ⊆ ∅ ↔ A = ∅)
 
Theoremss0 3230 Any subset of the empty set is empty. Theorem 5 of [Suppes] p. 23. (Contributed by NM, 13-Aug-1994.)
(A ⊆ ∅ → A = ∅)
 
Theoremsseq0 3231 A subclass of an empty class is empty. (Contributed by NM, 7-Mar-2007.) (Proof shortened by Andrew Salmon, 26-Jun-2011.)
((AB B = ∅) → A = ∅)
 
Theoremssn0 3232 A class with a nonempty subclass is nonempty. (Contributed by NM, 17-Feb-2007.)
((AB A ≠ ∅) → B ≠ ∅)
 
Theoremabf 3233 A class builder with a false argument is empty. (Contributed by NM, 20-Jan-2012.)
¬ φ       {xφ} = ∅
 
Theoremeq0rdv 3234* Deduction rule for equality to the empty set. (Contributed by NM, 11-Jul-2014.)
(φ → ¬ x A)       (φA = ∅)
 
Theoremcsbprc 3235 The proper substitution of a proper class for a set into a class results in the empty set. (Contributed by NM, 17-Aug-2018.)
A V → A / xB = ∅)
 
Theoremun00 3236 Two classes are empty iff their union is empty. (Contributed by NM, 11-Aug-2004.)
((A = ∅ B = ∅) ↔ (AB) = ∅)
 
Theoremvss 3237 Only the universal class has the universal class as a subclass. (Contributed by NM, 17-Sep-2003.) (Proof shortened by Andrew Salmon, 26-Jun-2011.)
(V ⊆ AA = V)
 
Theorem0pss 3238 The null set is a proper subset of any non-empty set. (Contributed by NM, 27-Feb-1996.)
(∅ ⊊ AA ≠ ∅)
 
Theoremnpss0 3239 No set is a proper subset of the empty set. (Contributed by NM, 17-Jun-1998.) (Proof shortened by Andrew Salmon, 26-Jun-2011.)
¬ A ⊊ ∅
 
Theorempssv 3240 Any non-universal class is a proper subclass of the universal class. (Contributed by NM, 17-May-1998.)
(A ⊊ V ↔ ¬ A = V)
 
Theoremdisj 3241* Two ways of saying that two classes are disjoint (have no members in common). (Contributed by NM, 17-Feb-2004.)
((AB) = ∅ ↔ x A ¬ x B)
 
Theoremdisjr 3242* Two ways of saying that two classes are disjoint. (Contributed by Jeff Madsen, 19-Jun-2011.)
((AB) = ∅ ↔ x B ¬ x A)
 
Theoremdisj1 3243* Two ways of saying that two classes are disjoint (have no members in common). (Contributed by NM, 19-Aug-1993.)
((AB) = ∅ ↔ x(x A → ¬ x B))
 
Theoremreldisj 3244 Two ways of saying that two classes are disjoint, using the complement of B relative to a universe 𝐶. (Contributed by NM, 15-Feb-2007.) (Proof shortened by Andrew Salmon, 26-Jun-2011.)
(A𝐶 → ((AB) = ∅ ↔ A ⊆ (𝐶B)))
 
Theoremdisj3 3245 Two ways of saying that two classes are disjoint. (Contributed by NM, 19-May-1998.)
((AB) = ∅ ↔ A = (AB))
 
Theoremdisjne 3246 Members of disjoint sets are not equal. (Contributed by NM, 28-Mar-2007.) (Proof shortened by Andrew Salmon, 26-Jun-2011.)
(((AB) = ∅ 𝐶 A 𝐷 B) → 𝐶𝐷)
 
Theoremdisjel 3247 A set can't belong to both members of disjoint classes. (Contributed by NM, 28-Feb-2015.)
(((AB) = ∅ 𝐶 A) → ¬ 𝐶 B)
 
Theoremdisj2 3248 Two ways of saying that two classes are disjoint. (Contributed by NM, 17-May-1998.)
((AB) = ∅ ↔ A ⊆ (V ∖ B))
 
Theoremdisj4im 3249 A consequence of two classes being disjoint. In classical logic this would be a biconditional. (Contributed by Jim Kingdon, 2-Aug-2018.)
((AB) = ∅ → ¬ (AB) ⊊ A)
 
Theoremssdisj 3250 Intersection with a subclass of a disjoint class. (Contributed by FL, 24-Jan-2007.)
((AB (B𝐶) = ∅) → (A𝐶) = ∅)
 
Theoremdisjpss 3251 A class is a proper subset of its union with a disjoint nonempty class. (Contributed by NM, 15-Sep-2004.)
(((AB) = ∅ B ≠ ∅) → A ⊊ (AB))
 
Theoremundisj1 3252 The union of disjoint classes is disjoint. (Contributed by NM, 26-Sep-2004.)
(((A𝐶) = ∅ (B𝐶) = ∅) ↔ ((AB) ∩ 𝐶) = ∅)
 
Theoremundisj2 3253 The union of disjoint classes is disjoint. (Contributed by NM, 13-Sep-2004.)
(((AB) = ∅ (A𝐶) = ∅) ↔ (A ∩ (B𝐶)) = ∅)
 
Theoremssindif0im 3254 Subclass implies empty intersection with difference from the universal class. (Contributed by NM, 17-Sep-2003.)
(AB → (A ∩ (V ∖ B)) = ∅)
 
Theoreminelcm 3255 The intersection of classes with a common member is nonempty. (Contributed by NM, 7-Apr-1994.)
((A B A 𝐶) → (B𝐶) ≠ ∅)
 
Theoremminel 3256 A minimum element of a class has no elements in common with the class. (Contributed by NM, 22-Jun-1994.)
((A B (𝐶B) = ∅) → ¬ A 𝐶)
 
Theoremundif4 3257 Distribute union over difference. (Contributed by NM, 17-May-1998.) (Proof shortened by Andrew Salmon, 26-Jun-2011.)
((A𝐶) = ∅ → (A ∪ (B𝐶)) = ((AB) ∖ 𝐶))
 
Theoremdisjssun 3258 Subset relation for disjoint classes. (Contributed by NM, 25-Oct-2005.) (Proof shortened by Andrew Salmon, 26-Jun-2011.)
((AB) = ∅ → (A ⊆ (B𝐶) ↔ A𝐶))
 
Theoremssdif0im 3259 Subclass implies empty difference. One direction of Exercise 7 of [TakeutiZaring] p. 22. In classical logic this would be an equivalence. (Contributed by Jim Kingdon, 2-Aug-2018.)
(AB → (AB) = ∅)
 
Theoremvdif0im 3260 Universal class equality in terms of empty difference. (Contributed by Jim Kingdon, 3-Aug-2018.)
(A = V → (V ∖ A) = ∅)
 
Theoremdifrab0eqim 3261* If the difference between the restricting class of a restricted class abstraction and the restricted class abstraction is empty, the restricting class is equal to this restricted class abstraction. (Contributed by Jim Kingdon, 3-Aug-2018.)
(𝑉 = {x 𝑉φ} → (𝑉 ∖ {x 𝑉φ}) = ∅)
 
Theoremssnelpss 3262 A subclass missing a member is a proper subclass. (Contributed by NM, 12-Jan-2002.)
(AB → ((𝐶 B ¬ 𝐶 A) → AB))
 
Theoremssnelpssd 3263 Subclass inclusion with one element of the superclass missing is proper subclass inclusion. Deduction form of ssnelpss 3262. (Contributed by David Moews, 1-May-2017.)
(φAB)    &   (φ𝐶 B)    &   (φ → ¬ 𝐶 A)       (φAB)
 
Theoreminssdif0im 3264 Intersection, subclass, and difference relationship. In classical logic the converse would also hold. (Contributed by Jim Kingdon, 3-Aug-2018.)
((AB) ⊆ 𝐶 → (A ∩ (B𝐶)) = ∅)
 
Theoremdifid 3265 The difference between a class and itself is the empty set. Proposition 5.15 of [TakeutiZaring] p. 20. Also Theorem 32 of [Suppes] p. 28. (Contributed by NM, 22-Apr-2004.)
(AA) = ∅
 
TheoremdifidALT 3266 The difference between a class and itself is the empty set. Proposition 5.15 of [TakeutiZaring] p. 20. Also Theorem 32 of [Suppes] p. 28. Alternate proof of difid 3265. (Contributed by David Abernethy, 17-Jun-2012.) (Proof modification is discouraged.) (New usage is discouraged.)
(AA) = ∅
 
Theoremdif0 3267 The difference between a class and the empty set. Part of Exercise 4.4 of [Stoll] p. 16. (Contributed by NM, 17-Aug-2004.)
(A ∖ ∅) = A
 
Theorem0dif 3268 The difference between the empty set and a class. Part of Exercise 4.4 of [Stoll] p. 16. (Contributed by NM, 17-Aug-2004.)
(∅ ∖ A) = ∅
 
Theoremdisjdif 3269 A class and its relative complement are disjoint. Theorem 38 of [Suppes] p. 29. (Contributed by NM, 24-Mar-1998.)
(A ∩ (BA)) = ∅
 
Theoremdifin0 3270 The difference of a class from its intersection is empty. Theorem 37 of [Suppes] p. 29. (Contributed by NM, 17-Aug-2004.) (Proof shortened by Andrew Salmon, 26-Jun-2011.)
((AB) ∖ B) = ∅
 
Theoremundif1ss 3271 Absorption of difference by union. In classical logic, as Theorem 35 of [Suppes] p. 29, this would be equality rather than subset. (Contributed by Jim Kingdon, 4-Aug-2018.)
((AB) ∪ B) ⊆ (AB)
 
Theoremundif2ss 3272 Absorption of difference by union. In classical logic, as in Part of proof of Corollary 6K of [Enderton] p. 144, this would be equality rather than subset. (Contributed by Jim Kingdon, 4-Aug-2018.)
(A ∪ (BA)) ⊆ (AB)
 
Theoremundifabs 3273 Absorption of difference by union. (Contributed by NM, 18-Aug-2013.)
(A ∪ (AB)) = A
 
Theoreminundifss 3274 The intersection and class difference of a class with another class are contained in the original class. In classical logic we'd be able to make a stronger statement: that everything in the original class is in the intersection or the difference (that is, this theorem would be equality rather than subset). (Contributed by Jim Kingdon, 4-Aug-2018.)
((AB) ∪ (AB)) ⊆ A
 
Theoremdifun2 3275 Absorption of union by difference. Theorem 36 of [Suppes] p. 29. (Contributed by NM, 19-May-1998.)
((AB) ∖ B) = (AB)
 
Theoremundifss 3276 Union of complementary parts into whole. (Contributed by Jim Kingdon, 4-Aug-2018.)
(AB ↔ (A ∪ (BA)) ⊆ B)
 
Theoremssdifin0 3277 A subset of a difference does not intersect the subtrahend. (Contributed by Jeff Hankins, 1-Sep-2013.) (Proof shortened by Mario Carneiro, 24-Aug-2015.)
(A ⊆ (B𝐶) → (A𝐶) = ∅)
 
Theoremssdifeq0 3278 A class is a subclass of itself subtracted from another iff it is the empty set. (Contributed by Steve Rodriguez, 20-Nov-2015.)
(A ⊆ (BA) ↔ A = ∅)
 
Theoremssundifim 3279 A consequence of inclusion in the union of two classes. In classical logic this would be a biconditional. (Contributed by Jim Kingdon, 4-Aug-2018.)
(A ⊆ (B𝐶) → (AB) ⊆ 𝐶)
 
Theoremdifdifdirss 3280 Distributive law for class difference. In classical logic, as in Exercise 4.8 of [Stoll] p. 16, this would be equality rather than subset. (Contributed by Jim Kingdon, 4-Aug-2018.)
((AB) ∖ 𝐶) ⊆ ((A𝐶) ∖ (B𝐶))
 
Theoremuneqdifeqim 3281 Two ways that A and B can "partition" 𝐶 (when A and B don't overlap and A is a part of 𝐶). In classical logic, the second implication would be a biconditional. (Contributed by Jim Kingdon, 4-Aug-2018.)
((A𝐶 (AB) = ∅) → ((AB) = 𝐶 → (𝐶A) = B))
 
Theoremr19.2m 3282* Theorem 19.2 of [Margaris] p. 89 with restricted quantifiers (compare 19.2 1507). The restricted version is valid only when the domain of quantification is inhabited. (Contributed by Jim Kingdon, 5-Aug-2018.)
((x x A x A φ) → x A φ)
 
Theoremr19.3rmOLD 3283* Restricted quantification of wff not containing quantified variable. This is a special case of r19.3rm 3285 where the two setvar variables are both x, so new proofs should just use r19.3rm 3285 instead. (Contributed by Jim Kingdon, 5-Aug-2018.) (New usage is discouraged.)
xφ       (x x A → (φx A φ))
 
Theoremr19.28m 3284* Restricted quantifier version of Theorem 19.28 of [Margaris] p. 90. It is valid only when the domain of quantification is inhabited. (Contributed by Jim Kingdon, 5-Aug-2018.)
xφ       (x x A → (x A (φ ψ) ↔ (φ x A ψ)))
 
Theoremr19.3rm 3285* Restricted quantification of wff not containing quantified variable. (Contributed by Jim Kingdon, 19-Dec-2018.)
xφ       (y y A → (φx A φ))
 
Theoremr19.3rmv 3286* Restricted quantification of wff not containing quantified variable. (Contributed by Jim Kingdon, 6-Aug-2018.)
(y y A → (φx A φ))
 
Theoremr19.9rmv 3287* Restricted quantification of wff not containing quantified variable. (Contributed by Jim Kingdon, 5-Aug-2018.)
(y y A → (φx A φ))
 
Theoremr19.9rmvOLD 3288* Restricted quantification of wff not containing quantified variable. This is a special case of r19.9rmv 3287 where x and y are the same variable, but new proofs should use r19.9rmv 3287 instead. (New usage is discouraged.) (Contributed by Jim Kingdon, 5-Aug-2018.)
(x x A → (φx A φ))
 
Theoremr19.28mv 3289* Restricted quantifier version of Theorem 19.28 of [Margaris] p. 90. It is valid only when the domain of quantification is inhabited. (Contributed by Jim Kingdon, 6-Aug-2018.)
(x x A → (x A (φ ψ) ↔ (φ x A ψ)))
 
Theoremr19.45mv 3290* Restricted version of Theorem 19.45 of [Margaris] p. 90. (Contributed by NM, 27-May-1998.)
(x x A → (x A (φ ψ) ↔ (φ x A ψ)))
 
Theoremr19.27m 3291* Restricted quantifier version of Theorem 19.27 of [Margaris] p. 90. It is valid only when the domain of quantification is inhabited. (Contributed by Jim Kingdon, 5-Aug-2018.)
xψ       (x x A → (x A (φ ψ) ↔ (x A φ ψ)))
 
Theoremr19.27mv 3292* Restricted quantifier version of Theorem 19.27 of [Margaris] p. 90. It is valid only when the domain of quantification is inhabited. (Contributed by Jim Kingdon, 5-Aug-2018.)
(x x A → (x A (φ ψ) ↔ (x A φ ψ)))
 
Theoremrzal 3293* Vacuous quantification is always true. (Contributed by NM, 11-Mar-1997.) (Proof shortened by Andrew Salmon, 26-Jun-2011.)
(A = ∅ → x A φ)
 
Theoremrexn0 3294* Restricted existential quantification implies its restriction is nonempty. (Contributed by Szymon Jaroszewicz, 3-Apr-2007.)
(x A φA ≠ ∅)
 
Theoremrexm 3295* Restricted existential quantification implies its restriction is inhabited. (Contributed by Jim Kingdon, 16-Oct-2018.)
(x A φx x A)
 
Theoremralidm 3296* Idempotent law for restricted quantifier. (Contributed by NM, 28-Mar-1997.)
(x A x A φx A φ)
 
Theoremral0 3297 Vacuous universal quantification is always true. (Contributed by NM, 20-Oct-2005.)
x φ
 
Theoremrgenm 3298* Generalization rule that eliminates an inhabited class requirement. (Contributed by Jim Kingdon, 5-Aug-2018.)
((x x A x A) → φ)       x A φ
 
Theoremralf0 3299* The quantification of a falsehood is vacuous when true. (Contributed by NM, 26-Nov-2005.)
¬ φ       (x A φA = ∅)
 
Theoremralm 3300 Inhabited classes and restricted quantification. (Contributed by Jim Kingdon, 6-Aug-2018.)
((x x Ax A φ) ↔ x A φ)
    < 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-7354
  Copyright terms: Public domain < Previous  Next >