Theorem falxorfal 1359

Description: A \/_ identity. (Contributed by David A. Wheeler, 2-Mar-2018.)

Assertion

Ref	Expression
falxorfal	|- ( ( F. \/_ F. ) <-> F. )

Proof of Theorem falxorfal

Step	Hyp	Ref	Expression
1		df-xor 1313	. 2 |- ( ( F. \/_ F. ) <-> ( ( F. \/ F. ) /\ -. ( F. /\ F. ) ) )
2		oridm 710	. . 3 |- ( ( F. \/ F. ) <-> F. )
3		notfal 1351	. . . 4 |- ( -. F. <-> T. )
4		anidm 389	. . . 4 |- ( ( F. /\ F. ) <-> F. )
5	3, 4	xchnxbir 642	. . 3 |- ( -. ( F. /\ F. ) <-> T. )
6	2, 5	anbi12i 449	. 2 |- ( ( ( F. \/ F. ) /\ -. ( F. /\ F. ) ) <-> ( F. /\ T. ) )
7		falantru 1340	. 2 |- ( ( F. /\ T. ) <-> F. )
8	1, 6, 7	3bitri 205	1 |- ( ( F. \/_ F. ) <-> F. )

Syntax hints:   -. wn 3   /\ wa 103   <-> wb 104   \/ wo 665   T. wtru 1291   F. wfal 1295   \/_ wxo 1312

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 580  ax-in2 581  ax-io 666

This theorem depends on definitions:  df-bi 116  df-tru 1293  df-fal 1296  df-xor 1313

This theorem is referenced by: (None)