 Home Intuitionistic Logic ExplorerTheorem List (p. 13 of 95) < 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 - 1201-1300   *Has distinct variable group(s)
TypeLabelDescription
Statement

Theoremmpjao3dan 1201 Eliminate a 3-way disjunction in a deduction. (Contributed by Thierry Arnoux, 13-Apr-2018.)
((φ ψ) → χ)    &   ((φ θ) → χ)    &   ((φ τ) → χ)    &   (φ → (ψ θ τ))       (φχ)

Theorem3jaao 1202 Inference conjoining and disjoining the antecedents of three implications. (Contributed by Jeff Hankins, 15-Aug-2009.) (Proof shortened by Andrew Salmon, 13-May-2011.)
(φ → (ψχ))    &   (θ → (τχ))    &   (η → (ζχ))       ((φ θ η) → ((ψ τ ζ) → χ))

Theorem3ianorr 1203 Triple disjunction implies negated triple conjunction. (Contributed by Jim Kingdon, 23-Dec-2018.)
((¬ φ ¬ ψ ¬ χ) → ¬ (φ ψ χ))

Theoremsyl3an9b 1204 Nested syllogism inference conjoining 3 dissimilar antecedents. (Contributed by NM, 1-May-1995.)
(φ → (ψχ))    &   (θ → (χτ))    &   (η → (τζ))       ((φ θ η) → (ψζ))

Theorem3orbi123d 1205 Deduction joining 3 equivalences to form equivalence of disjunctions. (Contributed by NM, 20-Apr-1994.)
(φ → (ψχ))    &   (φ → (θτ))    &   (φ → (ηζ))       (φ → ((ψ θ η) ↔ (χ τ ζ)))

Theorem3anbi123d 1206 Deduction joining 3 equivalences to form equivalence of conjunctions. (Contributed by NM, 22-Apr-1994.)
(φ → (ψχ))    &   (φ → (θτ))    &   (φ → (ηζ))       (φ → ((ψ θ η) ↔ (χ τ ζ)))

Theorem3anbi12d 1207 Deduction conjoining and adding a conjunct to equivalences. (Contributed by NM, 8-Sep-2006.)
(φ → (ψχ))    &   (φ → (θτ))       (φ → ((ψ θ η) ↔ (χ τ η)))

Theorem3anbi13d 1208 Deduction conjoining and adding a conjunct to equivalences. (Contributed by NM, 8-Sep-2006.)
(φ → (ψχ))    &   (φ → (θτ))       (φ → ((ψ η θ) ↔ (χ η τ)))

Theorem3anbi23d 1209 Deduction conjoining and adding a conjunct to equivalences. (Contributed by NM, 8-Sep-2006.)
(φ → (ψχ))    &   (φ → (θτ))       (φ → ((η ψ θ) ↔ (η χ τ)))

Theorem3anbi1d 1210 Deduction adding conjuncts to an equivalence. (Contributed by NM, 8-Sep-2006.)
(φ → (ψχ))       (φ → ((ψ θ τ) ↔ (χ θ τ)))

Theorem3anbi2d 1211 Deduction adding conjuncts to an equivalence. (Contributed by NM, 8-Sep-2006.)
(φ → (ψχ))       (φ → ((θ ψ τ) ↔ (θ χ τ)))

Theorem3anbi3d 1212 Deduction adding conjuncts to an equivalence. (Contributed by NM, 8-Sep-2006.)
(φ → (ψχ))       (φ → ((θ τ ψ) ↔ (θ τ χ)))

Theorem3anim123d 1213 Deduction joining 3 implications to form implication of conjunctions. (Contributed by NM, 24-Feb-2005.)
(φ → (ψχ))    &   (φ → (θτ))    &   (φ → (ηζ))       (φ → ((ψ θ η) → (χ τ ζ)))

Theorem3orim123d 1214 Deduction joining 3 implications to form implication of disjunctions. (Contributed by NM, 4-Apr-1997.)
(φ → (ψχ))    &   (φ → (θτ))    &   (φ → (ηζ))       (φ → ((ψ θ η) → (χ τ ζ)))

Theoreman6 1215 Rearrangement of 6 conjuncts. (Contributed by NM, 13-Mar-1995.)
(((φ ψ χ) (θ τ η)) ↔ ((φ θ) (ψ τ) (χ η)))

Theorem3an6 1216 Analog of an4 520 for triple conjunction. (Contributed by Scott Fenton, 16-Mar-2011.) (Proof shortened by Andrew Salmon, 25-May-2011.)
(((φ ψ) (χ θ) (τ η)) ↔ ((φ χ τ) (ψ θ η)))

Theorem3or6 1217 Analog of or4 687 for triple conjunction. (Contributed by Scott Fenton, 16-Mar-2011.)
(((φ ψ) (χ θ) (τ η)) ↔ ((φ χ τ) (ψ θ η)))

Theoremmp3an1 1218 An inference based on modus ponens. (Contributed by NM, 21-Nov-1994.)
φ    &   ((φ ψ χ) → θ)       ((ψ χ) → θ)

Theoremmp3an2 1219 An inference based on modus ponens. (Contributed by NM, 21-Nov-1994.)
ψ    &   ((φ ψ χ) → θ)       ((φ χ) → θ)

Theoremmp3an3 1220 An inference based on modus ponens. (Contributed by NM, 21-Nov-1994.)
χ    &   ((φ ψ χ) → θ)       ((φ ψ) → θ)

Theoremmp3an12 1221 An inference based on modus ponens. (Contributed by NM, 13-Jul-2005.)
φ    &   ψ    &   ((φ ψ χ) → θ)       (χθ)

Theoremmp3an13 1222 An inference based on modus ponens. (Contributed by NM, 14-Jul-2005.)
φ    &   χ    &   ((φ ψ χ) → θ)       (ψθ)

Theoremmp3an23 1223 An inference based on modus ponens. (Contributed by NM, 14-Jul-2005.)
ψ    &   χ    &   ((φ ψ χ) → θ)       (φθ)

Theoremmp3an1i 1224 An inference based on modus ponens. (Contributed by NM, 5-Jul-2005.)
ψ    &   (φ → ((ψ χ θ) → τ))       (φ → ((χ θ) → τ))

Theoremmp3anl1 1225 An inference based on modus ponens. (Contributed by NM, 24-Feb-2005.)
φ    &   (((φ ψ χ) θ) → τ)       (((ψ χ) θ) → τ)

Theoremmp3anl2 1226 An inference based on modus ponens. (Contributed by NM, 24-Feb-2005.)
ψ    &   (((φ ψ χ) θ) → τ)       (((φ χ) θ) → τ)

Theoremmp3anl3 1227 An inference based on modus ponens. (Contributed by NM, 24-Feb-2005.)
χ    &   (((φ ψ χ) θ) → τ)       (((φ ψ) θ) → τ)

Theoremmp3anr1 1228 An inference based on modus ponens. (Contributed by NM, 4-Nov-2006.)
ψ    &   ((φ (ψ χ θ)) → τ)       ((φ (χ θ)) → τ)

Theoremmp3anr2 1229 An inference based on modus ponens. (Contributed by NM, 24-Nov-2006.)
χ    &   ((φ (ψ χ θ)) → τ)       ((φ (ψ θ)) → τ)

Theoremmp3anr3 1230 An inference based on modus ponens. (Contributed by NM, 19-Oct-2007.)
θ    &   ((φ (ψ χ θ)) → τ)       ((φ (ψ χ)) → τ)

Theoremmp3an 1231 An inference based on modus ponens. (Contributed by NM, 14-May-1999.)
φ    &   ψ    &   χ    &   ((φ ψ χ) → θ)       θ

Theoremmpd3an3 1232 An inference based on modus ponens. (Contributed by NM, 8-Nov-2007.)
((φ ψ) → χ)    &   ((φ ψ χ) → θ)       ((φ ψ) → θ)

Theoremmpd3an23 1233 An inference based on modus ponens. (Contributed by NM, 4-Dec-2006.)
(φψ)    &   (φχ)    &   ((φ ψ χ) → θ)       (φθ)

Theorembiimp3a 1234 Infer implication from a logical equivalence. Similar to biimpa 280. (Contributed by NM, 4-Sep-2005.)
((φ ψ) → (χθ))       ((φ ψ χ) → θ)

Theorembiimp3ar 1235 Infer implication from a logical equivalence. Similar to biimpar 281. (Contributed by NM, 2-Jan-2009.)
((φ ψ) → (χθ))       ((φ ψ θ) → χ)

Theorem3anandis 1236 Inference that undistributes a triple conjunction in the antecedent. (Contributed by NM, 18-Apr-2007.)
(((φ ψ) (φ χ) (φ θ)) → τ)       ((φ (ψ χ θ)) → τ)

Theorem3anandirs 1237 Inference that undistributes a triple conjunction in the antecedent. (Contributed by NM, 25-Jul-2006.) (Revised by NM, 18-Apr-2007.)
(((φ θ) (ψ θ) (χ θ)) → τ)       (((φ ψ χ) θ) → τ)

Theoremecased 1238 Deduction form of disjunctive syllogism. (Contributed by Jim Kingdon, 9-Dec-2017.)
(φ → ¬ χ)    &   (φ → (ψ χ))       (φψ)

Theoremecase23d 1239 Variation of ecased 1238 with three disjuncts instead of two. (Contributed by NM, 22-Apr-1994.) (Revised by Jim Kingdon, 9-Dec-2017.)
(φ → ¬ χ)    &   (φ → ¬ θ)    &   (φ → (ψ χ θ))       (φψ)

1.2.13  True and false constants

1.2.13.1  Universal quantifier for use by df-tru

Even though it isn't ordinarily part of propositional calculus, the universal quantifier is introduced here so that the soundness of definition df-tru 1245 can be checked by the same algorithm that is used for predicate calculus. Its first real use is in axiom ax-5 1333 in the predicate calculus section below. For those who want propositional calculus to be self-contained i.e. to use wff variables only, the alternate definition dftru2 1250 may be adopted and this subsection moved down to the start of the subsection with wex 1378 below. However, the use of dftru2 1250 as a definition requires a more elaborate definition checking algorithm that we prefer to avoid.

Syntaxwal 1240 Extend wff definition to include the universal quantifier ('for all'). xφ is read "φ (phi) is true for all x." Typically, in its final application φ would be replaced with a wff containing a (free) occurrence of the variable x, for example x = y. In a universe with a finite number of objects, "for all" is equivalent to a big conjunction (AND) with one wff for each possible case of x. When the universe is infinite (as with set theory), such a propositional-calculus equivalent is not possible because an infinitely long formula has no meaning, but conceptually the idea is the same.
wff xφ

1.2.13.2  Equality predicate for use by df-tru

Even though it isn't ordinarily part of propositional calculus, the equality predicate = is introduced here so that the soundness of definition df-tru 1245 can be checked by the same algorithm as is used for predicate calculus. Its first real use is in axiom ax-8 1392 in the predicate calculus section below. For those who want propositional calculus to be self-contained i.e. to use wff variables only, the alternate definition dftru2 1250 may be adopted and this subsection moved down to just above weq 1389 below. However, the use of dftru2 1250 as a definition requires a more elaborate definition checking algorithm that we prefer to avoid.

Syntaxcv 1241 This syntax construction states that a variable x, which has been declared to be a setvar variable by \$f statement vx, is also a class expression. This can be justified informally as follows. We know that the class builder {yy x} is a class by cab 2023. Since (when y is distinct from x) we have x = {yy x} by cvjust 2032, we can argue that the syntax "class x " can be viewed as an abbreviation for "class {yy x}". See the discussion under the definition of class in [Jech] p. 4 showing that "Every set can be considered to be a class."

While it is tempting and perhaps occasionally useful to view cv 1241 as a "type conversion" from a setvar variable to a class variable, keep in mind that cv 1241 is intrinsically no different from any other class-building syntax such as cab 2023, cun 2909, or c0 3218.

For a general discussion of the theory of classes and the role of cv 1241, see http://us.metamath.org/mpeuni/mmset.html#class.

(The description above applies to set theory, not predicate calculus. The purpose of introducing class x here, and not in set theory where it belongs, is to allow us to express i.e. "prove" the weq 1389 of predicate calculus from the wceq 1242 of set theory, so that we don't overload the = connective with two syntax definitions. This is done to prevent ambiguity that would complicate some Metamath parsers.)

class x

Syntaxwceq 1242 Extend wff definition to include class equality.

For a general discussion of the theory of classes, see http://us.metamath.org/mpeuni/mmset.html#class.

(The purpose of introducing wff A = B here, and not in set theory where it belongs, is to allow us to express i.e. "prove" the weq 1389 of predicate calculus in terms of the wceq 1242 of set theory, so that we don't "overload" the = connective with two syntax definitions. This is done to prevent ambiguity that would complicate some Metamath parsers. For example, some parsers - although not the Metamath program - stumble on the fact that the = in x = y could be the = of either weq 1389 or wceq 1242, although mathematically it makes no difference. The class variables A and B are introduced temporarily for the purpose of this definition but otherwise not used in predicate calculus. See df-cleq 2030 for more information on the set theory usage of wceq 1242.)

wff A = B

1.2.13.3  Define the true and false constants

Syntaxwtru 1243 is a wff.
wff

Theoremtrujust 1244 Soundness justification theorem for df-tru 1245. (Contributed by Mario Carneiro, 17-Nov-2013.) (Revised by NM, 11-Jul-2019.)
((x x = xx x = x) ↔ (y y = yy y = y))

Definitiondf-tru 1245 Definition of the truth value "true", or "verum", denoted by . This is a tautology, as proved by tru 1246. In this definition, an instance of id 19 is used as the definiens, although any tautology, such as an axiom, can be used in its place. This particular id 19 instance was chosen so this definition can be checked by the same algorithm that is used for predicate calculus. This definition should be referenced directly only by tru 1246, and other proofs should depend on tru 1246 (directly or indirectly) instead of this definition, since there are many alternative ways to define . (Contributed by Anthony Hart, 13-Oct-2010.) (Revised by NM, 11-Jul-2019.) (New usage is discouraged.)
( ⊤ ↔ (x x = xx x = x))

Theoremtru 1246 The truth value is provable. (Contributed by Anthony Hart, 13-Oct-2010.)

Syntaxwfal 1247 is a wff.
wff

Definitiondf-fal 1248 Definition of the truth value "false", or "falsum", denoted by . See also df-tru 1245. (Contributed by Anthony Hart, 22-Oct-2010.)
( ⊥ ↔ ¬ ⊤ )

Theoremfal 1249 The truth value is refutable. (Contributed by Anthony Hart, 22-Oct-2010.) (Proof shortened by Mel L. O'Cat, 11-Mar-2012.)
¬ ⊥

Theoremdftru2 1250 An alternate definition of "true". (Contributed by Anthony Hart, 13-Oct-2010.) (Revised by BJ, 12-Jul-2019.) (New usage is discouraged.)
( ⊤ ↔ (φφ))

Theoremtrud 1251 Eliminate as an antecedent. A proposition implied by is true. (Contributed by Mario Carneiro, 13-Mar-2014.)
( ⊤ → φ)       φ

Theoremtbtru 1252 A proposition is equivalent to itself being equivalent to . (Contributed by Anthony Hart, 14-Aug-2011.)
(φ ↔ (φ ↔ ⊤ ))

Theoremnbfal 1253 The negation of a proposition is equivalent to itself being equivalent to . (Contributed by Anthony Hart, 14-Aug-2011.)
φ ↔ (φ ↔ ⊥ ))

Theorembitru 1254 A theorem is equivalent to truth. (Contributed by Mario Carneiro, 9-May-2015.)
φ       (φ ↔ ⊤ )

Theorembifal 1255 A contradiction is equivalent to falsehood. (Contributed by Mario Carneiro, 9-May-2015.)
¬ φ       (φ ↔ ⊥ )

Theoremfalim 1256 The truth value implies anything. Also called the principle of explosion, or "ex falso quodlibet". (Contributed by FL, 20-Mar-2011.) (Proof shortened by Anthony Hart, 1-Aug-2011.)
( ⊥ → φ)

Theoremfalimd 1257 The truth value implies anything. (Contributed by Mario Carneiro, 9-Feb-2017.)
((φ ⊥ ) → ψ)

Theorema1tru 1258 Anything implies . (Contributed by FL, 20-Mar-2011.) (Proof shortened by Anthony Hart, 1-Aug-2011.)
(φ → ⊤ )

Theoremtruan 1259 True can be removed from a conjunction. (Contributed by FL, 20-Mar-2011.) (Proof shortened by Wolf Lammen, 21-Jul-2019.)
(( ⊤ φ) ↔ φ)

TheoremtruanOLD 1260 Obsolete proof of truan 1259 as of 21-Jul-2019. (Contributed by FL, 20-Mar-2011.) (Proof modification is discouraged.) (New usage is discouraged.)
(( ⊤ φ) ↔ φ)

Theoremdfnot 1261 Given falsum, we can define the negation of a wff φ as the statement that a contradiction follows from assuming φ. (Contributed by Mario Carneiro, 9-Feb-2017.) (Proof shortened by Wolf Lammen, 21-Jul-2019.)
φ ↔ (φ → ⊥ ))

Theoreminegd 1262 Negation introduction rule from natural deduction. (Contributed by Mario Carneiro, 9-Feb-2017.)
((φ ψ) → ⊥ )       (φ → ¬ ψ)

Theorempm2.21fal 1263 If a wff and its negation are provable, then falsum is provable. (Contributed by Mario Carneiro, 9-Feb-2017.)
(φψ)    &   (φ → ¬ ψ)       (φ → ⊥ )

Theorempclem6 1264 Negation inferred from embedded conjunct. (Contributed by NM, 20-Aug-1993.) (Proof rewritten by Jim Kingdon, 4-May-2018.)
((φ ↔ (ψ ¬ φ)) → ¬ ψ)

1.2.14  Logical 'xor'

Syntaxwxo 1265 Extend wff definition to include exclusive disjunction ('xor').
wff (φψ)

Definitiondf-xor 1266 Define exclusive disjunction (logical 'xor'). Return true if either the left or right, but not both, are true. Contrast with (wa 97), (wo 628), and (wi 4) . (Contributed by FL, 22-Nov-2010.) (Modified by Jim Kingdon, 1-Mar-2018.)
((φψ) ↔ ((φ ψ) ¬ (φ ψ)))

Theoremxoranor 1267 One way of defining exclusive or. Equivalent to df-xor 1266. (Contributed by Jim Kingdon and Mario Carneiro, 1-Mar-2018.)
((φψ) ↔ ((φ ψ) φ ¬ ψ)))

Theoremexcxor 1268 This tautology shows that xor is really exclusive. (Contributed by FL, 22-Nov-2010.) (Proof rewritten by Jim Kingdon, 5-May-2018.)
((φψ) ↔ ((φ ¬ ψ) φ ψ)))

Theoremxorbi2d 1269 Deduction joining an equivalence and a left operand to form equivalence of exclusive-or. (Contributed by Jim Kingdon, 7-Oct-2018.)
(φ → (ψχ))       (φ → ((θψ) ↔ (θχ)))

Theoremxorbi1d 1270 Deduction joining an equivalence and a right operand to form equivalence of exclusive-or. (Contributed by Jim Kingdon, 7-Oct-2018.)
(φ → (ψχ))       (φ → ((ψθ) ↔ (χθ)))

Theoremxorbi12d 1271 Deduction joining two equivalences to form equivalence of exclusive-or. (Contributed by Jim Kingdon, 7-Oct-2018.)
(φ → (ψχ))    &   (φ → (θτ))       (φ → ((ψθ) ↔ (χτ)))

Theoremxorbin 1272 A consequence of exclusive or. In classical logic the converse also holds. (Contributed by Jim Kingdon, 8-Mar-2018.)
((φψ) → (φ ↔ ¬ ψ))

Theorempm5.18im 1273 One direction of pm5.18dc 776, which holds for all propositions, not just decidable propositions. (Contributed by Jim Kingdon, 10-Mar-2018.)
((φψ) → ¬ (φ ↔ ¬ ψ))

Theoremxornbi 1274 A consequence of exclusive or. For decidable propositions this is an equivalence, as seen at xornbidc 1279. (Contributed by Jim Kingdon, 10-Mar-2018.)
((φψ) → ¬ (φψ))

Theoremxor3dc 1275 Two ways to express "exclusive or" between decidable propositions. (Contributed by Jim Kingdon, 12-Apr-2018.)
(DECID φ → (DECID ψ → (¬ (φψ) ↔ (φ ↔ ¬ ψ))))

Theoremxorcom 1276 is commutative. (Contributed by David A. Wheeler, 6-Oct-2018.)
((φψ) ↔ (ψφ))

Theorempm5.15dc 1277 A decidable proposition is equivalent to a decidable proposition or its negation. Based on theorem *5.15 of [WhiteheadRussell] p. 124. (Contributed by Jim Kingdon, 18-Apr-2018.)
(DECID φ → (DECID ψ → ((φψ) (φ ↔ ¬ ψ))))

Theoremxor2dc 1278 Two ways to express "exclusive or" between decidable propositions. (Contributed by Jim Kingdon, 17-Apr-2018.)
(DECID φ → (DECID ψ → (¬ (φψ) ↔ ((φ ψ) ¬ (φ ψ)))))

Theoremxornbidc 1279 Exclusive or is equivalent to negated biconditional for decidable propositions. (Contributed by Jim Kingdon, 27-Apr-2018.)
(DECID φ → (DECID ψ → ((φψ) ↔ ¬ (φψ))))

Theoremxordc 1280 Two ways to express "exclusive or" between decidable propositions. Theorem *5.22 of [WhiteheadRussell] p. 124, but for decidable propositions. (Contributed by Jim Kingdon, 5-May-2018.)
(DECID φ → (DECID ψ → (¬ (φψ) ↔ ((φ ¬ ψ) (ψ ¬ φ)))))

Theoremxordc1 1281 Exclusive or implies the left proposition is decidable. (Contributed by Jim Kingdon, 12-Mar-2018.)
((φψ) → DECID φ)

Theoremnbbndc 1282 Move negation outside of biconditional, for decidable propositions. Compare Theorem *5.18 of [WhiteheadRussell] p. 124. (Contributed by Jim Kingdon, 18-Apr-2018.)
(DECID φ → (DECID ψ → ((¬ φψ) ↔ ¬ (φψ))))

Theorembiassdc 1283 Associative law for the biconditional, for decidable propositions.

The classical version (without the decidability conditions) is an axiom of system DS in Vladimir Lifschitz, "On calculational proofs", Annals of Pure and Applied Logic, 113:207-224, 2002, http://www.cs.utexas.edu/users/ai-lab/pub-view.php?PubID=26805, and, interestingly, was not included in Principia Mathematica but was apparently first noted by Jan Lukasiewicz circa 1923. (Contributed by Jim Kingdon, 4-May-2018.)

(DECID φ → (DECID ψ → (DECID χ → (((φψ) ↔ χ) ↔ (φ ↔ (ψχ))))))

Theorembilukdc 1284 Lukasiewicz's shortest axiom for equivalential calculus (but modified to require decidable propositions). Storrs McCall, ed., Polish Logic 1920-1939 (Oxford, 1967), p. 96. (Contributed by Jim Kingdon, 5-May-2018.)
(((DECID φ DECID ψ) DECID χ) → ((φψ) ↔ ((χψ) ↔ (φχ))))

Theoremdfbi3dc 1285 An alternate definition of the biconditional for decidable propositions. Theorem *5.23 of [WhiteheadRussell] p. 124, but with decidability conditions. (Contributed by Jim Kingdon, 5-May-2018.)
(DECID φ → (DECID ψ → ((φψ) ↔ ((φ ψ) φ ¬ ψ)))))

Theorempm5.24dc 1286 Theorem *5.24 of [WhiteheadRussell] p. 124, but for decidable propositions. (Contributed by Jim Kingdon, 5-May-2018.)
(DECID φ → (DECID ψ → (¬ ((φ ψ) φ ¬ ψ)) ↔ ((φ ¬ ψ) (ψ ¬ φ)))))

Theoremxordidc 1287 Conjunction distributes over exclusive-or, for decidable propositions. This is one way to interpret the distributive law of multiplication over addition in modulo 2 arithmetic. (Contributed by Jim Kingdon, 14-Jul-2018.)
(DECID φ → (DECID ψ → (DECID χ → ((φ (ψχ)) ↔ ((φ ψ) ⊻ (φ χ))))))

Theoremanxordi 1288 Conjunction distributes over exclusive-or. (Contributed by Mario Carneiro and Jim Kingdon, 7-Oct-2018.)
((φ (ψχ)) ↔ ((φ ψ) ⊻ (φ χ)))

1.2.15  Truth tables: Operations on true and false constants

For classical logic, truth tables can be used to define propositional logic operations, by showing the results of those operations for all possible combinations of true () and false ().

Although the intuitionistic logic connectives are not as simply defined, and do play similar roles as in classical logic and most theorems from classical logic continue to hold.

Here we show that our definitions and axioms produce equivalent results for and as we would get from truth tables for (conjunction aka logical 'and') wa 97, (disjunction aka logical inclusive 'or') wo 628, (implies) wi 4, ¬ (not) wn 3, (logical equivalence) df-bi 110, and (exclusive or) df-xor 1266.

Theoremtruantru 1289 A identity. (Contributed by Anthony Hart, 22-Oct-2010.)
(( ⊤ ⊤ ) ↔ ⊤ )

Theoremtruanfal 1290 A identity. (Contributed by Anthony Hart, 22-Oct-2010.)
(( ⊤ ⊥ ) ↔ ⊥ )

Theoremfalantru 1291 A identity. (Contributed by David A. Wheeler, 23-Feb-2018.)
(( ⊥ ⊤ ) ↔ ⊥ )

Theoremfalanfal 1292 A identity. (Contributed by Anthony Hart, 22-Oct-2010.)
(( ⊥ ⊥ ) ↔ ⊥ )

Theoremtruortru 1293 A identity. (Contributed by Anthony Hart, 22-Oct-2010.) (Proof shortened by Andrew Salmon, 13-May-2011.)
(( ⊤ ⊤ ) ↔ ⊤ )

Theoremtruorfal 1294 A identity. (Contributed by Anthony Hart, 22-Oct-2010.)
(( ⊤ ⊥ ) ↔ ⊤ )

Theoremfalortru 1295 A identity. (Contributed by Anthony Hart, 22-Oct-2010.)
(( ⊥ ⊤ ) ↔ ⊤ )

Theoremfalorfal 1296 A identity. (Contributed by Anthony Hart, 22-Oct-2010.) (Proof shortened by Andrew Salmon, 13-May-2011.)
(( ⊥ ⊥ ) ↔ ⊥ )

Theoremtruimtru 1297 A identity. (Contributed by Anthony Hart, 22-Oct-2010.)
(( ⊤ → ⊤ ) ↔ ⊤ )

Theoremtruimfal 1298 A identity. (Contributed by Anthony Hart, 22-Oct-2010.) (Proof shortened by Andrew Salmon, 13-May-2011.)
(( ⊤ → ⊥ ) ↔ ⊥ )

Theoremfalimtru 1299 A identity. (Contributed by Anthony Hart, 22-Oct-2010.)
(( ⊥ → ⊤ ) ↔ ⊤ )

Theoremfalimfal 1300 A identity. (Contributed by Anthony Hart, 22-Oct-2010.)
(( ⊥ → ⊥ ) ↔ ⊤ )

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 >