Theorem ud3lem0c 271

Description: Lemma for unified disjunction.

Assertion

Ref	Expression
ud3lem0c	(a →3 b)⊥ = (((a ∪ b⊥ ) ∩ (a ∪ b)) ∩ (a⊥ ∪ (a ∩ b⊥ )))

Proof of Theorem ud3lem0c

Step	Hyp	Ref	Expression
1		ni31 242	1 (a →3 b)⊥ = (((a ∪ b⊥ ) ∩ (a ∪ b)) ∩ (a⊥ ∪ (a ∩ b⊥ )))

Syntax hints:   = wb 1  ^⊥ wn 4   ∪ wo 6   ∩ wa 7   →₃ wi3 15

This theorem is referenced by:  ud3lem1a 548  ud3lem1b 549  ud3lem1c 550  ud3lem3a 554  ud3lem3b 555  ud3lem3c 556  ud3lem3 558  u3lem14mp 776

This theorem was proved from axioms:  ax-a1 29  ax-a2 30  ax-r1 34  ax-r2 35  ax-r4 36  ax-r5 37

This theorem depends on definitions:  df-a 39  df-i3 45

metamath.org