Theorem 1oaii 824

Description: OML analog to orthoarguesian law of Godowski/Greechie, Eq. II with →₁ instead of →₀ . (Contributed by NM, 1-Nov-1998.)

Assertion

Ref	Expression
1oaii	(b⊥ ∩ ((a →2 b) ∪ ((a →2 c) ∩ ((b ∪ c) →1 ((a →2 b) ∩ (a →2 c)))))) ≤ a⊥

Proof of Theorem 1oaii

Step	Hyp	Ref	Expression
1		orabs 120	. . . . 5 ((a →2 b) ∪ ((a →2 b) ∩ ((b ∪ c) →1 ((a →2 b) ∩ (a →2 c))))) = (a →2 b)
2		1oaiii 823	. . . . . 6 ((a →2 b) ∩ ((b ∪ c) →1 ((a →2 b) ∩ (a →2 c)))) = ((a →2 c) ∩ ((b ∪ c) →1 ((a →2 b) ∩ (a →2 c))))
3	2	lor 70	. . . . 5 ((a →2 b) ∪ ((a →2 b) ∩ ((b ∪ c) →1 ((a →2 b) ∩ (a →2 c))))) = ((a →2 b) ∪ ((a →2 c) ∩ ((b ∪ c) →1 ((a →2 b) ∩ (a →2 c)))))
4		df-i2 45	. . . . . 6 (a →2 b) = (b ∪ (a⊥ ∩ b⊥ ))
5		ancom 74	. . . . . . 7 (a⊥ ∩ b⊥ ) = (b⊥ ∩ a⊥ )
6	5	lor 70	. . . . . 6 (b ∪ (a⊥ ∩ b⊥ )) = (b ∪ (b⊥ ∩ a⊥ ))
7	4, 6	ax-r2 36	. . . . 5 (a →2 b) = (b ∪ (b⊥ ∩ a⊥ ))
8	1, 3, 7	3tr2 64	. . . 4 ((a →2 b) ∪ ((a →2 c) ∩ ((b ∪ c) →1 ((a →2 b) ∩ (a →2 c))))) = (b ∪ (b⊥ ∩ a⊥ ))
9	8	lan 77	. . 3 (b⊥ ∩ ((a →2 b) ∪ ((a →2 c) ∩ ((b ∪ c) →1 ((a →2 b) ∩ (a →2 c)))))) = (b⊥ ∩ (b ∪ (b⊥ ∩ a⊥ )))
10		omlan 448	. . 3 (b⊥ ∩ (b ∪ (b⊥ ∩ a⊥ ))) = (b⊥ ∩ a⊥ )
11	9, 10	ax-r2 36	. 2 (b⊥ ∩ ((a →2 b) ∪ ((a →2 c) ∩ ((b ∪ c) →1 ((a →2 b) ∩ (a →2 c)))))) = (b⊥ ∩ a⊥ )
12		lear 161	. 2 (b⊥ ∩ a⊥ ) ≤ a⊥
13	11, 12	bltr 138	1 (b⊥ ∩ ((a →2 b) ∪ ((a →2 c) ∩ ((b ∪ c) →1 ((a →2 b) ∩ (a →2 c)))))) ≤ a⊥

This proof depends on syntax axioms:   ≤ wle 2  ^⊥ wn 4   ∪ wo 6   ∩ wa 7   →₁ wi1 12   →₂ wi2 13

This proof depends on axioms:  ax-a1 30  ax-a2 31  ax-a3 32  ax-a4 33  ax-a5 34  ax-r1 35  ax-r2 36  ax-r4 37  ax-r5 38  ax-r3 439

This proof depends on definitions:  df-b 39  df-a 40  df-t 41  df-f 42  df-i1 44  df-i2 45  df-le1 130  df-le2 131  df-c1 132  df-c2 133

This theorem is used by: (None)