Theorem 2vwomr1a 363

Description: 2-variable WOML rule. (Contributed by NM, 13-Nov-1998.)

Hypothesis

Ref	Expression
2vwomr1a.1	(a →1 b) = 1

Assertion

Ref	Expression
2vwomr1a	(a →2 b) = 1

Proof of Theorem 2vwomr1a

Step	Hyp	Ref	Expression
1		df-i2 45	. 2 (a →2 b) = (b ∪ (a⊥ ∩ b⊥ ))
2		df-i1 44	. . . . 5 (a →1 b) = (a⊥ ∪ (a ∩ b))
3	2	ax-r1 35	. . . 4 (a⊥ ∪ (a ∩ b)) = (a →1 b)
4		2vwomr1a.1	. . . 4 (a →1 b) = 1
5	3, 4	ax-r2 36	. . 3 (a⊥ ∪ (a ∩ b)) = 1
6	5	ax-wom 361	. 2 (b ∪ (a⊥ ∩ b⊥ )) = 1
7	1, 6	ax-r2 36	1 (a →2 b) = 1

This proof depends on syntax axioms:   = wb 1  ^⊥ wn 4   ∪ wo 6   ∩ wa 7  1wt 8   →₁ wi1 12   →₂ wi2 13

This proof depends on axioms:  ax-r1 35  ax-r2 36  ax-wom 361

This proof depends on definitions:  df-i1 44  df-i2 45

This theorem is used by:  wr5-2v  366  lem3.4.3  1076  lem3.4.5  1078