Home Intuitionistic Logic ExplorerTheorem List (p. 32 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

Theorem List for Intuitionistic Logic Explorer - 3101-3200   *Has distinct variable group(s)
TypeLabelDescription
Statement

Theoremssun2 3101 Subclass relationship for union of classes. (Contributed by NM, 30-Aug-1993.)

Theoremssun3 3102 Subclass law for union of classes. (Contributed by NM, 5-Aug-1993.)

Theoremssun4 3103 Subclass law for union of classes. (Contributed by NM, 14-Aug-1994.)

Theoremelun1 3104 Membership law for union of classes. (Contributed by NM, 5-Aug-1993.)

Theoremelun2 3105 Membership law for union of classes. (Contributed by NM, 30-Aug-1993.)

Theoremunss1 3106 Subclass law for union of classes. (Contributed by NM, 14-Oct-1999.) (Proof shortened by Andrew Salmon, 26-Jun-2011.)

Theoremssequn1 3107 A relationship between subclass and union. Theorem 26 of [Suppes] p. 27. (Contributed by NM, 30-Aug-1993.) (Proof shortened by Andrew Salmon, 26-Jun-2011.)

Theoremunss2 3108 Subclass law for union of classes. Exercise 7 of [TakeutiZaring] p. 18. (Contributed by NM, 14-Oct-1999.)

Theoremunss12 3109 Subclass law for union of classes. (Contributed by NM, 2-Jun-2004.)

Theoremssequn2 3110 A relationship between subclass and union. (Contributed by NM, 13-Jun-1994.)

Theoremunss 3111 The union of two subclasses is a subclass. Theorem 27 of [Suppes] p. 27 and its converse. (Contributed by NM, 11-Jun-2004.)

Theoremunssi 3112 An inference showing the union of two subclasses is a subclass. (Contributed by Raph Levien, 10-Dec-2002.)

Theoremunssd 3113 A deduction showing the union of two subclasses is a subclass. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.)

Theoremunssad 3114 If is contained in , so is . One-way deduction form of unss 3111. Partial converse of unssd 3113. (Contributed by David Moews, 1-May-2017.)

Theoremunssbd 3115 If is contained in , so is . One-way deduction form of unss 3111. Partial converse of unssd 3113. (Contributed by David Moews, 1-May-2017.)

Theoremssun 3116 A condition that implies inclusion in the union of two classes. (Contributed by NM, 23-Nov-2003.)

Theoremrexun 3117 Restricted existential quantification over union. (Contributed by Jeff Madsen, 5-Jan-2011.)

Theoremralunb 3118 Restricted quantification over a union. (Contributed by Scott Fenton, 12-Apr-2011.) (Proof shortened by Andrew Salmon, 29-Jun-2011.)

Theoremralun 3119 Restricted quantification over union. (Contributed by Jeff Madsen, 2-Sep-2009.)

2.1.13.3  The intersection of two classes

Theoremelin 3120 Expansion of membership in an intersection of two classes. Theorem 12 of [Suppes] p. 25. (Contributed by NM, 29-Apr-1994.)

Theoremelin2 3121 Membership in a class defined as an intersection. (Contributed by Stefan O'Rear, 29-Mar-2015.)

Theoremelin3 3122 Membership in a class defined as a ternary intersection. (Contributed by Stefan O'Rear, 29-Mar-2015.)

Theoremincom 3123 Commutative law for intersection of classes. Exercise 7 of [TakeutiZaring] p. 17. (Contributed by NM, 5-Aug-1993.)

Theoremineqri 3124* Inference from membership to intersection. (Contributed by NM, 5-Aug-1993.)

Theoremineq1 3125 Equality theorem for intersection of two classes. (Contributed by NM, 14-Dec-1993.)

Theoremineq2 3126 Equality theorem for intersection of two classes. (Contributed by NM, 26-Dec-1993.)

Theoremineq12 3127 Equality theorem for intersection of two classes. (Contributed by NM, 8-May-1994.)

Theoremineq1i 3128 Equality inference for intersection of two classes. (Contributed by NM, 26-Dec-1993.)

Theoremineq2i 3129 Equality inference for intersection of two classes. (Contributed by NM, 26-Dec-1993.)

Theoremineq12i 3130 Equality inference for intersection of two classes. (Contributed by NM, 24-Jun-2004.) (Proof shortened by Eric Schmidt, 26-Jan-2007.)

Theoremineq1d 3131 Equality deduction for intersection of two classes. (Contributed by NM, 10-Apr-1994.)

Theoremineq2d 3132 Equality deduction for intersection of two classes. (Contributed by NM, 10-Apr-1994.)

Theoremineq12d 3133 Equality deduction for intersection of two classes. (Contributed by NM, 24-Jun-2004.) (Proof shortened by Andrew Salmon, 26-Jun-2011.)

Theoremineqan12d 3134 Equality deduction for intersection of two classes. (Contributed by NM, 7-Feb-2007.)

Theoremdfss1 3135 A frequently-used variant of subclass definition df-ss 2925. (Contributed by NM, 10-Jan-2015.)

Theoremdfss5 3136 Another definition of subclasshood. Similar to df-ss 2925, dfss 2926, and dfss1 3135. (Contributed by David Moews, 1-May-2017.)

Theoremnfin 3137 Bound-variable hypothesis builder for the intersection of classes. (Contributed by NM, 15-Sep-2003.) (Revised by Mario Carneiro, 14-Oct-2016.)

Theoremcsbing 3138 Distribute proper substitution through an intersection relation. (Contributed by Alan Sare, 22-Jul-2012.)

Theoremrabbi2dva 3139* Deduction from a wff to a restricted class abstraction. (Contributed by NM, 14-Jan-2014.)

Theoreminidm 3140 Idempotent law for intersection of classes. Theorem 15 of [Suppes] p. 26. (Contributed by NM, 5-Aug-1993.)

Theoreminass 3141 Associative law for intersection of classes. Exercise 9 of [TakeutiZaring] p. 17. (Contributed by NM, 3-May-1994.)

Theoremin12 3142 A rearrangement of intersection. (Contributed by NM, 21-Apr-2001.)

Theoremin32 3143 A rearrangement of intersection. (Contributed by NM, 21-Apr-2001.) (Proof shortened by Andrew Salmon, 26-Jun-2011.)

Theoremin13 3144 A rearrangement of intersection. (Contributed by NM, 27-Aug-2012.)

Theoremin31 3145 A rearrangement of intersection. (Contributed by NM, 27-Aug-2012.)

Theoreminrot 3146 Rotate the intersection of 3 classes. (Contributed by NM, 27-Aug-2012.)

Theoremin4 3147 Rearrangement of intersection of 4 classes. (Contributed by NM, 21-Apr-2001.)

Theoreminindi 3148 Intersection distributes over itself. (Contributed by NM, 6-May-1994.)

Theoreminindir 3149 Intersection distributes over itself. (Contributed by NM, 17-Aug-2004.)

Theoremsseqin2 3150 A relationship between subclass and intersection. Similar to Exercise 9 of [TakeutiZaring] p. 18. (Contributed by NM, 17-May-1994.)

Theoreminss1 3151 The intersection of two classes is a subset of one of them. Part of Exercise 12 of [TakeutiZaring] p. 18. (Contributed by NM, 27-Apr-1994.)

Theoreminss2 3152 The intersection of two classes is a subset of one of them. Part of Exercise 12 of [TakeutiZaring] p. 18. (Contributed by NM, 27-Apr-1994.)

Theoremssin 3153 Subclass of intersection. Theorem 2.8(vii) of [Monk1] p. 26. (Contributed by NM, 15-Jun-2004.) (Proof shortened by Andrew Salmon, 26-Jun-2011.)

Theoremssini 3154 An inference showing that a subclass of two classes is a subclass of their intersection. (Contributed by NM, 24-Nov-2003.)

Theoremssind 3155 A deduction showing that a subclass of two classes is a subclass of their intersection. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.)

Theoremssrin 3156 Add right intersection to subclass relation. (Contributed by NM, 16-Aug-1994.) (Proof shortened by Andrew Salmon, 26-Jun-2011.)

Theoremsslin 3157 Add left intersection to subclass relation. (Contributed by NM, 19-Oct-1999.)

Theoremss2in 3158 Intersection of subclasses. (Contributed by NM, 5-May-2000.)

Theoremssinss1 3159 Intersection preserves subclass relationship. (Contributed by NM, 14-Sep-1999.)

Theoreminss 3160 Inclusion of an intersection of two classes. (Contributed by NM, 30-Oct-2014.)

2.1.13.4  Combinations of difference, union, and intersection of two classes

Theoremunabs 3161 Absorption law for union. (Contributed by NM, 16-Apr-2006.)

Theoreminabs 3162 Absorption law for intersection. (Contributed by NM, 16-Apr-2006.)

Theoremnssinpss 3163 Negation of subclass expressed in terms of intersection and proper subclass. (Contributed by NM, 30-Jun-2004.) (Proof shortened by Andrew Salmon, 26-Jun-2011.)

Theoremnsspssun 3164 Negation of subclass expressed in terms of proper subclass and union. (Contributed by NM, 15-Sep-2004.)

Theoremssddif 3165 Double complement and subset. Similar to ddifss 3169 but inside a class instead of the universal class . In classical logic the subset operation on the right hand side could be an equality (that is, ). (Contributed by Jim Kingdon, 24-Jul-2018.)

Theoremunssdif 3166 Union of two classes and class difference. In classical logic this would be an equality. (Contributed by Jim Kingdon, 24-Jul-2018.)

Theoreminssdif 3167 Intersection of two classes and class difference. In classical logic this would be an equality. (Contributed by Jim Kingdon, 24-Jul-2018.)

Theoremdifin 3168 Difference with intersection. Theorem 33 of [Suppes] p. 29. (Contributed by NM, 31-Mar-1998.) (Proof shortened by Andrew Salmon, 26-Jun-2011.)

Theoremddifss 3169 Double complement under universal class. In classical logic (or given an additional hypothesis, as in ddifnel 3069), this is equality rather than subset. (Contributed by Jim Kingdon, 24-Jul-2018.)

Theoremunssin 3170 Union as a subset of class complement and intersection (De Morgan's law). One direction of the definition of union in [Mendelson] p. 231. This would be an equality, rather than subset, in classical logic. (Contributed by Jim Kingdon, 25-Jul-2018.)

Theoreminssun 3171 Intersection in terms of class difference and union (De Morgan's law). Similar to Exercise 4.10(n) of [Mendelson] p. 231. This would be an equality, rather than subset, in classical logic. (Contributed by Jim Kingdon, 25-Jul-2018.)

Theoreminssddif 3172 Intersection of two classes and class difference. In classical logic, such as Exercise 4.10(q) of [Mendelson] p. 231, this is an equality rather than subset. (Contributed by Jim Kingdon, 26-Jul-2018.)

Theoreminvdif 3173 Intersection with universal complement. Remark in [Stoll] p. 20. (Contributed by NM, 17-Aug-2004.)

Theoremindif 3174 Intersection with class difference. Theorem 34 of [Suppes] p. 29. (Contributed by NM, 17-Aug-2004.)

Theoremindif2 3175 Bring an intersection in and out of a class difference. (Contributed by Jeff Hankins, 15-Jul-2009.)

Theoremindif1 3176 Bring an intersection in and out of a class difference. (Contributed by Mario Carneiro, 15-May-2015.)

Theoremindifcom 3177 Commutation law for intersection and difference. (Contributed by Scott Fenton, 18-Feb-2013.)

Theoremindi 3178 Distributive law for intersection over union. Exercise 10 of [TakeutiZaring] p. 17. (Contributed by NM, 30-Sep-2002.) (Proof shortened by Andrew Salmon, 26-Jun-2011.)

Theoremundi 3179 Distributive law for union over intersection. Exercise 11 of [TakeutiZaring] p. 17. (Contributed by NM, 30-Sep-2002.) (Proof shortened by Andrew Salmon, 26-Jun-2011.)

Theoremindir 3180 Distributive law for intersection over union. Theorem 28 of [Suppes] p. 27. (Contributed by NM, 30-Sep-2002.)

Theoremundir 3181 Distributive law for union over intersection. Theorem 29 of [Suppes] p. 27. (Contributed by NM, 30-Sep-2002.)

Theoremuneqin 3182 Equality of union and intersection implies equality of their arguments. (Contributed by NM, 16-Apr-2006.) (Proof shortened by Andrew Salmon, 26-Jun-2011.)

Theoremdifundi 3183 Distributive law for class difference. Theorem 39 of [Suppes] p. 29. (Contributed by NM, 17-Aug-2004.)

Theoremdifundir 3184 Distributive law for class difference. (Contributed by NM, 17-Aug-2004.)

Theoremdifindiss 3185 Distributive law for class difference. In classical logic, for example, theorem 40 of [Suppes] p. 29, this is an equality instead of subset. (Contributed by Jim Kingdon, 26-Jul-2018.)

Theoremdifindir 3186 Distributive law for class difference. (Contributed by NM, 17-Aug-2004.)

Theoremindifdir 3187 Distribute intersection over difference. (Contributed by Scott Fenton, 14-Apr-2011.)

Theoremdifdif2ss 3188 Set difference with a set difference. In classical logic this would be equality rather than subset. (Contributed by Jim Kingdon, 27-Jul-2018.)

Theoremundm 3189 De Morgan's law for union. Theorem 5.2(13) of [Stoll] p. 19. (Contributed by NM, 18-Aug-2004.)

Theoremindmss 3190 De Morgan's law for intersection. In classical logic, this would be equality rather than subset, as in Theorem 5.2(13') of [Stoll] p. 19. (Contributed by Jim Kingdon, 27-Jul-2018.)

Theoremdifun1 3191 A relationship involving double difference and union. (Contributed by NM, 29-Aug-2004.)

Theoremundif3ss 3192 A subset relationship involving class union and class difference. In classical logic, this would be equality rather than subset, as in the first equality of Exercise 13 of [TakeutiZaring] p. 22. (Contributed by Jim Kingdon, 28-Jul-2018.)

Theoremdifin2 3193 Represent a set difference as an intersection with a larger difference. (Contributed by Jeff Madsen, 2-Sep-2009.)

Theoremdif32 3194 Swap second and third argument of double difference. (Contributed by NM, 18-Aug-2004.)

Theoremdifabs 3195 Absorption-like law for class difference: you can remove a class only once. (Contributed by FL, 2-Aug-2009.)

Theoremsymdif1 3196 Two ways to express symmetric difference. This theorem shows the equivalence of the definition of symmetric difference in [Stoll] p. 13 and the restated definition in Example 4.1 of [Stoll] p. 262. (Contributed by NM, 17-Aug-2004.)

2.1.13.5  Class abstractions with difference, union, and intersection of two classes

Theoremsymdifxor 3197* Expressing symmetric difference with exclusive-or or two differences. (Contributed by Jim Kingdon, 28-Jul-2018.)

Theoremunab 3198 Union of two class abstractions. (Contributed by NM, 29-Sep-2002.) (Proof shortened by Andrew Salmon, 26-Jun-2011.)

Theoreminab 3199 Intersection of two class abstractions. (Contributed by NM, 29-Sep-2002.) (Proof shortened by Andrew Salmon, 26-Jun-2011.)

Theoremdifab 3200 Difference of two class abstractions. (Contributed by NM, 23-Oct-2004.) (Proof shortened by Andrew Salmon, 26-Jun-2011.)

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-9457
 Copyright terms: Public domain < Previous  Next >