Theorem lem3.3.3lem1 1049

Description: Lemma for lem3.3.3 1052. (Contributed by Roy F. Longton, 27-Jun-2005.) (Revised by Roy F. Longton, 3-Jul-2005.)

Assertion

Ref	Expression
lem3.3.3lem1	(a ≡5 b) ≤ (a →1 b)

Proof of Theorem lem3.3.3lem1

Step	Hyp	Ref	Expression
1		ax-a2 31	. . 3 ((a ∩ b) ∪ (a⊥ ∩ b⊥ )) = ((a⊥ ∩ b⊥ ) ∪ (a ∩ b))
2		lea 160	. . . 4 (a⊥ ∩ b⊥ ) ≤ a⊥
3	2	leror 152	. . 3 ((a⊥ ∩ b⊥ ) ∪ (a ∩ b)) ≤ (a⊥ ∪ (a ∩ b))
4	1, 3	bltr 138	. 2 ((a ∩ b) ∪ (a⊥ ∩ b⊥ )) ≤ (a⊥ ∪ (a ∩ b))
5		df-id5 1047	. 2 (a ≡5 b) = ((a ∩ b) ∪ (a⊥ ∩ b⊥ ))
6		df-i1 44	. 2 (a →1 b) = (a⊥ ∪ (a ∩ b))
7	4, 5, 6	le3tr1 140	1 (a ≡5 b) ≤ (a →1 b)

This proof depends on syntax axioms:   ≤ wle 2  ^⊥ wn 4   ∪ wo 6   ∩ wa 7   →₁ wi1 12   ≡₅ wid5 22

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

This proof depends on definitions:  df-a 40  df-t 41  df-f 42  df-i1 44  df-le1 130  df-le2 131  df-id5 1047

This theorem is used by:  lem3.3.3lem3  1051