oa3-u2 - Quantum Logic Explorer

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

Theorem oa3-u2 992

Description: Derivation of a "universal" 3-OA. The hypothesis is a substitution instance of the proper 4-OA. (Contributed by NM, 27-Dec-1998.)

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

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

**Proof of Theorem oa3-u2**
Step	Hyp	Ref	Expression
1		oa3-u2lem 986	. . 3 ((a →₁c) ∩ ((a^⊥ →₁c) ∪ (c ∩ ((((a^⊥ →₁c) ∩ c) ∪ ((a →₁c) ∩ 1)) ∪ ((((a^⊥ →₁c) ∩ (b^⊥ →₁c)) ∪ ((a →₁c) ∩ (b →₁c))) ∩ ((c ∩ (b^⊥ →₁c)) ∪ (1 ∩ (b →₁c)))))))) = ((a →₁c) ∩ ((a^⊥ →₁c) ∪ (c ∩ ((a →₁c) ∪ ((b →₁c) ∩ (((a →₁c) ∩ (b →₁c)) ∪ ((a^⊥ →₁c) ∩ (b^⊥ →₁c))))))))
2	1	ax-r1 35	. 2 ((a →₁c) ∩ ((a^⊥ →₁c) ∪ (c ∩ ((a →₁c) ∪ ((b →₁c) ∩ (((a →₁c) ∩ (b →₁c)) ∪ ((a^⊥ →₁c) ∩ (b^⊥ →₁c)))))))) = ((a →₁c) ∩ ((a^⊥ →₁c) ∪ (c ∩ ((((a^⊥ →₁c) ∩ c) ∪ ((a →₁c) ∩ 1)) ∪ ((((a^⊥ →₁c) ∩ (b^⊥ →₁c)) ∪ ((a →₁c) ∩ (b →₁c))) ∩ ((c ∩ (b^⊥ →₁c)) ∪ (1 ∩ (b →₁c))))))))
3		u1lem9ab 779	. . 3 (a^⊥ →₁c)^⊥ ≤ (a →₁c)
4		le1 146	. . 3 c^⊥ ≤ 1
5		u1lem9ab 779	. . 3 (b^⊥ →₁c)^⊥ ≤ (b →₁c)
6		or32 82	. . . . 5 ((((a^⊥ →₁c) ∩ (a →₁c)) ∪ (c ∩ 1)) ∪ ((b^⊥ →₁c) ∩ (b →₁c))) = ((((a^⊥ →₁c) ∩ (a →₁c)) ∪ ((b^⊥ →₁c) ∩ (b →₁c))) ∪ (c ∩ 1))
7		ancom 74	. . . . . . . 8 ((a^⊥ →₁c) ∩ (a →₁c)) = ((a →₁c) ∩ (a^⊥ →₁c))
8		u1lem8 776	. . . . . . . 8 ((a →₁c) ∩ (a^⊥ →₁c)) = ((a ∩ c) ∪ (a^⊥ ∩ c))
9	7, 8	ax-r2 36	. . . . . . 7 ((a^⊥ →₁c) ∩ (a →₁c)) = ((a ∩ c) ∪ (a^⊥ ∩ c))
10		ancom 74	. . . . . . . 8 ((b^⊥ →₁c) ∩ (b →₁c)) = ((b →₁c) ∩ (b^⊥ →₁c))
11		u1lem8 776	. . . . . . . 8 ((b →₁c) ∩ (b^⊥ →₁c)) = ((b ∩ c) ∪ (b^⊥ ∩ c))
12	10, 11	ax-r2 36	. . . . . . 7 ((b^⊥ →₁c) ∩ (b →₁c)) = ((b ∩ c) ∪ (b^⊥ ∩ c))
13	9, 12	2or 72	. . . . . 6 (((a^⊥ →₁c) ∩ (a →₁c)) ∪ ((b^⊥ →₁c) ∩ (b →₁c))) = (((a ∩ c) ∪ (a^⊥ ∩ c)) ∪ ((b ∩ c) ∪ (b^⊥ ∩ c)))
14		an1 106	. . . . . 6 (c ∩ 1) = c
15	13, 14	2or 72	. . . . 5 ((((a^⊥ →₁c) ∩ (a →₁c)) ∪ ((b^⊥ →₁c) ∩ (b →₁c))) ∪ (c ∩ 1)) = ((((a ∩ c) ∪ (a^⊥ ∩ c)) ∪ ((b ∩ c) ∪ (b^⊥ ∩ c))) ∪ c)
16		lear 161	. . . . . . . 8 (a ∩ c) ≤ c
17		lear 161	. . . . . . . 8 (a^⊥ ∩ c) ≤ c
18	16, 17	lel2or 170	. . . . . . 7 ((a ∩ c) ∪ (a^⊥ ∩ c)) ≤ c
19		lear 161	. . . . . . . 8 (b ∩ c) ≤ c
20		lear 161	. . . . . . . 8 (b^⊥ ∩ c) ≤ c
21	19, 20	lel2or 170	. . . . . . 7 ((b ∩ c) ∪ (b^⊥ ∩ c)) ≤ c
22	18, 21	lel2or 170	. . . . . 6 (((a ∩ c) ∪ (a^⊥ ∩ c)) ∪ ((b ∩ c) ∪ (b^⊥ ∩ c))) ≤ c
23	22	df-le2 131	. . . . 5 ((((a ∩ c) ∪ (a^⊥ ∩ c)) ∪ ((b ∩ c) ∪ (b^⊥ ∩ c))) ∪ c) = c
24	6, 15, 23	3tr 65	. . . 4 ((((a^⊥ →₁c) ∩ (a →₁c)) ∪ (c ∩ 1)) ∪ ((b^⊥ →₁c) ∩ (b →₁c))) = c
25	24	ax-r1 35	. . 3 c = ((((a^⊥ →₁c) ∩ (a →₁c)) ∪ (c ∩ 1)) ∪ ((b^⊥ →₁c) ∩ (b →₁c)))
26		oa3-u2.1	. . 3 (((a^⊥ →₁c) →₁c) ∩ ((a^⊥ →₁c) ∪ (c ∩ ((((a^⊥ →₁c) ∩ c) ∪ (((a^⊥ →₁c) →₁c) ∩ (c →₁c))) ∪ ((((a^⊥ →₁c) ∩ (b^⊥ →₁c)) ∪ (((a^⊥ →₁c) →₁c) ∩ ((b^⊥ →₁c) →₁c))) ∩ ((c ∩ (b^⊥ →₁c)) ∪ ((c →₁c) ∩ ((b^⊥ →₁c) →₁c)))))))) ≤ c
27	3, 4, 5, 25, 26	oa4to6dual 964	. 2 ((a →₁c) ∩ ((a^⊥ →₁c) ∪ (c ∩ ((((a^⊥ →₁c) ∩ c) ∪ ((a →₁c) ∩ 1)) ∪ ((((a^⊥ →₁c) ∩ (b^⊥ →₁c)) ∪ ((a →₁c) ∩ (b →₁c))) ∩ ((c ∩ (b^⊥ →₁c)) ∪ (1 ∩ (b →₁c)))))))) ≤ c
28	2, 27	bltr 138	1 ((a →₁c) ∩ ((a^⊥ →₁c) ∪ (c ∩ ((a →₁c) ∪ ((b →₁c) ∩ (((a →₁c) ∩ (b →₁c)) ∪ ((a^⊥ →₁c) ∩ (b^⊥ →₁c)))))))) ≤ c

Colors of variables: term

Syntax hints: ≤ wle 2 ^⊥ wn 4 ∪ wo 6 ∩ wa 7 1wt 8 →₁wi1 12

This theorem was proved from 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 theorem 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 referenced by: (None)

W3C validator