[Lattice L46-7]Home PageHome Quantum Logic Explorer
Theorem List (p. 9 of 13)
< Previous  Next >
Browser slow? Try the
Unicode version.

Mirrors  >  Metamath Home Page  >  QLE Home Page  >  Theorem List Contents       This page: Page List

Theorem List for Quantum Logic Explorer - 801-900   *Has distinct variable group(s)
TypeLabelDescription
Statement
 
Theoremi1abs 801 An absorption law for ->1.
((a ->1 b)' v (a ^ b)) = a
 
Theoremtest 802 Part of an attempt to crack a potential Kalmbach axiom.
(((c v (a' v b')) ^ (c' ^ (c v (a ^ b)))) v ((c' ^ (a ^ b)) v (c ^ (c' v (a ^ b))))) = ((c v (a ^ b)) ^ (c' v (a ^ b)))
 
Theoremtest2 803 Part of an attempt to crack a potential Kalmbach axiom.
(a v b) =< ((a == b)' v ((c v (a ^ b)) ^ (c' v (a ^ b))))
 
0.3.9  Some 3-variable theorems
 
Theorem3vth1 804 A 3-variable theorem. Equivalent to OML.
((a ->2 b) ^ (b v c)') =< (a ->2 c)
 
Theorem3vth2 805 A 3-variable theorem. Equivalent to OML.
((a ->2 b) ^ (b v c)') = ((a ->2 c) ^ (b v c)')
 
Theorem3vth3 806 A 3-variable theorem. Equivalent to OML.
((a ->2 c) v ((a ->2 b) ^ (b v c)')) = (a ->2 c)
 
Theorem3vth4 807 A 3-variable theorem.
((a ->2 b)' ->2 (b v c)) = ((a ->2 c)' ->2 (b v c))
 
Theorem3vth5 808 A 3-variable theorem.
((a ->2 b)' ->2 (b v c)) = (c v ((a ->2 b) ^ (c ->2 b)))
 
Theorem3vth6 809 A 3-variable theorem.
((a ->2 b)' ->2 (b v c)) = (((a ->2 b) ^ (c ->2 b)) v ((a ->2 c) ^ (b ->2 c)))
 
Theorem3vth7 810 A 3-variable theorem.
((a ->2 b)' ->2 (b v c)) = (a ->2 (b v c))
 
Theorem3vth8 811 A 3-variable theorem.
(a ->2 (b v c)) = (((a ->2 b) ^ (c ->2 b)) v ((a ->2 c) ^ (b ->2 c)))
 
Theorem3vth9 812 A 3-variable theorem.
((a v b) ->1 (c ->2 b)) = ((b v c) ->2 (a ->2 b))
 
Theorem3vcom 813 3-variable commutation theorem.
((a ->1 c) v (b ->1 c)) C ((a' ->1 c) ^ (b' ->1 c))
 
Theorem3vded11 814 A 3-variable theorem. Experiment with weak deduction theorem.
b =< (c ->1 (b ->1 a))   =>   c =< (b ->1 a)
 
Theorem3vded12 815 A 3-variable theorem. Experiment with weak deduction theorem.
(a ^ (c ->1 a)) =< (c ->1 (b ->1 a))   &   c =< a   =>   c =< (b ->1 a)
 
Theorem3vded13 816 A 3-variable theorem. Experiment with weak deduction theorem.
(b ^ (c ->1 a)) =< (c ->1 (b ->1 a))   &   c =< a   =>   c =< (b ->1 a)
 
Theorem3vded21 817 A 3-variable theorem. Experiment with weak deduction theorem.
c =< ((a ->0 b) ->0 (c ->2 b))   &   c =< (a ->0 b)   =>   c =< b
 
Theorem3vded22 818 A 3-variable theorem. Experiment with weak deduction theorem.
c =< ( C (a, b) v C (c, b))   &   c =< a   &   c =< (a ->0 b)   =>   c =< b
 
Theorem3vded3 819 A 3-variable theorem. Experiment with weak deduction theorem.
(c ->0 C (a, c)) = 1   &   (c ->0 a) = 1   &   (c ->0 (a ->0 b)) = 1   =>   (c ->0 b) = 1
 
Theorem1oa 820 Orthoarguesian-like law with ->1 instead of ->0 but true in all OMLs.
((a ->2 b) ^ ((b v c) ->1 ((a ->2 b) ^ (a ->2 c)))) =< (a ->2 c)
 
Theorem1oai1 821 Orthoarguesian-like OM law.
((a ->1 c) ^ ((a ^ b)' ->1 ((a ->1 c) ^ (b ->1 c)))) =< (b ->1 c)
 
Theorem2oai1u 822 Orthoarguesian-like OM law.
((a ->1 c) ^ (((a ->1 c) ^ (b ->1 c))' ->2 ((a' ->1 c) ^ (b' ->1 c)))) =< (b ->1 c)
 
Theorem1oaiii 823 OML analog to orthoarguesian law of Godowski/Greechie, Eq. III with ->1 instead of ->0.
((a ->2 b) ^ ((b v c) ->1 ((a ->2 b) ^ (a ->2 c)))) = ((a ->2 c) ^ ((b v c) ->1 ((a ->2 b) ^ (a ->2 c))))
 
Theorem1oaii 824 OML analog to orthoarguesian law of Godowski/Greechie, Eq. II with ->1 instead of ->0.
(b' ^ ((a ->2 b) v ((a ->2 c) ^ ((b v c) ->1 ((a ->2 b) ^ (a ->2 c)))))) =< a'
 
Theorem2oalem1 825 Lemma for OA-like stuff with ->2 instead of ->0.
((a ->2 b)' v ((b v c) v ((a ->2 b) ^ (a ->2 c)))) = 1
 
Theorem2oath1 826 OA-like theorem with ->2 instead of ->0.
((a ->2 b) ^ ((b v c) ->2 ((a ->2 b) ^ (a ->2 c)))) = ((a ->2 b) ^ (a ->2 c))
 
Theorem2oath1i1 827 Orthoarguesian-like OM law.
((a ->1 c) ^ ((a ^ b)' ->2 ((a ->1 c) ^ (b ->1 c)))) = ((a ->1 c) ^ (b ->1 c))
 
Theorem1oath1i1u 828 Orthoarguesian-like OM law.
((a ->1 c) ^ (((a ->1 c) ^ (b ->1 c))' ->1 ((a' ->1 c) ^ (b' ->1 c)))) = ((a ->1 c) ^ (b ->1 c))
 
Theoremoale 829 Relation for studying OA.
((a ->2 b) ^ ((b v c) v ((a ->2 b) ^ (a ->2 c)))') =< (a ->2 c)
 
Theoremoaeqv 830 Weakened OA implies OA).
((a ->2 b) ^ ((b v c)' v ((a ->2 b) ^ (a ->2 c)))) =< ((b v c) ->2 ((a ->2 b) ^ (a ->2 c)))   =>   ((a ->2 b) ^ ((b v c)' v ((a ->2 b) ^ (a ->2 c)))) =< (a ->2 c)
 
Theorem3vroa 831 OA-like inference rule (requires OM only).
((a ->2 b) ^ ((b v c) ->0 ((a ->2 b) ^ (a ->2 c)))) = 1   =>   (a ->2 c) = 1
 
Theoremmlalem 832 Lemma for Mladen's OML.
((a == b) ^ (b ->1 c)) =< (a ->1 c)
 
Theoremmlaoml 833 Mladen's OML.
((a == b) ^ (b == c)) =< (a == c)
 
Theoremeqtr4 834 4-variable transitive law for equivalence.
(((a == b) ^ (b == c)) ^ (c == d)) =< (a == d)
 
Theoremsac 835 Theorem showing "Sasaki complement" is an operation.
(a ->1 c) = (b ->1 c)   =>   (a' ->1 c) = (b' ->1 c)
 
Theoremsa5 836 Possible axiom for a "Sasaki algebra" for orthoarguesian lattices.
(a ->1 c) =< (b ->1 c)   =>   (b' ->1 c) =< ((a' ->1 c) v c)
 
Theoremsalem1 837 Lemma for attempt at Sasaki algebra.
(((a' ->1 b) v b) ->1 b) = (a ->2 b)
 
Theoremsadm3 838 Weak DeMorgan's law for attempt at Sasaki algebra.
(((a' ->1 c) ^ (b' ->1 c)) ->1 c) =< ((a ->1 c) v (b ->1 c))
 
Theorembi3 839 Chained biconditional.
((a == b) ^ (b == c)) = (((a ^ b) ^ c) v ((a' ^ b') ^ c'))
 
Theorembi4 840 Chained biconditional.
(((a == b) ^ (b == c)) ^ (c == d)) = ((((a ^ b) ^ c) ^ d) v (((a' ^ b') ^ c') ^ d'))
 
Theoremimp3 841 Implicational product with 3 variables. Theorem 3.20 of "Equations, states, and lattices..." paper.
((a ->2 b) ^ (b ->1 c)) = ((a' ^ b') v (b ^ c))
 
Theoremorbi 842 Disjunction of biconditionals.
((a == c) v (b == c)) = (((a ->2 c) v (b ->2 c)) ^ ((c ->1 a) v (c ->1 b)))
 
Theoremorbile 843 Disjunction of biconditionals.
((a == c) v (b == c)) =< (((a ^ b) ->2 c) ^ (c ->1 (a v b)))
 
Theoremmlaconj4 844 For 4GO proof of Mladen's conjecture, that it follows from Eq. (3.30) in OA-GO paper.
((d == e) ^ ((e' ^ c') v (d ^ c))) =< (d == c)   &   d = (a v b)   &   e = (a ^ b)   =>   ((a == b) ^ ((a == c) v (b == c))) =< (a == c)
 
Theoremmlaconj 845 For 5GO proof of Mladen's conjecture.
((a == b) ^ ((a == c) v (b == c))) =< ((((a ->1 (a ^ b)) ^ ((a ^ b) ->1 ((a ^ b) v c))) ^ ((((a ^ b) v c) ->1 c) ^ (c ->1 (a v b)))) ^ ((a v b) ->1 a))
 
Theoremmlaconj2 846 For 5GO proof of Mladen's conjecture. Hypothesis is 5GO law consequence.
((((a ->1 (a ^ b)) ^ ((a ^ b) ->1 ((a ^ b) v c))) ^ ((((a ^ b) v c) ->1 c) ^ (c ->1 (a v b)))) ^ ((a v b) ->1 a)) =< (a == c)   =>   ((a == b) ^ ((a == c) v (b == c))) =< (a == c)
 
Theoremi1orni1 847 Complemented antecedent lemma.
((a ->1 b) v (a' ->1 b)) = 1
 
Theoremnegantlem1 848 Lemma for negated antecedent identity.
(a ->1 c) = (b ->1 c)   =>   a C (b ->1 c)
 
Theoremnegantlem2 849 Lemma for negated antecedent identity.
(a ->1 c) = (b ->1 c)   =>   a =< (b' ->1 c)
 
Theoremnegantlem3 850 Lemma for negated antecedent identity.
(a ->1 c) = (b ->1 c)   =>   (a' ^ c) =< (b' ->1 c)
 
Theoremnegantlem4 851 Lemma for negated antecedent identity.
(a ->1 c) = (b ->1 c)   =>   (a' ->1 c) =< (b' ->1 c)
 
Theoremnegant 852 Negated antecedent identity.
(a ->1 c) = (b ->1 c)   =>   (a' ->1 c) = (b' ->1 c)
 
Theoremnegantlem5 853 Negated antecedent identity.
(a ->1 c) = (b ->1 c)   =>   (a' ^ c') = (b' ^ c')
 
Theoremnegantlem6 854 Negated antecedent identity.
(a ->1 c) = (b ->1 c)   =>   (a ^ c') = (b ^ c')
 
Theoremnegantlem7 855 Negated antecedent identity.
(a ->1 c) = (b ->1 c)   =>   (a v c) = (b v c)
 
Theoremnegantlem8 856 Negated antecedent identity.
(a ->1 c) = (b ->1 c)   =>   (a' v c) = (b' v c)
 
Theoremnegant0 857 Negated antecedent identity.
(a ->1 c) = (b ->1 c)   =>   (a' ->0 c) = (b' ->0 c)
 
Theoremnegant2 858 Negated antecedent identity.
(a ->1 c) = (b ->1 c)   =>   (a' ->2 c) = (b' ->2 c)
 
Theoremnegantlem9 859 Negated antecedent identity.
(a ->1 c) = (b ->1 c)   =>   (a ->3 c) =< (b ->3 c)
 
Theoremnegant3 860 Negated antecedent identity.
(a ->1 c) = (b ->1 c)   =>   (a' ->3 c) = (b' ->3 c)
 
Theoremnegantlem10 861 Lemma for negated antecedent identity.
(a ->1 c) = (b ->1 c)   =>   (a ->4 c) =< (b ->4 c)
 
Theoremnegant4 862 Negated antecedent identity.
(a ->1 c) = (b ->1 c)   =>   (a' ->4 c) = (b' ->4 c)
 
Theoremnegant5 863 Negated antecedent identity.
(a ->1 c) = (b ->1 c)   =>   (a' ->5 c) = (b' ->5 c)
 
Theoremneg3antlem1 864 Lemma for negated antecedent identity.
(a ->3 c) = (b ->3 c)   =>   (a ^ c) =< (b ->1 c)
 
Theoremneg3antlem2 865 Lemma for negated antecedent identity.
(a ->3 c) = (b ->3 c)   =>   a' =< (b ->1 c)
 
Theoremneg3ant1 866 Lemma for negated antecedent identity.
(a ->3 c) = (b ->3 c)   =>   (a ->1 c) = (b ->1 c)
 
Theoremelimconslem 867 Lemma for consequent elimination law.
(a ->1 c) = (b ->1 c)   &   (a ^ c) =< (b v c')   =>   a =< (b v c')
 
Theoremelimcons 868 Consequent elimination law.
(a ->1 c) = (b ->1 c)   &   (a ^ c) =< (b v c')   =>   a =< b
 
Theoremelimcons2 869 Consequent elimination law.
(a ->1 c) = (b ->1 c)   &   (a ^ (c ^ (b ->1 c))) =< (b v (c' v (a ->1 c)'))   =>   a =< b
 
Theoremcomanblem1 870 Lemma for biconditional commutation law.
((a == c) ^ (b == c)) = (((a v c)' v ((a ^ b) ^ c)) ^ (b ->1 c))
 
Theoremcomanblem2 871 Lemma for biconditional commutation law.
((a ^ b) ^ ((a == c) ^ (b == c))) = ((a ^ b) ^ c)
 
Theoremcomanb 872 Biconditional commutation law.
(a ^ b) C ((a == c) ^ (b == c))
 
Theoremcomanbn 873 Biconditional commutation law.
(a' ^ b') C ((a == c) ^ (b == c))
 
Theoremmhlemlem1 874 Lemma for Lemma 7.1 of Kalmbach, p. 91.
(a v b) =< (c v d)'   =>   (((a v b) v c) ^ (a v (c v d))) = (a v c)
 
Theoremmhlemlem2 875 Lemma for Lemma 7.1 of Kalmbach, p. 91.
(a v b) =< (c v d)'   =>   (((a v b) v d) ^ (b v (c v d))) = (b v d)
 
Theoremmhlem 876 Lemma 7.1 of Kalmbach, p. 91.
(a v b) =< (c v d)'   =>   ((a v c) ^ (b v d)) = ((a ^ b) v (c ^ d))
 
Theoremmhlem1 877 Lemma for Marsden-Herman distributive law.
a C b   &   c C b   =>   ((a v b) ^ (b' v c)) = ((a ^ b') v (b ^ c))
 
Theoremmhlem2 878 Lemma for Marsden-Herman distributive law.
a C c   &   a C d   &   b C c   &   b C d   =>   (((a v c) ^ (c' v b')) ^ ((b v d) ^ (a' v d'))) = (((a ^ c') ^ (b ^ d')) v ((c ^ b') ^ (d ^ a')))
 
Theoremmh 879 Marsden-Herman distributive law. Lemma 7.2 of Kalmbach, p. 91.
a C c   &   a C d   &   b C c   &   b C d   =>   ((a v c) ^ (b v d)) = (((a ^ b) v (a ^ d)) v ((c ^ b) v (c ^ d)))
 
Theoremmarsdenlem1 880 Lemma for Marsden-Herman distributive law.
a C b   &   b C c   &   c C d   &   d C a   =>   ((a v b) ^ (a' v d')) = ((a' ^ (a v b)) v (d' ^ (a v b)))
 
Theoremmarsdenlem2 881 Lemma for Marsden-Herman distributive law.
a C b   &   b C c   &   c C d   &   d C a   =>   ((c v d) ^ (b' v c')) = (((b' ^ c) v (c' ^ d)) v (b' ^ d))
 
Theoremmarsdenlem3 882 Lemma for Marsden-Herman distributive law.
a C b   &   b C c   &   c C d   &   d C a   =>   (((b' ^ c) v (c' ^ d)) ^ (b ^ d')) = 0
 
Theoremmarsdenlem4 883 Lemma for Marsden-Herman distributive law.
a C b   &   b C c   &   c C d   &   d C a   =>   (((a' ^ b) v (a ^ d')) ^ (b' ^ d)) = 0
 
Theoremmh2 884 Marsden-Herman distributive law. Corollary 3.3 of Beran, p. 259.
a C b   &   b C c   &   c C d   &   d C a   =>   ((a v b) ^ (c v d)) = (((a ^ c) v (a ^ d)) v ((b ^ c) v (b ^ d)))
 
Theoremmlaconjolem 885 Lemma for OML proof of Mladen's conjecture,
((a == c) v (b == c)) =< ((c ^ (a v b)) v (c' ^ (a' v b')))
 
Theoremmlaconjo 886 OML proof of Mladen's conjecture.
((a == b) ^ ((a == c) v (b == c))) =< (a == c)
 
Theoremdistid 887 Distributive law for identity.
((a == b) ^ ((a == c) v (b == c))) = (((a == b) ^ (a == c)) v ((a == b) ^ (b == c)))
 
Theoremmhcor1 888 Corollary of Marsden-Herman Lemma.
((((a ->1 b) ^ (b ->2 c)) ^ (c ->1 d)) ^ (d ->2 a)) = (((a == b) ^ (b == c)) ^ (c == d))
 
Theoremoago3.29 889 Equation (3.29) of "Equations, states, and lattices..." paper. This shows that it holds in all OMLs, not just 4GO.
((a ->1 b) ^ ((b ->2 c) ^ (c ->1 a))) =< (a == c)
 
Theoremoago3.21x 890 4-variable extension of Equation (3.21) of "Equations, states, and lattices..." paper. This shows that it holds in all OMLs, not just 4GO.
((((a ->5 b) ^ (b ->5 c)) ^ (c ->5 d)) ^ (d ->5 a)) = (((a == b) ^ (b == c)) ^ (c == d))
 
Theoremcancellem 891 Lemma for cancellation law eliminating ->1 consequent.
((d v (a ->1 c)) ->1 c) = ((d v (b ->1 c)) ->1 c)   =>   (d v (a ->1 c)) =< (d v (b ->1 c))
 
Theoremcancel 892 Cancellation law eliminating ->1 consequent.
((d v (a ->1 c)) ->1 c) = ((d v (b ->1 c)) ->1 c)   =>   (d v (a ->1 c)) = (d v (b ->1 c))
 
Theoremkb10iii 893 Exercise 10(iii) of Kalmbach p. 30 (in a rewritten form).
b' =< (a ->1 c)   =>   c' =< (a ->1 b)
 
Theoreme2ast2 894 Show that the E*2 derivative on p. 23 of Mayet, "Equations holding in Hilbert lattices" IJTP 2006, holds in all OMLs.
a =< b'   &   c =< d'   &   a =< c'   =>   ((a v b) ^ (c v d)) =< ((b v d) v (a v c)')
 
Theoreme2astlem1 895 Lemma towards a possible proof that E*2 on p. 23 of Mayet, "Equations holding in Hilbert lattices" IJTP 2006, holds in all OMLs.
a =< b'   &   c =< d'   &   r =< a'   &   a =< c'   &   c =< r'   =>   (((a v b) ^ (c v d)) ^ ((a v c) v r)) = ((a v (b ^ (c v r))) ^ (c v (d ^ (a v r))))
 
0.3.10  OML Lemmas for studying Godowski equations.
 
Theoremgovar 896 Lemma for converting n-variable Godowski equations to 2n-variable equations.
a =< b'   &   b =< c'   =>   ((a v b) ^ (a ->2 c)) =< (b v c)
 
Theoremgovar2 897 Lemma for converting n-variable to 2n-variable Godowski equations.
a =< b'   &   b =< c'   =>   (a v b) =< (c ->2 a)
 
Theoremgon2n 898 Lemma for converting n-variable to 2n-variable Godowski equations.
a =< b'   &   b =< c'   &   ((c ->2 a) ^ d) =< (a ->2 c)   &   e =< d   =>   ((a v b) ^ e) =< (b v c)
 
Theoremgo2n4 899 8-variable Godowski equation derived from 4-variable one. The last hypothesis is the 4-variable Godowski equation.
a =< b'   &   b =< c'   &   c =< d'   &   d =< e'   &   e =< f'   &   f =< g'   &   g =< h'   &   h =< a'   &   (((c ->2 a) ^ (a ->2 g)) ^ ((g ->2 e) ^ (e ->2 c))) =< (a ->2 c)   =>   (((a v b) ^ (c v d)) ^ ((e v f) ^ (g v h))) =< (b v c)
 
Theoremgomaex4 900 Proof of Mayet Example 4 from 4-variable Godowski equation. R. Mayet, "Equational bases for some varieties of orthomodular lattices related to states," Algebra Universalis 23 (1986), 167-195.
a =< b'   &   b =< c'   &   c =< d'   &   d =< e'   &   e =< f'   &   f =< g'   &   g =< h'   &   h =< a'   &   (((a ->2 g) ^ (g ->2 e)) ^ ((e ->2 c) ^ (c ->2 a))) =< (g ->2 a)   &   (((e ->2 c) ^ (c ->2 a)) ^ ((a ->2 g) ^ (g ->2 e))) =< (c ->2 e)   =>   ((((a v b) ^ (c v d)) ^ ((e v f) ^ (g v h))) ^ ((a v h) ->1 (d v e)')) = 0
    < 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-800801-900 10 901-1000 11 1001-1100 12 1101-1200 13 1201-1215
  Copyright terms: Public domain < Previous  Next >