Theorem vneulem 1147

Description: von Neumann's modular law lemma. Lemma 9, Kalmbach p. 96. (Contributed by NM, 31-Mar-2011.)

Hypothesis

Ref	Expression
vneulem.1	((a ∪ b) ∩ (c ∪ d)) = 0

Assertion

Ref	Expression
vneulem	((a ∪ c) ∩ (b ∪ d)) = ((a ∩ b) ∪ (c ∩ d))

Proof of Theorem vneulem

Step	Hyp	Ref	Expression
1		vneulem.1	. . 3 ((a ∪ b) ∩ (c ∪ d)) = 0
2	1	vneulem15 1145	. 2 ((a ∪ c) ∩ (b ∪ d)) = ((((a ∪ b) ∪ c) ∩ ((a ∪ c) ∪ d)) ∩ (((a ∪ b) ∪ d) ∩ ((b ∪ c) ∪ d)))
3	1	vneulem16 1146	. 2 ((((a ∪ b) ∪ c) ∩ ((a ∪ c) ∪ d)) ∩ (((a ∪ b) ∪ d) ∩ ((b ∪ c) ∪ d))) = ((a ∩ b) ∪ (c ∩ d))
4	2, 3	tr 62	1 ((a ∪ c) ∩ (b ∪ d)) = ((a ∩ b) ∪ (c ∩ d))

This proof depends on syntax axioms:   = wb 1   ∪ wo 6   ∩ wa 7  0wf 9

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  ax-ml 1122

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

This theorem is used by: (None)