Home Metamath Proof ExplorerTheorem List (p. 296 of 327) < Previous  Next > Browser slow? Try the Unicode version.

 Color key: Metamath Proof Explorer (1-22413) Hilbert Space Explorer (22414-23936) Users' Mathboxes (23937-32699)

Theorem List for Metamath Proof Explorer - 29501-29600   *Has distinct variable group(s)
TypeLabelDescription
Statement

Theoremsbi2NEW7 29501 Introduction of implication into substitution. (Contributed by NM, 5-Aug-1993.)

TheoremsbimNEW7 29502 Implication inside and outside of substitution are equivalent. (Contributed by NM, 5-Aug-1993.)

TheoremsborNEW7 29503 Logical OR inside and outside of substitution are equivalent. (Contributed by NM, 29-Sep-2002.)

TheoremsbrimNEW7 29504 Substitution with a variable not free in antecedent affects only the consequent. (Contributed by NM, 5-Aug-1993.) (Revised by Mario Carneiro, 4-Oct-2016.)

TheoremsblimNEW7 29505 Substitution with a variable not free in consequent affects only the antecedent. (Contributed by NM, 14-Nov-2013.) (Revised by Mario Carneiro, 4-Oct-2016.)

TheoremsbanNEW7 29506 Conjunction inside and outside of a substitution are equivalent. (Contributed by NM, 5-Aug-1993.)

TheoremsbbiNEW7 29507 Equivalence inside and outside of a substitution are equivalent. (Contributed by NM, 5-Aug-1993.)

TheoremspsbeNEW7 29508 A specialization theorem. (Contributed by NM, 5-Aug-1993.)

TheoremspsbimNEW7 29509 Specialization of implication. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Andrew Salmon, 25-May-2011.)

TheoremspsbbiNEW7 29510 Specialization of biconditional. (Contributed by NM, 5-Aug-1993.)

TheoremsbbidNEW7 29511 Deduction substituting both sides of a biconditional. (Contributed by NM, 5-Aug-1993.)

Theoremsbequ8NEW7 29512 Elimination of equality from antecedent after substitution. (Contributed by NM, 5-Aug-1993.)

Theoremnfsb4twAUX7 29513* Weak version of nfsb4t 2154 not requiring ax-7 1749. (Contributed by NM, 27-Oct-2017.)

Theoremnfsb4wAUX7 29514* Weak version of nfsb4t 2154 not requiring ax-7 1749. (Contributed by NM, 27-Oct-2017.)

TheoremnfsbdwAUX7 29515* Deduction version of nfsbwAUX7 29602. (Contributed by NM, 24-May-2018.)

TheoremsbequiNEW7 29516 An equality theorem for substitution. (Contributed by NM, 5-Aug-1993.)

TheoremsbequNEW7 29517 An equality theorem for substitution. Used in proof of Theorem 9.7 in [Megill] p. 449 (p. 16 of the preprint). (Contributed by NM, 5-Aug-1993.)

Theoremdrsb2NEW7 29518 Formula-building lemma for use with the Distinctor Reduction Theorem. Part of Theorem 9.4 of [Megill] p. 448 (p. 16 of preprint). (Contributed by NM, 27-Feb-2005.)

TheoremsbcoNEW7 29519 A composition law for substitution. (Contributed by NM, 5-Aug-1993.)

Theoremsbid2NEW7 29520 An identity law for substitution. (Contributed by NM, 5-Aug-1993.) (Revised by Mario Carneiro, 6-Oct-2016.)

TheoremsbidmNEW7 29521 An idempotent law for substitution. (Contributed by NM, 30-Jun-1994.) (Proof shortened by Andrew Salmon, 25-May-2011.)

Theoremsbco2wAUX7 29522* Weak version of sbco2 2161 not requiring ax-7 1749. (Contributed by NM, 27-Oct-2017.)

Theoremsbco2dwAUX7 29523* Weak version of sbco2d 2162 not requiring ax-7 1749. (Contributed by NM, 27-Oct-2017.)

Theoremsbco3wAUX7 29524* Weak version of sbco3 2163 not requiring ax-7 1749. (Contributed by NM, 27-Oct-2017.)

TheoremsbcomwAUX7 29525* Weak version of sbcom 2164 not requiring ax-7 1749. (Contributed by NM, 27-Oct-2017.)

Theoremsb8iwAUX7 29526* Version of sb8 2167 not requiring ax-7 1749. (Contributed by NM, 22-May-2018.)

Theoremsb8dwAUX7 29527* Weak version of sb8 2167 not requiring ax-7 1749. (Contributed by NM, 22-May-2018.)

Theoremsb5rfNEW7 29528 Reversed substitution. (Contributed by NM, 3-Feb-2005.) (Revised by Mario Carneiro, 6-Oct-2016.)

Theoremsb6rfNEW7 29529 Reversed substitution. (Contributed by NM, 5-Aug-1993.) (Revised by Mario Carneiro, 6-Oct-2016.)

Theoremsb8wAUX7 29530* Weak version of sb8 2167 not requiring ax-7 1749. (Contributed by NM, 28-Oct-2017.)

Theoremsb8ewAUX7 29531* Weak version of sb8e 2168 not requiring ax-7 1749. (Contributed by NM, 28-Oct-2017.)

Theoremax11vNEW7 29532* This is a version of ax-11o 2217 when the variables are distinct. Axiom (C8) of [Monk2] p. 105. See theorem ax11v2 2074 for the rederivation of ax-11o 2217 from this theorem. (Contributed by NM, 5-Aug-1993.)

Theoremsb56NEW7 29533* Two equivalent ways of expressing the proper substitution of for in , when and are distinct. Theorem 6.2 of [Quine] p. 40. The proof does not involve df-sb 1659. (Contributed by NM, 14-Apr-2008.)

Theoremsb6NEW7 29534* Equivalence for substitution. Compare Theorem 6.2 of [Quine] p. 40. Also proved as Lemmas 16 and 17 of [Tarski] p. 70. (Contributed by NM, 18-Aug-1993.)

Theoremsb5NEW7 29535* Equivalence for substitution. Similar to Theorem 6.1 of [Quine] p. 40. (Contributed by NM, 18-Aug-1993.)

TheoremexsbNEW7 29536* An equivalent expression for existence. (Contributed by NM, 2-Feb-2005.) (Revised by NM, 28-Nov-2017.) Revised to prove from ax-7v 29379 instead of ax-7 1749.

TheoremexsbOLDNEW7 29537* An equivalent expression for existence. Obsolete as of 19-Jun-2017. (Contributed by NM, 2-Feb-2005.) (New usage is discouraged.)

Theoremequsb3lemNEW7 29538* Lemma for equsb3 2177. (Contributed by Raph Levien and FL, 4-Dec-2005.) (Proof shortened by Andrew Salmon, 14-Jun-2011.)

Theoremequsb3NEW7 29539* Substitution applied to an atomic wff. (Contributed by Raph Levien and FL, 4-Dec-2005.)

Theoremelsb3NEW7 29540* Substitution applied to an atomic membership wff. (Contributed by NM, 7-Nov-2006.) (Proof shortened by Andrew Salmon, 14-Jun-2011.)

Theoremelsb4NEW7 29541* Substitution applied to an atomic membership wff. (Contributed by Rodolfo Medina, 3-Apr-2010.) (Proof shortened by Andrew Salmon, 14-Jun-2011.)

Theoremhbs1NEW7 29542* is not free in when and are distinct. (Contributed by NM, 5-Aug-1993.)

Theoremnfs1vNEW7 29543* is not free in when and are distinct. (Contributed by Mario Carneiro, 11-Aug-2016.)

TheoremsbhbwAUX7 29544* Weak version of sbhb 2182 not requiring ax-7 1749. (Contributed by NM, 28-Oct-2017.)

Theoremsbnf2NEW7 29545* Two ways of expressing " is (effectively) not free in ." (Contributed by Gérard Lang, 14-Nov-2013.) (Revised by Mario Carneiro, 6-Oct-2016.)

Theorem2sb5NEW7 29546* Equivalence for double substitution. (Contributed by NM, 3-Feb-2005.)

Theorem2sb6NEW7 29547* Equivalence for double substitution. (Contributed by NM, 3-Feb-2005.)

Theoremsb6aNEW7 29548* Equivalence for substitution. (Contributed by NM, 5-Aug-1993.)

Theoremsbid2vNEW7 29549* An identity law for substitution. Used in proof of Theorem 9.7 of [Megill] p. 449 (p. 16 of the preprint). (Contributed by NM, 5-Aug-1993.)

TheoremsbelxNEW7 29550* Elimination of substitution. (Contributed by NM, 5-Aug-1993.)

Theoremsbel2xNEW7 29551* Elimination of double substitution. (Contributed by NM, 5-Aug-1993.)

Theoremsbal1NEW7 29552* A theorem used in elimination of disjoint variable restriction on and by replacing it with a distinctor . (Contributed by NM, 5-Aug-1993.)

TheoremsbalNEW7 29553* Move universal quantifier in and out of substitution. (Contributed by NM, 5-Aug-1993.)

TheoremsbexNEW7 29554* Move existential quantifier in and out of substitution. (Contributed by NM, 27-Sep-2003.)

TheoremsbalvNEW7 29555* Quantify with new variable inside substitution. (Contributed by NM, 18-Aug-1993.)

TheoremnaecomsNEW7 29556 A commutation rule for distinct variable specifiers. (Contributed by NM, 2-Jan-2002.)

TheoremchvarNEW7 29557 Implicit substitution of for into a theorem. (Contributed by Raph Levien, 9-Jul-2003.) (Revised by Mario Carneiro, 3-Oct-2016.)

Theoremequs45fNEW7 29558 Two ways of expressing substitution when is not free in . (Contributed by NM, 25-Apr-2008.) (Revised by Mario Carneiro, 4-Oct-2016.)

Theoremax11bNEW7 29559 A bidirectional version of ax11oNEW7 29469. (Contributed by NM, 30-Jun-2006.)

TheoremspvNEW7 29560* Specialization, using implicit substitution. (Contributed by NM, 30-Aug-1993.)

TheoremspimevNEW7 29561* Distinct-variable version of spimeNEW7 29446. (Contributed by NM, 5-Aug-1993.)

TheoremspeivNEW7 29562* Inference from existential specialization, using implicit substitution. (Contributed by NM, 19-Aug-1993.)

TheoremchvarvNEW7 29563* Implicit substitution of for into a theorem. (Contributed by NM, 20-Apr-1994.)

TheoremcleljustNEW7 29564* When the class variables in definition df-clel 2431 are replaced with set variables, this theorem of predicate calculus is the result. This theorem provides part of the justification for the consistency of that definition, which "overloads" the set variables in wel 1726 with the class variables in wcel 1725. Note: This proof is referenced on the Metamath Proof Explorer Home Page and shouldn't be changed. (Contributed by NM, 28-Jan-2004.) (Proof modification is discouraged.)

TheoremcleljustALTNEW7 29565* When the class variables in definition df-clel 2431 are replaced with set variables, this theorem of predicate calculus is the result. This theorem provides part of the justification for the consistency of that definition, which "overloads" the set variables in wel 1726 with the class variables in wcel 1725. (Contributed by NM, 28-Jan-2004.) (Revised by Mario Carneiro, 21-Dec-2016.)

Theoremsb6xNEW7 29566 Equivalence involving substitution for a variable not free. (Contributed by NM, 5-Aug-1993.) (Revised by Mario Carneiro, 4-Oct-2016.)

Theoremnfs1fNEW7 29567 If is not free in , it is not free in . (Contributed by Mario Carneiro, 11-Aug-2016.)

TheoremsbtNEW7 29568 A substitution into a theorem remains true. (See chvarNEW7 29557 and chvarvNEW7 29563 for versions using implicit substitution.) (Contributed by NM, 21-Jan-2004.) (Proof shortened by Andrew Salmon, 25-May-2011.)

TheoremsbiedvNEW7 29569* Conversion of implicit substitution to explicit substitution (deduction version of sbieNEW7 29478). (Contributed by NM, 7-Jan-2017.)

Theoremsb6fNEW7 29570 Equivalence for substitution when is not free in . (Contributed by NM, 5-Aug-1993.) (Revised by Mario Carneiro, 4-Oct-2016.)

Theoremsb5fNEW7 29571 Equivalence for substitution when is not free in . (Contributed by NM, 5-Aug-1993.) (Revised by Mario Carneiro, 4-Oct-2016.)

Theoremax16ALTNEW7 29572* Alternate proof of ax16NEW7 29486. (Contributed by NM, 17-May-2008.) (Proof modification is discouraged.) (New usage is discouraged.)

TheoremdvelimALTNEW7 29573* Version of dvelim 2069 that doesn't use ax-10 2216. (See dvelimh 2067 for a version that doesn't use ax-11 1761.) (Contributed by NM, 17-May-2008.) (New usage is discouraged.) (Proof modification is discouraged.)

Theoremsb3NEW7 29574 One direction of a simplified definition of substitution when variables are distinct. (Contributed by NM, 5-Aug-1993.)

Theoremdfsb2NEW7 29575 An alternate definition of proper substitution that, like df-sb 1659, mixes free and bound variables to avoid distinct variable requirements. (Contributed by NM, 17-Feb-2005.)

Theoremdfsb3NEW7 29576 An alternate definition of proper substitution df-sb 1659 that uses only primitive connectives (no defined terms) on the right-hand side. (Contributed by NM, 6-Mar-2007.)

Theoremsb3anNEW7 29577 Conjunction inside and outside of a substitution are equivalent. (Contributed by NM, 14-Dec-2006.)

TheoremsblbisNEW7 29578 Introduce left biconditional inside of a substitution. (Contributed by NM, 19-Aug-1993.)

TheoremsbrbisNEW7 29579 Introduce right biconditional inside of a substitution. (Contributed by NM, 18-Aug-1993.)

TheoremsbrbifNEW7 29580 Introduce right biconditional inside of a substitution. (Contributed by NM, 18-Aug-1993.) (Revised by Mario Carneiro, 4-Oct-2016.)

Theoremsbcom2NEW7 29581* Commutativity law for substitution. Used in proof of Theorem 9.7 of [Megill] p. 449 (p. 16 of the preprint). (Contributed by NM, 27-May-1997.)

Theoremax7w1AUX7 29582 Weak version of ax-7 1749 not requiring ax-7 1749. (Contributed by NM, 9-Oct-2017.)

Theoremax7w1hAUX7 29583 Weak version of hbal 1751 not requiring ax-7 1749. (Contributed by NM, 27-Oct-2017.)

Theoremhbaew0AUX7 29584 Weak version of hbae 2040 not requiring ax-7 1749. (Contributed by NM, 29-Oct-2017.)

Theoremhbaew4AUX7 29585 Weak version of hbae 2040 not requiring ax-7 1749. (Contributed by NM, 30-Oct-2017.)

Theoremhbaew5AUX7 29586* Weak version of hbae 2040 not requiring ax-7 1749. (Contributed by NM, 30-Oct-2017.)

Theoremax7w2AUX7 29587 Special case of ax-7 1749. (Contributed by NM, 9-Oct-2017.)

Theoremax7w3AUX7 29588 Special case of ax-7 1749. (Contributed by NM, 12-Oct-2017.)

Theoremax7w6AUX7 29589 Version of sb9i 2169 with the usage of ax-7 1749 broken out as a hypothesis. (Contributed by NM, 16-Oct-2017.)

Theoremax7w7AUX7 29590 Special case of ax-7 1749. (Contributed by NM, 12-Oct-2017.)

Theoremax7w8AUX7 29591 Special case of ax-7 1749. (Contributed by NM, 13-Oct-2017.)

Theoremax7nfAUX7 29592 Special case of ax-7 1749. (Contributed by NM, 23-Nov-2017.)

Theoremax7w7tAUX7 29593 Special case of ax-7 1749. (Contributed by NM, 23-Nov-2017.)

Theoremax7wnftAUX7 29594 Special case of ax-7 1749. (Contributed by NM, 23-Nov-2017.)

Theoremax7w4AUX7 29595 Remove quantifier from ax-7 1749. (Contributed by NM, 12-Oct-2017.)

Theoremax7w5AUX7 29596 Same as hbal 1751 with explicit ax-7 1749 hypothesis. (Contributed by NM, 12-Oct-2017.)

Theoremax7w9AUX7 29597 Special case of ax-7 1749 proved from ax-7v 29379. (Contributed by NM, 28-Nov-2017.)

Theoremalcomw9bAUX7 29598 Special case of alcom 1752 proved from ax-7v 29379. (Contributed by NM, 28-Nov-2017.)

Theoremax7w10AUX7 29599 Special case of ax-7 1749 derived from ax-7v 29379. (Contributed by NM, 20-May-2018.)

Theoremax7w11AUX7 29600 Special case of ax-7 1749 derived from ax-7v 29379. (Contributed by NM, 20-May-2018.)

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-11400 115 11401-11500 116 11501-11600 117 11601-11700 118 11701-11800 119 11801-11900 120 11901-12000 121 12001-12100 122 12101-12200 123 12201-12300 124 12301-12400 125 12401-12500 126 12501-12600 127 12601-12700 128 12701-12800 129 12801-12900 130 12901-13000 131 13001-13100 132 13101-13200 133 13201-13300 134 13301-13400 135 13401-13500 136 13501-13600 137 13601-13700 138 13701-13800 139 13801-13900 140 13901-14000 141 14001-14100 142 14101-14200 143 14201-14300 144 14301-14400 145 14401-14500 146 14501-14600 147 14601-14700 148 14701-14800 149 14801-14900 150 14901-15000 151 15001-15100 152 15101-15200 153 15201-15300 154 15301-15400 155 15401-15500 156 15501-15600 157 15601-15700 158 15701-15800 159 15801-15900 160 15901-16000 161 16001-16100 162 16101-16200 163 16201-16300 164 16301-16400 165 16401-16500 166 16501-16600 167 16601-16700 168 16701-16800 169 16801-16900 170 16901-17000 171 17001-17100 172 17101-17200 173 17201-17300 174 17301-17400 175 17401-17500 176 17501-17600 177 17601-17700 178 17701-17800 179 17801-17900 180 17901-18000 181 18001-18100 182 18101-18200 183 18201-18300 184 18301-18400 185 18401-18500 186 18501-18600 187 18601-18700 188 18701-18800 189 18801-18900 190 18901-19000 191 19001-19100 192 19101-19200 193 19201-19300 194 19301-19400 195 19401-19500 196 19501-19600 197 19601-19700 198 19701-19800 199 19801-19900 200 19901-20000 201 20001-20100 202 20101-20200 203 20201-20300 204 20301-20400 205 20401-20500 206 20501-20600 207 20601-20700 208 20701-20800 209 20801-20900 210 20901-21000 211 21001-21100 212 21101-21200 213 21201-21300 214 21301-21400 215 21401-21500 216 21501-21600 217 21601-21700 218 21701-21800 219 21801-21900 220 21901-22000 221 22001-22100 222 22101-22200 223 22201-22300 224 22301-22400 225 22401-22500 226 22501-22600 227 22601-22700 228 22701-22800 229 22801-22900 230 22901-23000 231 23001-23100 232 23101-23200 233 23201-23300 234 23301-23400 235 23401-23500 236 23501-23600 237 23601-23700 238 23701-23800 239 23801-23900 240 23901-24000 241 24001-24100 242 24101-24200 243 24201-24300 244 24301-24400 245 24401-24500 246 24501-24600 247 24601-24700 248 24701-24800 249 24801-24900 250 24901-25000 251 25001-25100 252 25101-25200 253 25201-25300 254 25301-25400 255 25401-25500 256 25501-25600 257 25601-25700 258 25701-25800 259 25801-25900 260 25901-26000 261 26001-26100 262 26101-26200 263 26201-26300 264 26301-26400 265 26401-26500 266 26501-26600 267 26601-26700 268 26701-26800 269 26801-26900 270 26901-27000 271 27001-27100 272 27101-27200 273 27201-27300 274 27301-27400 275 27401-27500 276 27501-27600 277 27601-27700 278 27701-27800 279 27801-27900 280 27901-28000 281 28001-28100 282 28101-28200 283 28201-28300 284 28301-28400 285 28401-28500 286 28501-28600 287 28601-28700 288 28701-28800 289 28801-28900 290 28901-29000 291 29001-29100 292 29101-29200 293 29201-29300 294 29301-29400 295 29401-29500 296 29501-29600 297 29601-29700 298 29701-29800 299 29801-29900 300 29901-30000 301 30001-30100 302 30101-30200 303 30201-30300 304 30301-30400 305 30401-30500 306 30501-30600 307 30601-30700 308 30701-30800 309 30801-30900 310 30901-31000 311 31001-31100 312 31101-31200 313 31201-31300 314 31301-31400 315 31401-31500 316 31501-31600 317 31601-31700 318 31701-31800 319 31801-31900 320 31901-32000 321 32001-32100 322 32101-32200 323 32201-32300 324 32301-32400 325 32401-32500 326 32501-32600 327 32601-32699
 Copyright terms: Public domain < Previous  Next >