bianfi - Metamath Proof Explorer

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

Theorem bianfi 966

Description: A wff conjoined with falsehood is false. (Contributed by NM, 21-Jun-1993.) (Proof shortened by Wolf Lammen, 26-Nov-2012.)

**Hypothesis**
Ref	Expression
bianfi.1

**Assertion**
Ref	Expression
bianfi	$/\$

**Proof of Theorem bianfi**
Step	Hyp	Ref	Expression
1		bianfi.1	. 2
2	1	intnan 960	. 2 $/\$
3	1, 2	2false 365	1 $/\$

Colors of variables: wff setvar class

Syntax hints:

wn 3

wb 196 $/\$ wa 384

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-an 386

This theorem is referenced by: in0 3968 opthprc 5167 ind1a 30081