rb-bijust - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > rb-bijust		Structured version Visualization version Unicode version

Theorem rb-bijust 1674

Description: Justification for rb-imdf 1675. (Contributed by Anthony Hart, 17-Aug-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

**Assertion**
Ref	Expression
rb-bijust	$\/$ $\/$ $\/$

**Proof of Theorem rb-bijust**
Step	Hyp	Ref	Expression
1		dfbi1 203	. 2
2		imor 428	. . . 4 $\/$
3		imor 428	. . . . 5 $\/$
4	3	notbii 310	. . . 4 $\/$
5	2, 4	imbi12i 340	. . 3 $\/$ $\/$
6	5	notbii 310	. 2 $\/$ $\/$
7		pm4.62 435	. . 3 $\/$ $\/$ $\/$ $\/$ $\/$
8	7	notbii 310	. 2 $\/$ $\/$ $\/$ $\/$ $\/$
9	1, 6, 8	3bitri 286	1 $\/$ $\/$ $\/$

Colors of variables: wff setvar class

Syntax hints:

wn 3

wi 4

wb 196 $\/$ wo 383

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8

This theorem depends on definitions: df-bi 197 df-or 385

This theorem is referenced by: rb-imdf 1675

W3C validator