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

Theorem oa4to6lem2 941
Description: Lemma for orthoarguesian law (4-variable to 6-variable proof).
Hypotheses
Ref Expression
oa4to6lem.1 a_|_ =< b
oa4to6lem.2 c_|_ =< d
oa4to6lem.3 e_|_ =< f
oa4to6lem.4 g = (((a ^ b) v (c ^ d)) v (e ^ f))
Assertion
Ref Expression
oa4to6lem2 d =< (c ->1 g)

Proof of Theorem oa4to6lem2
StepHypRef Expression
1 leor 151 . . . 4 d =< (c_|_ v d)
2 comid 179 . . . . . . . . 9 c C c
32comcom3 436 . . . . . . . 8 c_|_ C c
4 oa4to6lem.2 . . . . . . . . 9 c_|_ =< d
54lecom 172 . . . . . . . 8 c_|_ C d
63, 5fh3 453 . . . . . . 7 (c_|_ v (c ^ d)) = ((c_|_ v c) ^ (c_|_ v d))
7 ancom 68 . . . . . . . 8 (1 ^ (c_|_ v d)) = ((c_|_ v d) ^ 1)
8 df-t 40 . . . . . . . . . 10 1 = (c v c_|_)
9 ax-a2 30 . . . . . . . . . 10 (c v c_|_) = (c_|_ v c)
108, 9ax-r2 35 . . . . . . . . 9 1 = (c_|_ v c)
1110ran 71 . . . . . . . 8 (1 ^ (c_|_ v d)) = ((c_|_ v c) ^ (c_|_ v d))
12 an1 98 . . . . . . . 8 ((c_|_ v d) ^ 1) = (c_|_ v d)
137, 11, 123tr2 61 . . . . . . 7 ((c_|_ v c) ^ (c_|_ v d)) = (c_|_ v d)
146, 13ax-r2 35 . . . . . 6 (c_|_ v (c ^ d)) = (c_|_ v d)
1514ax-r1 34 . . . . 5 (c_|_ v d) = (c_|_ v (c ^ d))
16 anidm 103 . . . . . . . . 9 (c ^ c) = c
1716ran 71 . . . . . . . 8 ((c ^ c) ^ d) = (c ^ d)
1817ax-r1 34 . . . . . . 7 (c ^ d) = ((c ^ c) ^ d)
19 anass 69 . . . . . . 7 ((c ^ c) ^ d) = (c ^ (c ^ d))
2018, 19ax-r2 35 . . . . . 6 (c ^ d) = (c ^ (c ^ d))
2120lor 66 . . . . 5 (c_|_ v (c ^ d)) = (c_|_ v (c ^ (c ^ d)))
2215, 21ax-r2 35 . . . 4 (c_|_ v d) = (c_|_ v (c ^ (c ^ d)))
231, 22lbtr 131 . . 3 d =< (c_|_ v (c ^ (c ^ d)))
24 leor 151 . . . . . 6 (c ^ d) =< (((a ^ b) v (e ^ f)) v (c ^ d))
25 or32 75 . . . . . 6 (((a ^ b) v (e ^ f)) v (c ^ d)) = (((a ^ b) v (c ^ d)) v (e ^ f))
2624, 25lbtr 131 . . . . 5 (c ^ d) =< (((a ^ b) v (c ^ d)) v (e ^ f))
2726lelan 159 . . . 4 (c ^ (c ^ d)) =< (c ^ (((a ^ b) v (c ^ d)) v (e ^ f)))
2827lelor 158 . . 3 (c_|_ v (c ^ (c ^ d))) =< (c_|_ v (c ^ (((a ^ b) v (c ^ d)) v (e ^ f))))
2923, 28letr 129 . 2 d =< (c_|_ v (c ^ (((a ^ b) v (c ^ d)) v (e ^ f))))
30 oa4to6lem.4 . . . . 5 g = (((a ^ b) v (c ^ d)) v (e ^ f))
3130ud1lem0a 247 . . . 4 (c ->1 g) = (c ->1 (((a ^ b) v (c ^ d)) v (e ^ f)))
32 df-i1 43 . . . 4 (c ->1 (((a ^ b) v (c ^ d)) v (e ^ f))) = (c_|_ v (c ^ (((a ^ b) v (c ^ d)) v (e ^ f))))
3331, 32ax-r2 35 . . 3 (c ->1 g) = (c_|_ v (c ^ (((a ^ b) v (c ^ d)) v (e ^ f))))
3433ax-r1 34 . 2 (c_|_ v (c ^ (((a ^ b) v (c ^ d)) v (e ^ f)))) = (c ->1 g)
3529, 34lbtr 131 1 d =< (c ->1 g)
Colors of variables: term
Syntax hints:   = wb 1   =< wle 2  _|_wn 4   v wo 6   ^ wa 7  1wt 9   ->1 wi1 13
This theorem is referenced by:  oa4to6lem4 943
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
This theorem depends on definitions:  df-b 38  df-a 39  df-t 40  df-f 41  df-i1 43  df-le1 122  df-le2 123  df-c1 124  df-c2 125
metamath.org