Theorem lbi 89

Description: Introduce biconditional to the left.

Hypothesis

Ref	Expression
lbi.1	a = b

Assertion

Ref	Expression
lbi	(c == a) = (c == b)

Proof of Theorem lbi

Step	Hyp	Ref	Expression
1		lbi.1	. . . 4 a = b
2	1	lan 70	. . 3 (c ^ a) = (c ^ b)
3	1	ax-r4 36	. . . 4 a_|_ = b_|_
4	3	lan 70	. . 3 (c_|_ ^ a_|_) = (c_|_ ^ b_|_)
5	2, 4	2or 67	. 2 ((c ^ a) v (c_|_ ^ a_|_)) = ((c ^ b) v (c_|_ ^ b_|_))
6		dfb 86	. 2 (c == a) = ((c ^ a) v (c_|_ ^ a_|_))
7		dfb 86	. 2 (c == b) = ((c ^ b) v (c_|_ ^ b_|_))
8	5, 6, 7	3tr1 60	1 (c == a) = (c == b)

Syntax hints:   = wb 1  _|_wn 4   == tb 5   v wo 6   ^ wa 7

This theorem is referenced by:  rbi 90  2bi 91  wcon3 201  wwoml2 204  nom55 328

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-b 38  df-a 39

metamath.org