[Lattice L46-7]Home PageHome Quantum Logic Explorer < Previous   Next >
Related theorems
Unicode version

Theorem d4oa 976
Description: Variant of proper 4-OA proved from OA distributive law.
Hypotheses
Ref Expression
d4oa.2 e = ((a ^ b) v ((a ->1 d) ^ (b ->1 d)))
d4oa.1 f = (((a ^ c) v ((a ->1 d) ^ (c ->1 d))) ^ ((b ^ c) v ((b ->1 d) ^ (c ->1 d))))
Assertion
Ref Expression
d4oa ((a ->1 d) ^ (e v f)) =< (b ->1 d)

Proof of Theorem d4oa
StepHypRef Expression
1 ax-a2 30 . . . 4 (e v f) = (f v e)
21lan 70 . . 3 ((a ->1 d) ^ (e v f)) = ((a ->1 d) ^ (f v e))
3 id 58 . . . 4 (((a ^ c) v ((a ->1 d) ^ (c ->1 d))) ^ ((b ^ c) v ((b ->1 d) ^ (c ->1 d)))) = (((a ^ c) v ((a ->1 d) ^ (c ->1 d))) ^ ((b ^ c) v ((b ->1 d) ^ (c ->1 d))))
4 d4oa.2 . . . . 5 e = ((a ^ b) v ((a ->1 d) ^ (b ->1 d)))
5 d4oa.1 . . . . 5 f = (((a ^ c) v ((a ->1 d) ^ (c ->1 d))) ^ ((b ^ c) v ((b ->1 d) ^ (c ->1 d))))
64, 52or 67 . . . 4 (e v f) = (((a ^ b) v ((a ->1 d) ^ (b ->1 d))) v (((a ^ c) v ((a ->1 d) ^ (c ->1 d))) ^ ((b ^ c) v ((b ->1 d) ^ (c ->1 d)))))
7 leid 140 . . . 4 (a ->1 d) =< (a ->1 d)
8 leor 151 . . . 4 f =< (e v f)
9 leo 150 . . . 4 e =< (e v f)
10 leor 151 . . . . 5 ((a ->1 d) ^ (b ->1 d)) =< ((a ^ b) v ((a ->1 d) ^ (b ->1 d)))
114ax-r1 34 . . . . 5 ((a ^ b) v ((a ->1 d) ^ (b ->1 d))) = e
1210, 11lbtr 131 . . . 4 ((a ->1 d) ^ (b ->1 d)) =< e
133, 6, 7, 8, 9, 12ax-oadist 974 . . 3 ((a ->1 d) ^ (f v e)) = (((a ->1 d) ^ f) v ((a ->1 d) ^ e))
142, 13ax-r2 35 . 2 ((a ->1 d) ^ (e v f)) = (((a ->1 d) ^ f) v ((a ->1 d) ^ e))
155lan 70 . . . . . 6 ((a ->1 d) ^ f) = ((a ->1 d) ^ (((a ^ c) v ((a ->1 d) ^ (c ->1 d))) ^ ((b ^ c) v ((b ->1 d) ^ (c ->1 d)))))
16 anass 69 . . . . . . 7 (((a ->1 d) ^ ((a ^ c) v ((a ->1 d) ^ (c ->1 d)))) ^ ((b ^ c) v ((b ->1 d) ^ (c ->1 d)))) = ((a ->1 d) ^ (((a ^ c) v ((a ->1 d) ^ (c ->1 d))) ^ ((b ^ c) v ((b ->1 d) ^ (c ->1 d)))))
1716ax-r1 34 . . . . . 6 ((a ->1 d) ^ (((a ^ c) v ((a ->1 d) ^ (c ->1 d))) ^ ((b ^ c) v ((b ->1 d) ^ (c ->1 d))))) = (((a ->1 d) ^ ((a ^ c) v ((a ->1 d) ^ (c ->1 d)))) ^ ((b ^ c) v ((b ->1 d) ^ (c ->1 d))))
1815, 17ax-r2 35 . . . . 5 ((a ->1 d) ^ f) = (((a ->1 d) ^ ((a ^ c) v ((a ->1 d) ^ (c ->1 d)))) ^ ((b ^ c) v ((b ->1 d) ^ (c ->1 d))))
19 id 58 . . . . . . 7 ((a ^ c) v ((a ->1 d) ^ (c ->1 d))) = ((a ^ c) v ((a ->1 d) ^ (c ->1 d)))
2019d3oa 975 . . . . . 6 ((a ->1 d) ^ ((a ^ c) v ((a ->1 d) ^ (c ->1 d)))) =< (c ->1 d)
2120leran 145 . . . . 5 (((a ->1 d) ^ ((a ^ c) v ((a ->1 d) ^ (c ->1 d)))) ^ ((b ^ c) v ((b ->1 d) ^ (c ->1 d)))) =< ((c ->1 d) ^ ((b ^ c) v ((b ->1 d) ^ (c ->1 d))))
2218, 21bltr 130 . . . 4 ((a ->1 d) ^ f) =< ((c ->1 d) ^ ((b ^ c) v ((b ->1 d) ^ (c ->1 d))))
23 ancom 68 . . . . . 6 (b ^ c) = (c ^ b)
24 ancom 68 . . . . . 6 ((b ->1 d) ^ (c ->1 d)) = ((c ->1 d) ^ (b ->1 d))
2523, 242or 67 . . . . 5 ((b ^ c) v ((b ->1 d) ^ (c ->1 d))) = ((c ^ b) v ((c ->1 d) ^ (b ->1 d)))
2625d3oa 975 . . . 4 ((c ->1 d) ^ ((b ^ c) v ((b ->1 d) ^ (c ->1 d)))) =< (b ->1 d)
2722, 26letr 129 . . 3 ((a ->1 d) ^ f) =< (b ->1 d)
284d3oa 975 . . 3 ((a ->1 d) ^ e) =< (b ->1 d)
2927, 28lel2or 162 . 2 (((a ->1 d) ^ f) v ((a ->1 d) ^ e)) =< (b ->1 d)
3014, 29bltr 130 1 ((a ->1 d) ^ (e v f)) =< (b ->1 d)
Colors of variables: term
Syntax hints:   = wb 1   =< wle 2   v wo 6   ^ wa 7   ->1 wi1 13
This theorem is referenced by:  d6oa 977
This theorem was proved from axioms:  ax-a1 29  ax-a2 30  ax-a3 31  ax-a4 32  ax-a5 33  ax-r1 34  ax-r2 35  ax-r4 36  ax-r5 37  ax-r3 421  ax-oadist 974
This theorem depends on definitions:  df-b 38  df-a 39  df-t 40  df-f 41  df-i0 42  df-i1 43  df-i2 44  df-le1 122  df-le2 123  df-c1 124  df-c2 125
metamath.org