[Lattice L46-7]Home PageHome Quantum Logic Explorer < Previous   Next >
Related theorems
Unicode version

Theorem wcon3 201
Description: Weak contraposition.
Hypothesis
Ref Expression
wcon3.1 (a_|_ == b) = 1
Assertion
Ref Expression
wcon3 (a == b_|_) = 1

Proof of Theorem wcon3
StepHypRef Expression
1 ax-a1 29 . . . . 5 b = b_|__|_
21ax-r1 34 . . . 4 b_|__|_ = b
32lbi 89 . . 3 (a_|_ == b_|__|_) = (a_|_ == b)
4 wcon3.1 . . 3 (a_|_ == b) = 1
53, 4ax-r2 35 . 2 (a_|_ == b_|__|_) = 1
65wcon1 199 1 (a == b_|_) = 1
Colors of variables: term
Syntax hints:   = wb 1  _|_wn 4   == tb 5  1wt 9
This theorem is referenced by:  wlecon 377  wcomd 400  wfh1 405
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