| Quantum Logic Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Lemma for biconditional commutation law. |
| Ref | Expression |
|---|---|
| comanblem2 |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dfb 86 |
. . . 4
| |
| 2 | dfb 86 |
. . . 4
| |
| 3 | 1, 2 | 2an 72 |
. . 3
|
| 4 | 3 | lan 70 |
. 2
|
| 5 | comanr1 446 |
. . . . . 6
| |
| 6 | comanr1 446 |
. . . . . . 7
| |
| 7 | 6 | comcom6 441 |
. . . . . 6
|
| 8 | 5, 7 | fh1 451 |
. . . . 5
|
| 9 | anass 69 |
. . . . . . . 8
| |
| 10 | 9 | ax-r1 34 |
. . . . . . 7
|
| 11 | anidm 103 |
. . . . . . . 8
| |
| 12 | 11 | ran 71 |
. . . . . . 7
|
| 13 | 10, 12 | ax-r2 35 |
. . . . . 6
|
| 14 | dff 93 |
. . . . . . . . 9
| |
| 15 | 14 | ran 71 |
. . . . . . . 8
|
| 16 | 15 | ax-r1 34 |
. . . . . . 7
|
| 17 | anass 69 |
. . . . . . 7
| |
| 18 | an0r 101 |
. . . . . . 7
| |
| 19 | 16, 17, 18 | 3tr2 61 |
. . . . . 6
|
| 20 | 13, 19 | 2or 67 |
. . . . 5
|
| 21 | or0 94 |
. . . . 5
| |
| 22 | 8, 20, 21 | 3tr 62 |
. . . 4
|
| 23 | comanr1 446 |
. . . . . 6
| |
| 24 | comanr1 446 |
. . . . . . 7
| |
| 25 | 24 | comcom6 441 |
. . . . . 6
|
| 26 | 23, 25 | fh1 451 |
. . . . 5
|
| 27 | anass 69 |
. . . . . . . 8
| |
| 28 | 27 | ax-r1 34 |
. . . . . . 7
|
| 29 | anidm 103 |
. . . . . . . 8
| |
| 30 | 29 | ran 71 |
. . . . . . 7
|
| 31 | 28, 30 | ax-r2 35 |
. . . . . 6
|
| 32 | dff 93 |
. . . . . . . . 9
| |
| 33 | 32 | ran 71 |
. . . . . . . 8
|
| 34 | 33 | ax-r1 34 |
. . . . . . 7
|
| 35 | anass 69 |
. . . . . . 7
| |
| 36 | 34, 35, 18 | 3tr2 61 |
. . . . . 6
|
| 37 | 31, 36 | 2or 67 |
. . . . 5
|
| 38 | or0 94 |
. . . . 5
| |
| 39 | 26, 37, 38 | 3tr 62 |
. . . 4
|
| 40 | 22, 39 | 2an 72 |
. . 3
|
| 41 | an4 78 |
. . 3
| |
| 42 | anandir 107 |
. . 3
| |
| 43 | 40, 41, 42 | 3tr1 60 |
. 2
|
| 44 | 4, 43 | ax-r2 35 |
1
|
| Colors of variables: term |
| Syntax hints: |
| This theorem is referenced by: comanb 854 |
| This theorem was proved from axioms: ax-a1 29 ax-a2 30 ax-a3 31 ax-a4 32 ax-a5 33 ax-r1 34 ax-r2 35 ax-r4 36 ax-r5 37 ax-r3 421 |
| This theorem depends on definitions: df-b 38 df-a 39 df-t 40 df-f 41 df-le1 122 df-le2 123 df-c1 124 df-c2 125 |