P. 10 of Theorem List - Quantum Logic Explorer

Home	Quantum Logic Explorer Theorem List (p. 10 of 13)	< Previous Next >
		Bad symbols? Try the GIF version.
Mirrors > Metamath Home Page > QLE Home Page > Theorem List Contents This page: Page List

**Theorem List for Quantum Logic Explorer -** 901-1000 *Has distinct variable group(s)
Type	Label	Description
Statement

Theorem	go2n6 901	12-variable Godowski equation derived from 6-variable one. The last hypothesis is the 6-variable Godowski equation.
g ≤ h^⊥ & h ≤ i^⊥ & i ≤ j^⊥ & j ≤ k^⊥ & k ≤ m^⊥ & m ≤ n^⊥ & n ≤ u^⊥ & u ≤ w^⊥ & w ≤ x^⊥ & x ≤ y^⊥ & y ≤ z^⊥ & z ≤ g^⊥ & (((i →₂g) ∩ (g →₂y)) ∩ (((y →₂w) ∩ (w →₂n)) ∩ ((n →₂k) ∩ (k →₂i)))) ≤ (g →₂i) ⇒ (((g ∪ h) ∩ (i ∪ j)) ∩ (((k ∪ m) ∩ (n ∪ u)) ∩ ((w ∪ x) ∩ (y ∪ z)))) ≤ (h ∪ i)

Theorem	gomaex3h1 902	Hypothesis for Godowski 6-var -> Mayet Example 3.
a ≤ b^⊥ & g = a & h = b ⇒ g ≤ h^⊥

Theorem	gomaex3h2 903	Hypothesis for Godowski 6-var -> Mayet Example 3.
b ≤ c^⊥ & h = b & i = c ⇒ h ≤ i^⊥

Theorem	gomaex3h3 904	Hypothesis for Godowski 6-var -> Mayet Example 3.
i = c & j = (c ∪ d)^⊥ ⇒ i ≤ j^⊥

Theorem	gomaex3h4 905	Hypothesis for Godowski 6-var -> Mayet Example 3.
r = ((p^⊥ →₁q)^⊥ ∩ (c ∪ d)) & j = (c ∪ d)^⊥ & k = r ⇒ j ≤ k^⊥

Theorem	gomaex3h5 906	Hypothesis for Godowski 6-var -> Mayet Example 3.
r = ((p^⊥ →₁q)^⊥ ∩ (c ∪ d)) & k = r & m = (p^⊥ →₁q) ⇒ k ≤ m^⊥

Theorem	gomaex3h6 907	Hypothesis for Godowski 6-var -> Mayet Example 3.
m = (p^⊥ →₁q) & n = (p^⊥ →₁q)^⊥ ⇒ m ≤ n^⊥

Theorem	gomaex3h7 908	Hypothesis for Godowski 6-var -> Mayet Example 3.
n = (p^⊥ →₁q)^⊥ & u = (p^⊥ ∩ q) ⇒ n ≤ u^⊥

Theorem	gomaex3h8 909	Hypothesis for Godowski 6-var -> Mayet Example 3.
u = (p^⊥ ∩ q) & w = q^⊥ ⇒ u ≤ w^⊥

Theorem	gomaex3h9 910	Hypothesis for Godowski 6-var -> Mayet Example 3.
w = q^⊥ & x = q ⇒ w ≤ x^⊥

Theorem	gomaex3h10 911	Hypothesis for Godowski 6-var -> Mayet Example 3.
q = ((e ∪ f) →₁(b ∪ c)^⊥ )^⊥ & x = q & y = (e ∪ f)^⊥ ⇒ x ≤ y^⊥

Theorem	gomaex3h11 912	Hypothesis for Godowski 6-var -> Mayet Example 3.
y = (e ∪ f)^⊥ & z = f ⇒ y ≤ z^⊥

Theorem	gomaex3h12 913	Hypothesis for Godowski 6-var -> Mayet Example 3.
f ≤ a^⊥ & g = a & z = f ⇒ z ≤ g^⊥

Theorem	gomaex3lem1 914	Lemma for Godowski 6-var -> Mayet Example 3.
c ≤ d^⊥ ⇒ (c ∪ (c ∪ d)^⊥ ) = d^⊥

Theorem	gomaex3lem2 915	Lemma for Godowski 6-var -> Mayet Example 3.
e ≤ f^⊥ ⇒ ((e ∪ f)^⊥ ∪ f) = e^⊥

Theorem	gomaex3lem3 916	Lemma for Godowski 6-var -> Mayet Example 3.
((p^⊥ →₁q)^⊥ ∪ (p^⊥ ∩ q)) = p^⊥

Theorem	gomaex3lem4 917	Lemma for Godowski 6-var -> Mayet Example 3.
p = ((a ∪ b) →₁(d ∪ e)^⊥ )^⊥ ⇒ ((a ∪ b) ∩ (d ∪ e)^⊥ ) ≤ p^⊥

Theorem	gomaex3lem5 918	Lemma for Godowski 6-var -> Mayet Example 3.
a ≤ b^⊥ & b ≤ c^⊥ & c ≤ d^⊥ & e ≤ f^⊥ & f ≤ a^⊥ & (((i →₂g) ∩ (g →₂y)) ∩ (((y →₂w) ∩ (w →₂n)) ∩ ((n →₂k) ∩ (k →₂i)))) ≤ (g →₂i) & p = ((a ∪ b) →₁(d ∪ e)^⊥ )^⊥ & q = ((e ∪ f) →₁(b ∪ c)^⊥ )^⊥ & r = ((p^⊥ →₁q)^⊥ ∩ (c ∪ d)) & g = a & h = b & i = c & j = (c ∪ d)^⊥ & k = r & m = (p^⊥ →₁q) & n = (p^⊥ →₁q)^⊥ & u = (p^⊥ ∩ q) & w = q^⊥ & x = q & y = (e ∪ f)^⊥ & z = f ⇒ (((g ∪ h) ∩ (i ∪ j)) ∩ (((k ∪ m) ∩ (n ∪ u)) ∩ ((w ∪ x) ∩ (y ∪ z)))) ≤ (h ∪ i)

Theorem	gomaex3lem6 919	Lemma for Godowski 6-var -> Mayet Example 3.
a ≤ b^⊥ & b ≤ c^⊥ & c ≤ d^⊥ & e ≤ f^⊥ & f ≤ a^⊥ & (((i →₂g) ∩ (g →₂y)) ∩ (((y →₂w) ∩ (w →₂n)) ∩ ((n →₂k) ∩ (k →₂i)))) ≤ (g →₂i) & p = ((a ∪ b) →₁(d ∪ e)^⊥ )^⊥ & q = ((e ∪ f) →₁(b ∪ c)^⊥ )^⊥ & r = ((p^⊥ →₁q)^⊥ ∩ (c ∪ d)) & g = a & h = b & i = c & j = (c ∪ d)^⊥ & k = r & m = (p^⊥ →₁q) & n = (p^⊥ →₁q)^⊥ & u = (p^⊥ ∩ q) & w = q^⊥ & x = q & y = (e ∪ f)^⊥ & z = f ⇒ (((a ∪ b) ∩ (c ∪ (c ∪ d)^⊥ )) ∩ (((r ∪ (p^⊥ →₁q)) ∩ ((p^⊥ →₁q)^⊥ ∪ (p^⊥ ∩ q))) ∩ ((q^⊥ ∪ q) ∩ ((e ∪ f)^⊥ ∪ f)))) ≤ (b ∪ c)

Theorem	gomaex3lem7 920	Lemma for Godowski 6-var -> Mayet Example 3.
a ≤ b^⊥ & b ≤ c^⊥ & c ≤ d^⊥ & e ≤ f^⊥ & f ≤ a^⊥ & (((i →₂g) ∩ (g →₂y)) ∩ (((y →₂w) ∩ (w →₂n)) ∩ ((n →₂k) ∩ (k →₂i)))) ≤ (g →₂i) & p = ((a ∪ b) →₁(d ∪ e)^⊥ )^⊥ & q = ((e ∪ f) →₁(b ∪ c)^⊥ )^⊥ & r = ((p^⊥ →₁q)^⊥ ∩ (c ∪ d)) & g = a & h = b & i = c & j = (c ∪ d)^⊥ & k = r & m = (p^⊥ →₁q) & n = (p^⊥ →₁q)^⊥ & u = (p^⊥ ∩ q) & w = q^⊥ & x = q & y = (e ∪ f)^⊥ & z = f ⇒ (((a ∪ b) ∩ d^⊥ ) ∩ (((r ∪ (p^⊥ →₁q)) ∩ p^⊥ ) ∩ e^⊥ )) ≤ (b ∪ c)

Theorem	gomaex3lem8 921	Lemma for Godowski 6-var -> Mayet Example 3.
a ≤ b^⊥ & b ≤ c^⊥ & c ≤ d^⊥ & e ≤ f^⊥ & f ≤ a^⊥ & (((i →₂g) ∩ (g →₂y)) ∩ (((y →₂w) ∩ (w →₂n)) ∩ ((n →₂k) ∩ (k →₂i)))) ≤ (g →₂i) & p = ((a ∪ b) →₁(d ∪ e)^⊥ )^⊥ & q = ((e ∪ f) →₁(b ∪ c)^⊥ )^⊥ & r = ((p^⊥ →₁q)^⊥ ∩ (c ∪ d)) & g = a & h = b & i = c & j = (c ∪ d)^⊥ & k = r & m = (p^⊥ →₁q) & n = (p^⊥ →₁q)^⊥ & u = (p^⊥ ∩ q) & w = q^⊥ & x = q & y = (e ∪ f)^⊥ & z = f ⇒ (((a ∪ b) ∩ (d ∪ e)^⊥ ) ∩ ((r ∪ (p^⊥ →₁q)) ∩ p^⊥ )) ≤ (b ∪ c)

Theorem	gomaex3lem9 922	Lemma for Godowski 6-var -> Mayet Example 3.
a ≤ b^⊥ & b ≤ c^⊥ & c ≤ d^⊥ & e ≤ f^⊥ & f ≤ a^⊥ & (((i →₂g) ∩ (g →₂y)) ∩ (((y →₂w) ∩ (w →₂n)) ∩ ((n →₂k) ∩ (k →₂i)))) ≤ (g →₂i) & p = ((a ∪ b) →₁(d ∪ e)^⊥ )^⊥ & q = ((e ∪ f) →₁(b ∪ c)^⊥ )^⊥ & r = ((p^⊥ →₁q)^⊥ ∩ (c ∪ d)) & g = a & h = b & i = c & j = (c ∪ d)^⊥ & k = r & m = (p^⊥ →₁q) & n = (p^⊥ →₁q)^⊥ & u = (p^⊥ ∩ q) & w = q^⊥ & x = q & y = (e ∪ f)^⊥ & z = f ⇒ (((a ∪ b) ∩ (d ∪ e)^⊥ ) ∩ (r ∪ (p^⊥ →₁q))) ≤ (b ∪ c)

Theorem	gomaex3lem10 923	Lemma for Godowski 6-var -> Mayet Example 3.
a ≤ b^⊥ & b ≤ c^⊥ & c ≤ d^⊥ & e ≤ f^⊥ & f ≤ a^⊥ & (((i →₂g) ∩ (g →₂y)) ∩ (((y →₂w) ∩ (w →₂n)) ∩ ((n →₂k) ∩ (k →₂i)))) ≤ (g →₂i) & p = ((a ∪ b) →₁(d ∪ e)^⊥ )^⊥ & q = ((e ∪ f) →₁(b ∪ c)^⊥ )^⊥ & r = ((p^⊥ →₁q)^⊥ ∩ (c ∪ d)) & g = a & h = b & i = c & j = (c ∪ d)^⊥ & k = r & m = (p^⊥ →₁q) & n = (p^⊥ →₁q)^⊥ & u = (p^⊥ ∩ q) & w = q^⊥ & x = q & y = (e ∪ f)^⊥ & z = f ⇒ (((a ∪ b) ∩ (d ∪ e)^⊥ ) ∩ (r ∪ (p^⊥ →₁q))) ≤ ((b ∪ c) ∪ (e ∪ f)^⊥ )

Theorem	gomaex3 924	Proof of Mayet Example 3 from 6-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^⊥ & e ≤ f^⊥ & f ≤ a^⊥ & (((i →₂g) ∩ (g →₂y)) ∩ (((y →₂w) ∩ (w →₂n)) ∩ ((n →₂k) ∩ (k →₂i)))) ≤ (g →₂i) & p = ((a ∪ b) →₁(d ∪ e)^⊥ )^⊥ & q = ((e ∪ f) →₁(b ∪ c)^⊥ )^⊥ & r = ((p^⊥ →₁q)^⊥ ∩ (c ∪ d)) & g = a & i = c & k = r & n = (p^⊥ →₁q)^⊥ & w = q^⊥ & y = (e ∪ f)^⊥ ⇒ (((a ∪ b) ∩ (d ∪ e)^⊥ ) ∩ ((((a ∪ b) →₁(d ∪ e)^⊥ ) →₁((e ∪ f) →₁(b ∪ c)^⊥ )^⊥ )^⊥ →₁(c ∪ d))) ≤ ((b ∪ c) ∪ (e ∪ f)^⊥ )

0.3.11 OML Lemmas for studying orthoarguesian laws

Theorem	oas 925	"Strengthening" lemma for studying the orthoarguesian law.
(a^⊥ ∩ (a ∪ b)) ≤ c ⇒ ((a →₁c) ∩ (a ∪ b)) ≤ c

Theorem	oasr 926	Reverse of oas 925 lemma for studying the orthoarguesian law.
((a →₁c) ∩ (a ∪ b)) ≤ c ⇒ (a^⊥ ∩ (a ∪ b)) ≤ c

Theorem	oat 927	Transformation lemma for studying the orthoarguesian law.
(a^⊥ ∩ (a ∪ b)) ≤ c ⇒ b ≤ (a^⊥ →₁c)

Theorem	oatr 928	Reverse transformation lemma for studying the orthoarguesian law.
b ≤ (a^⊥ →₁c) ⇒ (a^⊥ ∩ (a ∪ b)) ≤ c

Theorem	oau 929	Transformation lemma for studying the orthoarguesian law.
(a ∩ ((a →₁c) ∪ b)) ≤ c ⇒ b ≤ (a →₁c)

Theorem	oaur 930	Transformation lemma for studying the orthoarguesian law.
b ≤ (a →₁c) ⇒ (a ∩ ((a →₁c) ∪ b)) ≤ c

Theorem	oaidlem2 931	Lemma for identity-like OA law.
((d ∪ ((a →₁c) ∩ (b →₁c)))^⊥ ∪ ((a →₁c) →₁(b →₁c))) = 1 ⇒ ((a →₁c) ∩ (d ∪ ((a →₁c) ∩ (b →₁c)))) ≤ (b →₁c)

Theorem	oaidlem2g 932	Lemma for identity-like OA law (generalized).
((c ∪ (a ∩ b))^⊥ ∪ (a →₁b)) = 1 ⇒ (a ∩ (c ∪ (a ∩ b))) ≤ b

Theorem	oa6v4v 933	6-variable OA to 4-variable OA.
(((a ∪ b) ∩ (c ∪ d)) ∩ (e ∪ f)) ≤ (b ∪ (a ∩ (c ∪ (((a ∪ c) ∩ (b ∪ d)) ∩ (((a ∪ e) ∩ (b ∪ f)) ∪ ((c ∪ e) ∩ (d ∪ f))))))) & e = 0 & f = 1 ⇒ ((a ∪ b) ∩ (c ∪ d)) ≤ (b ∪ (a ∩ (c ∪ ((a ∪ c) ∩ (b ∪ d)))))

Theorem	oa4v3v 934	4-variable OA to 3-variable OA (Godowski/Greechie Eq. IV).
d ≤ b^⊥ & e ≤ c^⊥ & ((d ∪ b) ∩ (e ∪ c)) ≤ (b ∪ (d ∩ (e ∪ ((d ∪ e) ∩ (b ∪ c))))) & d = (a →₂b)^⊥ & e = (a →₂c)^⊥ ⇒ (b^⊥ ∩ ((a →₂b) ∪ ((a →₂c) ∩ ((b ∪ c)^⊥ ∪ ((a →₂b) ∩ (a →₂c)))))) ≤ ((b^⊥ ∩ (a →₂b)) ∪ (c^⊥ ∩ (a →₂c)))

Theorem	oal42 935	Derivation of Godowski/Greechie Eq. II from Eq. IV.
(b^⊥ ∩ ((a →₂b) ∪ ((a →₂c) ∩ ((b ∪ c)^⊥ ∪ ((a →₂b) ∩ (a →₂c)))))) ≤ ((b^⊥ ∩ (a →₂b)) ∪ (c^⊥ ∩ (a →₂c))) ⇒ (b^⊥ ∩ ((a →₂b) ∪ ((a →₂c) ∩ ((b ∪ c)^⊥ ∪ ((a →₂b) ∩ (a →₂c)))))) ≤ a^⊥

Theorem	oa23 936	Derivation of OA from Godowski/Greechie Eq. II.
(c^⊥ ∩ ((a →₂c) ∪ ((a →₂b) ∩ ((c ∪ b)^⊥ ∪ ((a →₂c) ∩ (a →₂b)))))) ≤ a^⊥ ⇒ ((a →₂b) ∩ ((b ∪ c)^⊥ ∪ ((a →₂b) ∩ (a →₂c)))) ≤ (a →₂c)

Theorem	oa4lem1 937	Lemma for 3-var to 4-var OA.
a ≤ b^⊥ & c ≤ d^⊥ ⇒ (a ∪ b) ≤ ((a ∪ c)^⊥ →₂b)

Theorem	oa4lem2 938	Lemma for 3-var to 4-var OA.
a ≤ b^⊥ & c ≤ d^⊥ ⇒ (c ∪ d) ≤ ((a ∪ c)^⊥ →₂d)

Theorem	oa4lem3 939	Lemma for 3-var to 4-var OA.
a ≤ b^⊥ & c ≤ d^⊥ ⇒ ((a ∪ b) ∩ (c ∪ d)) ≤ ((b ∪ d)^⊥ ∪ (((a ∪ c)^⊥ →₂b) ∩ ((a ∪ c)^⊥ →₂d)))

Theorem	distoah1 940	Satisfaction of distributive law hypothesis.
d = (a →₂b) & e = ((b ∪ c) →₁((a →₂b) ∩ (a →₂c))) & f = ((b ∪ c) →₂((a →₂b) ∩ (a →₂c))) ⇒ d ≤ (a →₂b)

Theorem	distoah2 941	Satisfaction of distributive law hypothesis.
d = (a →₂b) & e = ((b ∪ c) →₁((a →₂b) ∩ (a →₂c))) & f = ((b ∪ c) →₂((a →₂b) ∩ (a →₂c))) ⇒ e ≤ ((b ∪ c) →₀((a →₂b) ∩ (a →₂c)))

Theorem	distoah3 942	Satisfaction of distributive law hypothesis.
d = (a →₂b) & e = ((b ∪ c) →₁((a →₂b) ∩ (a →₂c))) & f = ((b ∪ c) →₂((a →₂b) ∩ (a →₂c))) ⇒ f ≤ ((b ∪ c) →₀((a →₂b) ∩ (a →₂c)))

Theorem	distoah4 943	Satisfaction of distributive law hypothesis.
d = (a →₂b) & e = ((b ∪ c) →₁((a →₂b) ∩ (a →₂c))) & f = ((b ∪ c) →₂((a →₂b) ∩ (a →₂c))) ⇒ (d ∩ (a →₂c)) ≤ f

Theorem	distoa 944	Derivation in OM of OA, assuming OA distributive law oadistd 1023.
d = (a →₂b) & e = ((b ∪ c) →₁((a →₂b) ∩ (a →₂c))) & f = ((b ∪ c) →₂((a →₂b) ∩ (a →₂c))) & (d ∩ (e ∪ f)) = ((d ∩ e) ∪ (d ∩ f)) ⇒ ((a →₂b) ∩ ((b ∪ c)^⊥ ∪ ((a →₂b) ∩ (a →₂c)))) ≤ (a →₂c)

Theorem	oa3to4lem1 945	Lemma for orthoarguesian law (Godowski/Greechie 3-variable to 4-variable proof).
a^⊥ ≤ b & c^⊥ ≤ d & g = ((a ∩ b) ∪ (c ∩ d)) ⇒ b ≤ (a →₁g)

Theorem	oa3to4lem2 946	Lemma for orthoarguesian law (Godowski/Greechie 3-variable to 4-variable proof).
a^⊥ ≤ b & c^⊥ ≤ d & g = ((a ∩ b) ∪ (c ∩ d)) ⇒ d ≤ (c →₁g)

Theorem	oa3to4lem3 947	Lemma for orthoarguesian law (Godowski/Greechie 3-variable to 4-variable proof).
a^⊥ ≤ b & c^⊥ ≤ d & g = ((a ∩ b) ∪ (c ∩ d)) ⇒ (a ∩ (b ∪ (d ∩ ((a ∩ c) ∪ (b ∩ d))))) ≤ (a ∩ ((a →₁g) ∪ ((c →₁g) ∩ ((a ∩ c) ∪ ((a →₁g) ∩ (c →₁g))))))

Theorem	oa3to4lem4 948	Lemma for orthoarguesian law (Godowski/Greechie 3-variable to 4-variable proof).
a^⊥ ≤ b & c^⊥ ≤ d & g = ((a ∩ b) ∪ (c ∩ d)) & (a ∩ ((a →₁g) ∪ ((c →₁g) ∩ ((a ∩ c) ∪ ((a →₁g) ∩ (c →₁g)))))) ≤ ((a ∩ g) ∪ (c ∩ g)) ⇒ (a ∩ (b ∪ (d ∩ ((a ∩ c) ∪ (b ∩ d))))) ≤ g

Theorem	oa3to4lem5 949	Lemma for orthoarguesian law (Godowski/Greechie 3-variable to 4-variable proof).
((a ∪ b) ∩ (c ∪ d)) ≤ (a ∪ (b ∩ (d ∪ ((a ∪ c) ∩ (b ∪ d))))) ⇒ ((b ∪ a) ∩ (d ∪ c)) ≤ (a ∪ (b ∩ (d ∪ ((b ∪ d) ∩ (a ∪ c)))))

Theorem	oa3to4lem6 950	Orthoarguesian law (Godowski/Greechie 3-variable to 4-variable). The first 2 hypotheses are those for 4-OA. The next 3 are variable substitutions into 3-OA. The last is the 3-OA. The proof uses OM logic only.
a ≤ b^⊥ & c ≤ d^⊥ & g = ((a^⊥ ∩ b^⊥ ) ∪ (c^⊥ ∩ d^⊥ )) & e = a^⊥ & f = c^⊥ & (e ∩ ((e →₁g) ∪ ((f →₁g) ∩ ((e ∩ f) ∪ ((e →₁g) ∩ (f →₁g)))))) ≤ ((e ∩ g) ∪ (f ∩ g)) ⇒ ((a ∪ b) ∩ (c ∪ d)) ≤ (a ∪ (b ∩ (d ∪ ((a ∪ c) ∩ (b ∪ d)))))

Theorem	oa3to4 951	Orthoarguesian law (Godowski/Greechie 3-variable to 4-variable). The first 2 hypotheses are those for 4-OA. The next 3 are variable substitutions into 3-OA. The last is the 3-OA. The proof uses OM logic only.
a ≤ b^⊥ & c ≤ d^⊥ & g = ((b^⊥ ∩ a^⊥ ) ∪ (d^⊥ ∩ c^⊥ )) & e = b^⊥ & f = d^⊥ & (e ∩ ((e →₁g) ∪ ((f →₁g) ∩ ((e ∩ f) ∪ ((e →₁g) ∩ (f →₁g)))))) ≤ ((e ∩ g) ∪ (f ∩ g)) ⇒ ((a ∪ b) ∩ (c ∪ d)) ≤ (b ∪ (a ∩ (c ∪ ((a ∪ c) ∩ (b ∪ d)))))

Theorem	oa6todual 952	Conventional to dual 6-variable OA law.
(((a^⊥ ∪ b^⊥ ) ∩ (c^⊥ ∪ d^⊥ )) ∩ (e^⊥ ∪ f^⊥ )) ≤ (b^⊥ ∪ (a^⊥ ∩ (c^⊥ ∪ (((a^⊥ ∪ c^⊥ ) ∩ (b^⊥ ∪ d^⊥ )) ∩ (((a^⊥ ∪ e^⊥ ) ∩ (b^⊥ ∪ f^⊥ )) ∪ ((c^⊥ ∪ e^⊥ ) ∩ (d^⊥ ∪ f^⊥ ))))))) ⇒ (b ∩ (a ∪ (c ∩ (((a ∩ c) ∪ (b ∩ d)) ∪ (((a ∩ e) ∪ (b ∩ f)) ∩ ((c ∩ e) ∪ (d ∩ f))))))) ≤ (((a ∩ b) ∪ (c ∩ d)) ∪ (e ∩ f))

Theorem	oa6fromdual 953	Dual to conventional 6-variable OA law.
(b^⊥ ∩ (a^⊥ ∪ (c^⊥ ∩ (((a^⊥ ∩ c^⊥ ) ∪ (b^⊥ ∩ d^⊥ )) ∪ (((a^⊥ ∩ e^⊥ ) ∪ (b^⊥ ∩ f^⊥ )) ∩ ((c^⊥ ∩ e^⊥ ) ∪ (d^⊥ ∩ f^⊥ ))))))) ≤ (((a^⊥ ∩ b^⊥ ) ∪ (c^⊥ ∩ d^⊥ )) ∪ (e^⊥ ∩ f^⊥ )) ⇒ (((a ∪ b) ∩ (c ∪ d)) ∩ (e ∪ f)) ≤ (b ∪ (a ∩ (c ∪ (((a ∪ c) ∩ (b ∪ d)) ∩ (((a ∪ e) ∩ (b ∪ f)) ∪ ((c ∪ e) ∩ (d ∪ f)))))))

Theorem	oa6fromdualn 954	Dual to conventional 6-variable OA law.
(b ∩ (a ∪ (c ∩ (((a ∩ c) ∪ (b ∩ d)) ∪ (((a ∩ e) ∪ (b ∩ f)) ∩ ((c ∩ e) ∪ (d ∩ f))))))) ≤ (((a ∩ b) ∪ (c ∩ d)) ∪ (e ∩ f)) ⇒ (((a^⊥ ∪ b^⊥ ) ∩ (c^⊥ ∪ d^⊥ )) ∩ (e^⊥ ∪ f^⊥ )) ≤ (b^⊥ ∪ (a^⊥ ∩ (c^⊥ ∪ (((a^⊥ ∪ c^⊥ ) ∩ (b^⊥ ∪ d^⊥ )) ∩ (((a^⊥ ∪ e^⊥ ) ∩ (b^⊥ ∪ f^⊥ )) ∪ ((c^⊥ ∪ e^⊥ ) ∩ (d^⊥ ∪ f^⊥ )))))))

Theorem	oa6to4h1 955	Satisfaction of 6-variable OA law hypothesis.
b^⊥ = (a →₁g)^⊥ & d^⊥ = (c →₁g)^⊥ & f^⊥ = (e →₁g)^⊥ ⇒ a^⊥ ≤ b^⊥ ^⊥

Theorem	oa6to4h2 956	Satisfaction of 6-variable OA law hypothesis.
b^⊥ = (a →₁g)^⊥ & d^⊥ = (c →₁g)^⊥ & f^⊥ = (e →₁g)^⊥ ⇒ c^⊥ ≤ d^⊥ ^⊥

Theorem	oa6to4h3 957	Satisfaction of 6-variable OA law hypothesis.
b^⊥ = (a →₁g)^⊥ & d^⊥ = (c →₁g)^⊥ & f^⊥ = (e →₁g)^⊥ ⇒ e^⊥ ≤ f^⊥ ^⊥

Theorem	oa6to4 958	Derivation of 4-variable proper OA law, assuming 6-variable OA law.
b^⊥ = (a →₁g)^⊥ & d^⊥ = (c →₁g)^⊥ & f^⊥ = (e →₁g)^⊥ & (((a^⊥ ∪ b^⊥ ) ∩ (c^⊥ ∪ d^⊥ )) ∩ (e^⊥ ∪ f^⊥ )) ≤ (b^⊥ ∪ (a^⊥ ∩ (c^⊥ ∪ (((a^⊥ ∪ c^⊥ ) ∩ (b^⊥ ∪ d^⊥ )) ∩ (((a^⊥ ∪ e^⊥ ) ∩ (b^⊥ ∪ f^⊥ )) ∪ ((c^⊥ ∪ e^⊥ ) ∩ (d^⊥ ∪ f^⊥ ))))))) ⇒ ((a →₁g) ∩ (a ∪ (c ∩ (((a ∩ c) ∪ ((a →₁g) ∩ (c →₁g))) ∪ (((a ∩ e) ∪ ((a →₁g) ∩ (e →₁g))) ∩ ((c ∩ e) ∪ ((c →₁g) ∩ (e →₁g)))))))) ≤ (((a ∩ g) ∪ (c ∩ g)) ∪ (e ∩ g))

Theorem	oa4b 959	Derivation of 4-OA law variant.
((a →₁g) ∩ (a ∪ (c ∩ (((a ∩ c) ∪ ((a →₁g) ∩ (c →₁g))) ∪ (((a ∩ e) ∪ ((a →₁g) ∩ (e →₁g))) ∩ ((c ∩ e) ∪ ((c →₁g) ∩ (e →₁g)))))))) ≤ (((a ∩ g) ∪ (c ∩ g)) ∪ (e ∩ g)) ⇒ ((a →₁g) ∩ (a ∪ (c ∩ (((a ∩ c) ∪ ((a →₁g) ∩ (c →₁g))) ∪ (((a ∩ e) ∪ ((a →₁g) ∩ (e →₁g))) ∩ ((c ∩ e) ∪ ((c →₁g) ∩ (e →₁g)))))))) ≤ g

Theorem	oa4to6lem1 960	Lemma for orthoarguesian law (4-variable to 6-variable proof).
a^⊥ ≤ b & c^⊥ ≤ d & e^⊥ ≤ f & g = (((a ∩ b) ∪ (c ∩ d)) ∪ (e ∩ f)) ⇒ b ≤ (a →₁g)

Theorem	oa4to6lem2 961	Lemma for orthoarguesian law (4-variable to 6-variable proof).
a^⊥ ≤ b & c^⊥ ≤ d & e^⊥ ≤ f & g = (((a ∩ b) ∪ (c ∩ d)) ∪ (e ∩ f)) ⇒ d ≤ (c →₁g)

Theorem	oa4to6lem3 962	Lemma for orthoarguesian law (4-variable to 6-variable proof).
a^⊥ ≤ b & c^⊥ ≤ d & e^⊥ ≤ f & g = (((a ∩ b) ∪ (c ∩ d)) ∪ (e ∩ f)) ⇒ f ≤ (e →₁g)

Theorem	oa4to6lem4 963	Lemma for orthoarguesian law (4-variable to 6-variable proof).
a^⊥ ≤ b & c^⊥ ≤ d & e^⊥ ≤ f & g = (((a ∩ b) ∪ (c ∩ d)) ∪ (e ∩ f)) ⇒ (b ∩ (a ∪ (c ∩ (((a ∩ c) ∪ (b ∩ d)) ∪ (((a ∩ e) ∪ (b ∩ f)) ∩ ((c ∩ e) ∪ (d ∩ f))))))) ≤ ((a →₁g) ∩ (a ∪ (c ∩ (((a ∩ c) ∪ ((a →₁g) ∩ (c →₁g))) ∪ (((a ∩ e) ∪ ((a →₁g) ∩ (e →₁g))) ∩ ((c ∩ e) ∪ ((c →₁g) ∩ (e →₁g))))))))

Theorem	oa4to6dual 964	Lemma for orthoarguesian law (4-variable to 6-variable proof).
a^⊥ ≤ b & c^⊥ ≤ d & e^⊥ ≤ f & g = (((a ∩ b) ∪ (c ∩ d)) ∪ (e ∩ f)) & ((a →₁g) ∩ (a ∪ (c ∩ (((a ∩ c) ∪ ((a →₁g) ∩ (c →₁g))) ∪ (((a ∩ e) ∪ ((a →₁g) ∩ (e →₁g))) ∩ ((c ∩ e) ∪ ((c →₁g) ∩ (e →₁g)))))))) ≤ g ⇒ (b ∩ (a ∪ (c ∩ (((a ∩ c) ∪ (b ∩ d)) ∪ (((a ∩ e) ∪ (b ∩ f)) ∩ ((c ∩ e) ∪ (d ∩ f))))))) ≤ g

Theorem	oa4to6 965	Orthoarguesian law (4-variable to 6-variable proof). The first 3 hypotheses are those for 6-OA. The next 4 are variable substitutions into 4-OA. The last is the 4-OA. The proof uses OM logic only.
a ≤ b^⊥ & c ≤ d^⊥ & e ≤ f^⊥ & g = (((a^⊥ ∩ b^⊥ ) ∪ (c^⊥ ∩ d^⊥ )) ∪ (e^⊥ ∩ f^⊥ )) & h = a^⊥ & j = c^⊥ & k = e^⊥ & ((h →₁g) ∩ (h ∪ (j ∩ (((h ∩ j) ∪ ((h →₁g) ∩ (j →₁g))) ∪ (((h ∩ k) ∪ ((h →₁g) ∩ (k →₁g))) ∩ ((j ∩ k) ∪ ((j →₁g) ∩ (k →₁g)))))))) ≤ g ⇒ (((a ∪ b) ∩ (c ∪ d)) ∩ (e ∪ f)) ≤ (b ∪ (a ∩ (c ∪ (((a ∪ c) ∩ (b ∪ d)) ∩ (((a ∪ e) ∩ (b ∪ f)) ∪ ((c ∪ e) ∩ (d ∪ f)))))))

Theorem	oa4btoc 966	Derivation of 4-OA law variant.
((a →₁g) ∩ (a ∪ (c ∩ (((a ∩ c) ∪ ((a →₁g) ∩ (c →₁g))) ∪ (((a ∩ e) ∪ ((a →₁g) ∩ (e →₁g))) ∩ ((c ∩ e) ∪ ((c →₁g) ∩ (e →₁g)))))))) ≤ g ⇒ (a^⊥ ∩ (a ∪ (c ∩ (((a ∩ c) ∪ ((a →₁g) ∩ (c →₁g))) ∪ (((a ∩ e) ∪ ((a →₁g) ∩ (e →₁g))) ∩ ((c ∩ e) ∪ ((c →₁g) ∩ (e →₁g)))))))) ≤ g

Theorem	oa4ctob 967	Derivation of 4-OA law variant.
(a^⊥ ∩ (a ∪ (c ∩ (((a ∩ c) ∪ ((a →₁g) ∩ (c →₁g))) ∪ (((a ∩ e) ∪ ((a →₁g) ∩ (e →₁g))) ∩ ((c ∩ e) ∪ ((c →₁g) ∩ (e →₁g)))))))) ≤ g ⇒ ((a →₁g) ∩ (a ∪ (c ∩ (((a ∩ c) ∪ ((a →₁g) ∩ (c →₁g))) ∪ (((a ∩ e) ∪ ((a →₁g) ∩ (e →₁g))) ∩ ((c ∩ e) ∪ ((c →₁g) ∩ (e →₁g)))))))) ≤ g

Theorem	oa4ctod 968	Derivation of 4-OA law variant.
(a^⊥ ∩ (a ∪ (b ∩ (((a ∩ b) ∪ ((a →₁d) ∩ (b →₁d))) ∪ (((a ∩ c) ∪ ((a →₁d) ∩ (c →₁d))) ∩ ((b ∩ c) ∪ ((b →₁d) ∩ (c →₁d)))))))) ≤ d ⇒ (b ∩ (((a ∩ b) ∪ ((a →₁d) ∩ (b →₁d))) ∪ (((a ∩ c) ∪ ((a →₁d) ∩ (c →₁d))) ∩ ((b ∩ c) ∪ ((b →₁d) ∩ (c →₁d)))))) ≤ (a^⊥ →₁d)

Theorem	oa4dtoc 969	Derivation of 4-OA law variant.
(b ∩ (((a ∩ b) ∪ ((a →₁d) ∩ (b →₁d))) ∪ (((a ∩ c) ∪ ((a →₁d) ∩ (c →₁d))) ∩ ((b ∩ c) ∪ ((b →₁d) ∩ (c →₁d)))))) ≤ (a^⊥ →₁d) ⇒ (a^⊥ ∩ (a ∪ (b ∩ (((a ∩ b) ∪ ((a →₁d) ∩ (b →₁d))) ∪ (((a ∩ c) ∪ ((a →₁d) ∩ (c →₁d))) ∩ ((b ∩ c) ∪ ((b →₁d) ∩ (c →₁d)))))))) ≤ d

Theorem	oa4dcom 970	Lemma commuting terms.
(b ∩ (((a ∩ b) ∪ ((a →₁d) ∩ (b →₁d))) ∪ (((a ∩ c) ∪ ((a →₁d) ∩ (c →₁d))) ∩ ((b ∩ c) ∪ ((b →₁d) ∩ (c →₁d)))))) = (b ∩ (((b ∩ a) ∪ ((b →₁d) ∩ (a →₁d))) ∪ (((b ∩ c) ∪ ((b →₁d) ∩ (c →₁d))) ∩ ((a ∩ c) ∪ ((a →₁d) ∩ (c →₁d))))))

0.3.12 5OA law

Theorem	oa8todual 971	Conventional to dual 8-variable OA law.
(((a^⊥ ∪ b^⊥ ) ∩ (c^⊥ ∪ d^⊥ )) ∩ ((e^⊥ ∪ f^⊥ ) ∩ (g^⊥ ∪ h^⊥ ))) ≤ (b^⊥ ∪ (a^⊥ ∩ (c^⊥ ∪ ((((a^⊥ ∪ c^⊥ ) ∩ (b^⊥ ∪ d^⊥ )) ∩ (((a^⊥ ∪ g^⊥ ) ∩ (b^⊥ ∪ h^⊥ )) ∪ ((c^⊥ ∪ g^⊥ ) ∩ (d^⊥ ∪ h^⊥ )))) ∩ ((((a^⊥ ∪ e^⊥ ) ∩ (b^⊥ ∪ f^⊥ )) ∩ (((a^⊥ ∪ g^⊥ ) ∩ (b^⊥ ∪ h^⊥ )) ∪ ((e^⊥ ∪ g^⊥ ) ∩ (f^⊥ ∪ h^⊥ )))) ∪ (((c^⊥ ∪ e^⊥ ) ∩ (d^⊥ ∪ f^⊥ )) ∩ (((c^⊥ ∪ g^⊥ ) ∩ (d^⊥ ∪ h^⊥ )) ∪ ((e^⊥ ∪ g^⊥ ) ∩ (f^⊥ ∪ h^⊥ ))))))))) ⇒ (b ∩ (a ∪ (c ∩ ((((a ∩ c) ∪ (b ∩ d)) ∪ (((a ∩ g) ∪ (b ∩ h)) ∩ ((c ∩ g) ∪ (d ∩ h)))) ∪ ((((a ∩ e) ∪ (b ∩ f)) ∪ (((a ∩ g) ∪ (b ∩ h)) ∩ ((e ∩ g) ∪ (f ∩ h)))) ∩ (((c ∩ e) ∪ (d ∩ f)) ∪ (((c ∩ g) ∪ (d ∩ h)) ∩ ((e ∩ g) ∪ (f ∩ h))))))))) ≤ (((a ∩ b) ∪ (c ∩ d)) ∪ ((e ∩ f) ∪ (g ∩ h)))

Theorem	oa8to5 972	Orthoarguesian law 5OA converted from 8 to 5 variables.
(((a^⊥ ∪ b^⊥ ) ∩ (c^⊥ ∪ d^⊥ )) ∩ ((e^⊥ ∪ f^⊥ ) ∩ (g^⊥ ∪ h^⊥ ))) ≤ (b^⊥ ∪ (a^⊥ ∩ (c^⊥ ∪ ((((a^⊥ ∪ c^⊥ ) ∩ (b^⊥ ∪ d^⊥ )) ∩ (((a^⊥ ∪ g^⊥ ) ∩ (b^⊥ ∪ h^⊥ )) ∪ ((c^⊥ ∪ g^⊥ ) ∩ (d^⊥ ∪ h^⊥ )))) ∩ ((((a^⊥ ∪ e^⊥ ) ∩ (b^⊥ ∪ f^⊥ )) ∩ (((a^⊥ ∪ g^⊥ ) ∩ (b^⊥ ∪ h^⊥ )) ∪ ((e^⊥ ∪ g^⊥ ) ∩ (f^⊥ ∪ h^⊥ )))) ∪ (((c^⊥ ∪ e^⊥ ) ∩ (d^⊥ ∪ f^⊥ )) ∩ (((c^⊥ ∪ g^⊥ ) ∩ (d^⊥ ∪ h^⊥ )) ∪ ((e^⊥ ∪ g^⊥ ) ∩ (f^⊥ ∪ h^⊥ ))))))))) & b^⊥ = (a →₁j)^⊥ & d^⊥ = (c →₁j)^⊥ & f^⊥ = (e →₁j)^⊥ & h^⊥ = (g →₁j)^⊥ ⇒ ((a →₁j) ∩ (a ∪ (c ∩ ((((a ∩ c) ∪ ((a →₁j) ∩ (c →₁j))) ∪ (((a ∩ g) ∪ ((a →₁j) ∩ (g →₁j))) ∩ ((c ∩ g) ∪ ((c →₁j) ∩ (g →₁j))))) ∪ ((((a ∩ e) ∪ ((a →₁j) ∩ (e →₁j))) ∪ (((a ∩ g) ∪ ((a →₁j) ∩ (g →₁j))) ∩ ((e ∩ g) ∪ ((e →₁j) ∩ (g →₁j))))) ∩ (((c ∩ e) ∪ ((c →₁j) ∩ (e →₁j))) ∪ (((c ∩ g) ∪ ((c →₁j) ∩ (g →₁j))) ∩ ((e ∩ g) ∪ ((e →₁j) ∩ (g →₁j)))))))))) ≤ (((a ∩ j) ∪ (c ∩ j)) ∪ ((e ∩ j) ∪ (g ∩ j)))

0.3.13 "Godowski/Greechie" form of proper 4-OA

Theorem	oa4to4u 973	A "universal" 4-OA. The hypotheses are the standard proper 4-OA and substitutions into it.
((e →₁d) ∩ (e ∪ (f ∩ (((e ∩ f) ∪ ((e →₁d) ∩ (f →₁d))) ∪ (((e ∩ g) ∪ ((e →₁d) ∩ (g →₁d))) ∩ ((f ∩ g) ∪ ((f →₁d) ∩ (g →₁d)))))))) ≤ (((e ∩ d) ∪ (f ∩ d)) ∪ (g ∩ d)) & e = (a^⊥ →₁d) & f = (b^⊥ →₁d) & g = (c^⊥ →₁d) ⇒ ((a →₁d) ∩ ((a^⊥ →₁d) ∪ ((b^⊥ →₁d) ∩ ((((a →₁d) ∩ (b →₁d)) ∪ ((a^⊥ →₁d) ∩ (b^⊥ →₁d))) ∪ ((((a →₁d) ∩ (c →₁d)) ∪ ((a^⊥ →₁d) ∩ (c^⊥ →₁d))) ∩ (((b →₁d) ∩ (c →₁d)) ∪ ((b^⊥ →₁d) ∩ (c^⊥ →₁d)))))))) ≤ ((((a →₁d) ∩ (a^⊥ →₁d)) ∪ ((b →₁d) ∩ (b^⊥ →₁d))) ∪ ((c →₁d) ∩ (c^⊥ →₁d)))

Theorem	oa4to4u2 974	A weaker-looking "universal" proper 4-OA.
((e →₁d) ∩ (e ∪ (f ∩ (((e ∩ f) ∪ ((e →₁d) ∩ (f →₁d))) ∪ (((e ∩ g) ∪ ((e →₁d) ∩ (g →₁d))) ∩ ((f ∩ g) ∪ ((f →₁d) ∩ (g →₁d)))))))) ≤ (((e ∩ d) ∪ (f ∩ d)) ∪ (g ∩ d)) & e = (a^⊥ →₁d) & f = (b^⊥ →₁d) & g = (c^⊥ →₁d) ⇒ ((a →₁d) ∩ ((a^⊥ →₁d) ∪ ((b^⊥ →₁d) ∩ ((((a →₁d) ∩ (b →₁d)) ∪ ((a^⊥ →₁d) ∩ (b^⊥ →₁d))) ∪ ((((a →₁d) ∩ (c →₁d)) ∪ ((a^⊥ →₁d) ∩ (c^⊥ →₁d))) ∩ (((b →₁d) ∩ (c →₁d)) ∪ ((b^⊥ →₁d) ∩ (c^⊥ →₁d)))))))) ≤ d

Theorem	oa4uto4g 975	Derivation of "Godowski/Greechie" 4-variable proper OA law variant from "universal" variant oa4to4u2 974.
((b^⊥ →₁d) ∩ ((b^⊥ ^⊥ →₁d) ∪ ((a^⊥ ^⊥ →₁d) ∩ ((((b^⊥ →₁d) ∩ (a^⊥ →₁d)) ∪ ((b^⊥ ^⊥ →₁d) ∩ (a^⊥ ^⊥ →₁d))) ∪ ((((b^⊥ →₁d) ∩ (c^⊥ →₁d)) ∪ ((b^⊥ ^⊥ →₁d) ∩ (c^⊥ ^⊥ →₁d))) ∩ (((a^⊥ →₁d) ∩ (c^⊥ →₁d)) ∪ ((a^⊥ ^⊥ →₁d) ∩ (c^⊥ ^⊥ →₁d)))))))) ≤ d & h = (((a ∩ c) ∪ ((a →₁d) ∩ (c →₁d))) ∩ ((b ∩ c) ∪ ((b →₁d) ∩ (c →₁d)))) ⇒ ((a →₁d) ∩ (((a ∩ b) ∪ ((a →₁d) ∩ (b →₁d))) ∪ h)) ≤ (b →₁d)

Theorem	oa4gto4u 976	A "universal" 4-OA derived from the Godowski/Greechie form. The hypotheses are the Godowski/Greechie form of the proper 4-OA and substitutions into it.
((e →₁d) ∩ (((e ∩ f) ∪ ((e →₁d) ∩ (f →₁d))) ∪ (((e ∩ g) ∪ ((e →₁d) ∩ (g →₁d))) ∩ ((f ∩ g) ∪ ((f →₁d) ∩ (g →₁d)))))) ≤ (f →₁d) & f = (a →₁d) & e = (b →₁d) & g = (c →₁d) ⇒ ((a →₁d) ∩ ((a^⊥ →₁d) ∪ ((b^⊥ →₁d) ∩ ((((a →₁d) ∩ (b →₁d)) ∪ ((a^⊥ →₁d) ∩ (b^⊥ →₁d))) ∪ ((((a →₁d) ∩ (c →₁d)) ∪ ((a^⊥ →₁d) ∩ (c^⊥ →₁d))) ∩ (((b →₁d) ∩ (c →₁d)) ∪ ((b^⊥ →₁d) ∩ (c^⊥ →₁d)))))))) ≤ d

Theorem	oa4uto4 977	Derivation of standard 4-variable proper OA law from "universal" variant oa4to4u2 974.
((a →₁d) ∩ ((a^⊥ →₁d) ∪ ((b^⊥ →₁d) ∩ ((((a →₁d) ∩ (b →₁d)) ∪ ((a^⊥ →₁d) ∩ (b^⊥ →₁d))) ∪ ((((a →₁d) ∩ (c →₁d)) ∪ ((a^⊥ →₁d) ∩ (c^⊥ →₁d))) ∩ (((b →₁d) ∩ (c →₁d)) ∪ ((b^⊥ →₁d) ∩ (c^⊥ →₁d)))))))) ≤ d ⇒ ((a →₁d) ∩ (a ∪ (b ∩ (((a ∩ b) ∪ ((a →₁d) ∩ (b →₁d))) ∪ (((a ∩ c) ∪ ((a →₁d) ∩ (c →₁d))) ∩ ((b ∩ c) ∪ ((b →₁d) ∩ (c →₁d)))))))) ≤ d

0.3.14 Some 3-OA inferences (derived under OM)

Theorem	oa3-2lema 978	Lemma for 3-OA(2). Equivalence with substitution into 4-OA.
((a →₁c) ∩ (a ∪ (b ∩ (((a ∩ b) ∪ ((a →₁c) ∩ (b →₁c))) ∪ (((a ∩ 0) ∪ ((a →₁c) ∩ (0 →₁c))) ∩ ((b ∩ 0) ∪ ((b →₁c) ∩ (0 →₁c)))))))) = ((a →₁c) ∩ (a ∪ (b ∩ ((a ∩ b) ∪ ((a →₁c) ∩ (b →₁c))))))

Theorem	oa3-2lemb 979	Lemma for 3-OA(2). Equivalence with substitution into 4-OA.
((a →₁c) ∩ (a ∪ (b ∩ (((a ∩ b) ∪ ((a →₁c) ∩ (b →₁c))) ∪ (((a ∩ c) ∪ ((a →₁c) ∩ (c →₁c))) ∩ ((b ∩ c) ∪ ((b →₁c) ∩ (c →₁c)))))))) = ((a →₁c) ∩ (a ∪ (b ∩ ((a ∩ b) ∪ ((a →₁c) ∩ (b →₁c))))))

Theorem	oa3-6lem 980	Lemma for 3-OA(6). Equivalence with substitution into 4-OA.
((a →₁c) ∩ (a ∪ (b ∩ (((a ∩ b) ∪ ((a →₁c) ∩ (b →₁c))) ∪ (((a ∩ 1) ∪ ((a →₁c) ∩ (1 →₁c))) ∩ ((b ∩ 1) ∪ ((b →₁c) ∩ (1 →₁c)))))))) = ((a →₁c) ∩ (a ∪ (b ∩ (((a^⊥ →₁c) ∩ (b^⊥ →₁c)) ∪ ((a →₁c) ∩ (b →₁c))))))

Theorem	oa3-3lem 981	Lemma for 3-OA(3). Equivalence with substitution into 6-OA dual.
(a^⊥ ∩ (a ∪ (b ∩ (((a ∩ b) ∪ (a^⊥ ∩ b^⊥ )) ∪ (((a ∩ 1) ∪ (a^⊥ ∩ c)) ∩ ((b ∩ 1) ∪ (b^⊥ ∩ c))))))) = (a^⊥ ∩ (a ∪ (b ∩ ((a ≡ b) ∪ ((a^⊥ →₁c) ∩ (b^⊥ →₁c))))))

Theorem	oa3-1lem 982	Lemma for 3-OA(1). Equivalence with substitution into 6-OA dual.
(1 ∩ (0 ∪ (a ∩ (((0 ∩ a) ∪ (1 ∩ (a →₁c))) ∪ (((0 ∩ b) ∪ (1 ∩ (b →₁c))) ∩ ((a ∩ b) ∪ ((a →₁c) ∩ (b →₁c)))))))) = (a ∩ ((a →₁c) ∪ ((b →₁c) ∩ ((a ∩ b) ∪ ((a →₁c) ∩ (b →₁c))))))

Theorem	oa3-4lem 983	Lemma for 3-OA(4). Equivalence with substitution into 6-OA dual.
(a^⊥ ∩ (a ∪ (b ∩ (((a ∩ b) ∪ (a^⊥ ∩ b^⊥ )) ∪ (((a ∩ c) ∪ (a^⊥ ∩ 1)) ∩ ((b ∩ c) ∪ (b^⊥ ∩ 1))))))) = (a^⊥ ∩ (a ∪ (b ∩ ((a ≡ b) ∪ ((a →₁c) ∩ (b →₁c))))))

Theorem	oa3-5lem 984	Lemma for 3-OA(5). Equivalence with substitution into 6-OA dual.
((a →₁c) ∩ (a ∪ (c ∩ (((a ∩ c) ∪ ((a →₁c) ∩ 1)) ∪ (((a ∩ b) ∪ ((a →₁c) ∩ (b →₁c))) ∩ ((c ∩ b) ∪ (1 ∩ (b →₁c)))))))) = ((a →₁c) ∩ (a ∪ (c ∩ ((a →₁c) ∪ ((b →₁c) ∩ ((a ∩ b) ∪ ((a →₁c) ∩ (b →₁c))))))))

Theorem	oa3-u1lem 985	Lemma for a "universal" 3-OA. Equivalence with substitution into 6-OA dual.
(1 ∩ (c ∪ ((a^⊥ →₁c) ∩ (((c ∩ (a^⊥ →₁c)) ∪ (1 ∩ (a →₁c))) ∪ (((c ∩ (b^⊥ →₁c)) ∪ (1 ∩ (b →₁c))) ∩ (((a^⊥ →₁c) ∩ (b^⊥ →₁c)) ∪ ((a →₁c) ∩ (b →₁c)))))))) = (c ∪ ((a^⊥ →₁c) ∩ ((a →₁c) ∪ ((b →₁c) ∩ (((a →₁c) ∩ (b →₁c)) ∪ ((a^⊥ →₁c) ∩ (b^⊥ →₁c)))))))

Theorem	oa3-u2lem 986	Lemma for a "universal" 3-OA. Equivalence with substitution into 6-OA dual.
((a →₁c) ∩ ((a^⊥ →₁c) ∪ (c ∩ ((((a^⊥ →₁c) ∩ c) ∪ ((a →₁c) ∩ 1)) ∪ ((((a^⊥ →₁c) ∩ (b^⊥ →₁c)) ∪ ((a →₁c) ∩ (b →₁c))) ∩ ((c ∩ (b^⊥ →₁c)) ∪ (1 ∩ (b →₁c)))))))) = ((a →₁c) ∩ ((a^⊥ →₁c) ∪ (c ∩ ((a →₁c) ∪ ((b →₁c) ∩ (((a →₁c) ∩ (b →₁c)) ∪ ((a^⊥ →₁c) ∩ (b^⊥ →₁c))))))))

Theorem	oa3-6to3 987	Derivation of 3-OA variant (3) from (6).
((a →₁c) ∩ (a ∪ (b ∩ (((a^⊥ →₁c) ∩ (b^⊥ →₁c)) ∪ ((a →₁c) ∩ (b →₁c)))))) ≤ c ⇒ (a^⊥ ∩ (a ∪ (b ∩ ((a ≡ b) ∪ ((a^⊥ →₁c) ∩ (b^⊥ →₁c)))))) ≤ c

Theorem	oa3-2to4 988	Derivation of 3-OA variant (4) from (2).
((a →₁c) ∩ (a ∪ (b ∩ ((a ∩ b) ∪ ((a →₁c) ∩ (b →₁c)))))) ≤ c ⇒ (a^⊥ ∩ (a ∪ (b ∩ ((a ≡ b) ∪ ((a →₁c) ∩ (b →₁c)))))) ≤ c

Theorem	oa3-2wto2 989	Derivation of 3-OA variant from weaker version.
(a^⊥ ∩ (a ∪ (b ∩ ((a ∩ b) ∪ ((a →₁c) ∩ (b →₁c)))))) ≤ c ⇒ ((a →₁c) ∩ (a ∪ (b ∩ ((a ∩ b) ∪ ((a →₁c) ∩ (b →₁c)))))) ≤ c

Theorem	oa3-2to2s 990	Derivation of 3-OA variant from weaker version.
((a →₁d) ∩ (a ∪ (b ∩ ((a ∩ b) ∪ ((a →₁d) ∩ (b →₁d)))))) ≤ d & d = ((a ∩ c) ∪ (b ∩ c)) ⇒ ((a →₁c) ∩ (a ∪ (b ∩ ((a ∩ b) ∪ ((a →₁c) ∩ (b →₁c)))))) ≤ ((a ∩ c) ∪ (b ∩ c))

Theorem	oa3-u1 991	Derivation of a "universal" 3-OA. The hypothesis is a substitution instance of the proper 4-OA.
((c →₁c) ∩ (c ∪ ((a^⊥ →₁c) ∩ (((c ∩ (a^⊥ →₁c)) ∪ ((c →₁c) ∩ ((a^⊥ →₁c) →₁c))) ∪ (((c ∩ (b^⊥ →₁c)) ∪ ((c →₁c) ∩ ((b^⊥ →₁c) →₁c))) ∩ (((a^⊥ →₁c) ∩ (b^⊥ →₁c)) ∪ (((a^⊥ →₁c) →₁c) ∩ ((b^⊥ →₁c) →₁c)))))))) ≤ c ⇒ (c ∪ ((a^⊥ →₁c) ∩ ((a →₁c) ∪ ((b →₁c) ∩ (((a →₁c) ∩ (b →₁c)) ∪ ((a^⊥ →₁c) ∩ (b^⊥ →₁c))))))) ≤ c

Theorem	oa3-u2 992	Derivation of a "universal" 3-OA. The hypothesis is a substitution instance of the proper 4-OA.
(((a^⊥ →₁c) →₁c) ∩ ((a^⊥ →₁c) ∪ (c ∩ ((((a^⊥ →₁c) ∩ c) ∪ (((a^⊥ →₁c) →₁c) ∩ (c →₁c))) ∪ ((((a^⊥ →₁c) ∩ (b^⊥ →₁c)) ∪ (((a^⊥ →₁c) →₁c) ∩ ((b^⊥ →₁c) →₁c))) ∩ ((c ∩ (b^⊥ →₁c)) ∪ ((c →₁c) ∩ ((b^⊥ →₁c) →₁c)))))))) ≤ c ⇒ ((a →₁c) ∩ ((a^⊥ →₁c) ∪ (c ∩ ((a →₁c) ∪ ((b →₁c) ∩ (((a →₁c) ∩ (b →₁c)) ∪ ((a^⊥ →₁c) ∩ (b^⊥ →₁c)))))))) ≤ c

Theorem	oa3-1to5 993	Derivation of an equivalent of the second "universal" 3-OA U2 from an equivalent of the first "universal" 3-OA U1. This shows that U2 is redundant in a system containg U1. The hypothesis is theorem oal1 1000.
((a →₁c) ∩ ((a ∩ b) ∪ ((a →₁c) ∩ (b →₁c)))) ≤ (b →₁c) ⇒ (c ∩ ((b →₁c) ∪ ((a →₁c) ∩ ((a ∩ b) ∪ ((a →₁c) ∩ (b →₁c)))))) ≤ (b^⊥ →₁c)

0.4 Derivation of 4-variable proper OA from OA distributive law

Axiom	ax-oadist 994	OA Distributive law. In this section, we postulate this temporary axiom (intended not to be used outside of this section) for the OA distributive law, and derive from it the 6-OA, in theorem d6oa 997. This together with the derivation of the distributive law in theorem 4oadist 1044 shows that the OA distributive law is equivalent to the 6-OA.
e = (((a ∩ c) ∪ ((a →₁d) ∩ (c →₁d))) ∩ ((b ∩ c) ∪ ((b →₁d) ∩ (c →₁d)))) & f = (((a ∩ b) ∪ ((a →₁d) ∩ (b →₁d))) ∪ e) & h ≤ (a →₁d) & j ≤ f & k ≤ f & (h ∩ (b →₁d)) ≤ k ⇒ (h ∩ (j ∪ k)) = ((h ∩ j) ∪ (h ∩ k))

Theorem	d3oa 995	Derivation of 3-OA from OA distributive law.
f = ((a ∩ b) ∪ ((a →₁c) ∩ (b →₁c))) ⇒ ((a →₁c) ∩ f) ≤ (b →₁c)

Theorem	d4oa 996	Variant of proper 4-OA proved from OA distributive law.
e = ((a ∩ b) ∪ ((a →₁d) ∩ (b →₁d))) & f = (((a ∩ c) ∪ ((a →₁d) ∩ (c →₁d))) ∩ ((b ∩ c) ∪ ((b →₁d) ∩ (c →₁d)))) ⇒ ((a →₁d) ∩ (e ∪ f)) ≤ (b →₁d)

Theorem	d6oa 997	Derivation of 6-variable orthoarguesian law from OA distributive law.
a ≤ b^⊥ & c ≤ d^⊥ & e ≤ f^⊥ ⇒ (((a ∪ b) ∩ (c ∪ d)) ∩ (e ∪ f)) ≤ (b ∪ (a ∩ (c ∪ (((a ∪ c) ∩ (b ∪ d)) ∩ (((a ∪ e) ∩ (b ∪ f)) ∪ ((c ∪ e) ∩ (d ∪ f)))))))

0.5 Orthoarguesian laws

0.5.1 3-variable orthoarguesian law

Axiom	ax-3oa 998	3-variable consequence of the orthoarguesion law.
((a →₁c) ∩ ((a ∩ b) ∪ ((a →₁c) ∩ (b →₁c)))) ≤ (b →₁c)

Theorem	oal2 999	Orthoarguesian law - →₂ version.
((a →₂b) ∩ ((b ∪ c)^⊥ ∪ ((a →₂b) ∩ (a →₂c)))) ≤ (a →₂c)

Theorem	oal1 1000	Orthoarguesian law - →₁ version derived from →₁ version.
((a →₁c) ∩ ((a ∩ b) ∪ ((a →₁c) ∩ (b →₁c)))) ≤ (b →₁c)

< 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-1215

< Previous Next >