| Quantum Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > QLE Home > Th. List > wancom | GIF version | ||
| Description: Commutative law. (Contributed by NM, 27-Sep-1997.) |
| Ref | Expression |
|---|---|
| wancom | ((a ∩ b) ≡ (b ∩ a)) = 1 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ancom 74 | . 2 (a ∩ b) = (b ∩ a) | |
| 2 | 1 | bi1 118 | 1 ((a ∩ b) ≡ (b ∩ a)) = 1 |
| Colors of variables: term |
| Syntax hints: = wb 1 ≡ tb 5 ∩ wa 7 1wt 8 |
| This theorem was proved from axioms: ax-a1 30 ax-a2 31 ax-a5 34 ax-r1 35 ax-r2 36 ax-r4 37 ax-r5 38 |
| This theorem depends on definitions: df-b 39 df-a 40 df-t 41 df-f 42 |
| This theorem is referenced by: wleao 377 wddi2 1108 wdid0id5 1111 wdid0id1 1112 wdid0id2 1113 wdid0id3 1114 |
| Copyright terms: Public domain | W3C validator |