Quantum Logic Explorer		< Previous   Next > Nearby theorems
Mirrors  >  Home  >  QLE Home  >  Th. List  >  dp35lemg		Unicode version

---

Theorem dp35lemg 1169

Description: Part of proof (3)=>(5) in Day/Pickering 1982.

Hypotheses

Ref	Expression
dp35lem.1	c0 a1 a2 b1 b2
dp35lem.2	c1 a0 a2 b0 b2
dp35lem.3	c2 a0 a1 b0 b1
dp35lem.4	p0 a1 b1 a2 b2
dp35lem.5	a0 b0 a1 b1 a2 b2

Assertion

Ref	Expression
dp35lemg	a0 b0 b1 c2 c0 c1

---

Proof of Theorem dp35lemg

Step	Hyp	Ref	Expression
1		dp35lem.1	. 2 c0 a1 a2 b1 b2
2		dp35lem.2	. 2 c1 a0 a2 b0 b2
3		dp35lem.3	. 2 c2 a0 a1 b0 b1
4		dp35lem.5	. 2 a0 b0 a1 b1 a2 b2
5	1, 2, 3, 4	dp53 1168	1 a0 b0 b1 c2 c0 c1

Colors of variables: term

Syntax hints:   wb 1   wle 2   wo 6   wa 7

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-ml 1120  ax-arg 1151

This theorem depends on definitions:  df-a 40  df-t 41  df-f 42  df-le1 130  df-le2 131

This theorem is referenced by:  dp35lemf  1170

Copyright terms: Public domain

W3C validator