| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > anidm | Unicode version | ||
| Description: Idempotent law for conjunction. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Wolf Lammen, 14-Mar-2014.) |
| Ref | Expression |
|---|---|
| anidm |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | pm4.24 399 |
. 2
| |
| 2 | 1 | bicomi 132 |
1
|
| Colors of variables: wff set class |
| This proof depends on syntax axioms:
|
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 |
| This proof depends on definitions: df-bi 117 |
| This theorem is used by: anidmdbi 402 anandi 598 anandir 599 truantru 1450 falanfal 1453 truxortru 1468 truxorfal 1469 falxortru 1470 falxorfal 1471 sbnf2 2041 2eu4 2180 inidm 3440 ralidm 3628 opcom 4393 opeqsn 4395 poirr 4454 rnxpid 5225 xp11m 5229 fununi 5452 brprcneu 5691 erinxp 6888 dom2lem 7064 dmaddpi 7698 dmmulpi 7699 enq0ref 7806 enq0tr 7807 msqap0 9004 expap0 11026 sqap0 11063 xrmaxiflemcom 12039 gcddvds 12764 isnsg2 14064 eqger 14085 xmeter 15679 clwwlkn2 16884 2alsraln0idm 17383 |
| Copyright terms: Public domain | W3C validator |