oa3-1to5 - Quantum Logic Explorer

	Quantum Logic Explorer		< Previous Next > Nearby theorems
Mirrors > Home > QLE Home > Th. List > oa3-1to5		GIF version

Theorem oa3-1to5 993

Description: 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. (Contributed by NM, 1-Jan-1999.)

**Hypothesis**
Ref	Expression
oa3-1to5.1	((a →₁c) ∩ ((a ∩ b) ∪ ((a →₁c) ∩ (b →₁c)))) ≤ (b →₁c)

**Assertion**
Ref	Expression
oa3-1to5	(c ∩ ((b →₁c) ∪ ((a →₁c) ∩ ((a ∩ b) ∪ ((a →₁c) ∩ (b →₁c)))))) ≤ (b^⊥ →₁c)

**Proof of Theorem oa3-1to5**
Step	Hyp	Ref	Expression
1		leid 148	. . . . 5 (b →₁c) ≤ (b →₁c)
2		oa3-1to5.1	. . . . 5 ((a →₁c) ∩ ((a ∩ b) ∪ ((a →₁c) ∩ (b →₁c)))) ≤ (b →₁c)
3	1, 2	lel2or 170	. . . 4 ((b →₁c) ∪ ((a →₁c) ∩ ((a ∩ b) ∪ ((a →₁c) ∩ (b →₁c))))) ≤ (b →₁c)
4	3	lelan 167	. . 3 (c ∩ ((b →₁c) ∪ ((a →₁c) ∩ ((a ∩ b) ∪ ((a →₁c) ∩ (b →₁c)))))) ≤ (c ∩ (b →₁c))
5		ax-a1 30	. . . . . . . 8 b = b^⊥ ^⊥
6	5	ran 78	. . . . . . 7 (b ∩ c) = (b^⊥ ^⊥ ∩ c)
7	6	ax-r5 38	. . . . . 6 ((b ∩ c) ∪ (b^⊥ ∩ c)) = ((b^⊥ ^⊥ ∩ c) ∪ (b^⊥ ∩ c))
8		ax-a2 31	. . . . . 6 ((b^⊥ ^⊥ ∩ c) ∪ (b^⊥ ∩ c)) = ((b^⊥ ∩ c) ∪ (b^⊥ ^⊥ ∩ c))
9	7, 8	ax-r2 36	. . . . 5 ((b ∩ c) ∪ (b^⊥ ∩ c)) = ((b^⊥ ∩ c) ∪ (b^⊥ ^⊥ ∩ c))
10		u1lemab 610	. . . . 5 ((b →₁c) ∩ c) = ((b ∩ c) ∪ (b^⊥ ∩ c))
11		u1lemab 610	. . . . 5 ((b^⊥ →₁c) ∩ c) = ((b^⊥ ∩ c) ∪ (b^⊥ ^⊥ ∩ c))
12	9, 10, 11	3tr1 63	. . . 4 ((b →₁c) ∩ c) = ((b^⊥ →₁c) ∩ c)
13		ancom 74	. . . 4 (c ∩ (b →₁c)) = ((b →₁c) ∩ c)
14		ancom 74	. . . 4 (c ∩ (b^⊥ →₁c)) = ((b^⊥ →₁c) ∩ c)
15	12, 13, 14	3tr1 63	. . 3 (c ∩ (b →₁c)) = (c ∩ (b^⊥ →₁c))
16	4, 15	lbtr 139	. 2 (c ∩ ((b →₁c) ∪ ((a →₁c) ∩ ((a ∩ b) ∪ ((a →₁c) ∩ (b →₁c)))))) ≤ (c ∩ (b^⊥ →₁c))
17		lear 161	. 2 (c ∩ (b^⊥ →₁c)) ≤ (b^⊥ →₁c)
18	16, 17	letr 137	1 (c ∩ ((b →₁c) ∪ ((a →₁c) ∩ ((a ∩ b) ∪ ((a →₁c) ∩ (b →₁c)))))) ≤ (b^⊥ →₁c)

Colors of variables: term

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

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-le1 130 df-le2 131 df-c1 132 df-c2 133

This theorem is used by: (None)

W3C validator