![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > intnanrd | Unicode version |
Description: Introduction of conjunct inside of a contradiction. (Contributed by NM, 10-Jul-2005.) |
Ref | Expression |
---|---|
intnand.1 |
![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Ref | Expression |
---|---|
intnanrd |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | intnand.1 |
. 2
![]() ![]() ![]() ![]() ![]() ![]() ![]() | |
2 | simpl 108 |
. 2
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | |
3 | 1, 2 | nsyl 618 |
1
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Colors of variables: wff set class |
Syntax hints: ![]() ![]() ![]() |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-in1 604 ax-in2 605 |
This theorem is referenced by: dcan 919 bianfd 933 frecabcl 6304 frecsuclem 6311 xrrebnd 9632 fzpreddisj 9882 iseqf1olemqk 10298 gcdsupex 11682 gcdsupcl 11683 nndvdslegcd 11690 divgcdnn 11699 sqgcd 11753 coprm 11858 ctiunctlemudc 11986 |
Copyright terms: Public domain | W3C validator |