| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > isassad | Unicode version | ||
| Description: Sufficient condition for being an associative algebra. (Contributed by Mario Carneiro, 5-Dec-2014.) (Revised by SN, 2-Mar-2025.) |
| Ref | Expression |
|---|---|
| isassad.v |
|
| isassad.f |
|
| isassad.b |
|
| isassad.s |
|
| isassad.t |
|
| isassad.1 |
|
| isassad.2 |
|
| isassad.4 |
|
| isassad.5 |
|
| Ref | Expression |
|---|---|
| isassad |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | isassad.1 |
. . 3
| |
| 2 | isassad.2 |
. . 3
| |
| 3 | 1, 2 | jca 306 |
. 2
|
| 4 | isassad.4 |
. . . . 5
| |
| 5 | isassad.5 |
. . . . 5
| |
| 6 | 4, 5 | jca 306 |
. . . 4
|
| 7 | 6 | ralrimivvva 2633 |
. . 3
|
| 8 | isassad.b |
. . . . 5
| |
| 9 | isassad.f |
. . . . . 6
| |
| 10 | 9 | fveq2d 5697 |
. . . . 5
|
| 11 | 8, 10 | eqtrd 2271 |
. . . 4
|
| 12 | isassad.v |
. . . . 5
| |
| 13 | isassad.t |
. . . . . . . . 9
| |
| 14 | isassad.s |
. . . . . . . . . 10
| |
| 15 | 14 | oveqd 6096 |
. . . . . . . . 9
|
| 16 | eqidd 2239 |
. . . . . . . . 9
| |
| 17 | 13, 15, 16 | oveq123d 6100 |
. . . . . . . 8
|
| 18 | eqidd 2239 |
. . . . . . . . 9
| |
| 19 | 13 | oveqd 6096 |
. . . . . . . . 9
|
| 20 | 14, 18, 19 | oveq123d 6100 |
. . . . . . . 8
|
| 21 | 17, 20 | eqeq12d 2253 |
. . . . . . 7
|
| 22 | eqidd 2239 |
. . . . . . . . 9
| |
| 23 | 14 | oveqd 6096 |
. . . . . . . . 9
|
| 24 | 13, 22, 23 | oveq123d 6100 |
. . . . . . . 8
|
| 25 | 24, 20 | eqeq12d 2253 |
. . . . . . 7
|
| 26 | 21, 25 | anbi12d 477 |
. . . . . 6
|
| 27 | 12, 26 | raleqbidv 2765 |
. . . . 5
|
| 28 | 12, 27 | raleqbidv 2765 |
. . . 4
|
| 29 | 11, 28 | raleqbidv 2765 |
. . 3
|
| 30 | 7, 29 | mpbid 147 |
. 2
|
| 31 | eqid 2238 |
. . 3
| |
| 32 | eqid 2238 |
. . 3
| |
| 33 | eqid 2238 |
. . 3
| |
| 34 | eqid 2238 |
. . 3
| |
| 35 | eqid 2238 |
. . 3
| |
| 36 | 31, 32, 33, 34, 35 | isassa 14985 |
. 2
|
| 37 | 3, 30, 36 | sylanbrc 421 |
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 106 ax-ia2 107 ax-ia3 108 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4247 ax-pow 4309 ax-pr 4344 ax-un 4576 ax-cnex 8264 ax-resscn 8265 ax-1re 8267 ax-addrcl 8270 |
| This theorem depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ral 2533 df-rex 2534 df-rab 2537 df-v 2823 df-sbc 3052 df-un 3224 df-in 3226 df-ss 3233 df-pw 3690 df-sn 3714 df-pr 3715 df-op 3717 df-uni 3934 df-int 3969 df-br 4129 df-opab 4191 df-mpt 4192 df-id 4436 df-xp 4778 df-rel 4779 df-cnv 4780 df-co 4781 df-dm 4782 df-rn 4783 df-res 4784 df-iota 5335 df-fun 5377 df-fn 5378 df-fv 5383 df-ov 6082 df-inn 9288 df-2 9346 df-3 9347 df-4 9348 df-5 9349 df-6 9350 df-ndx 13338 df-slot 13339 df-mulr 13428 df-sca 13430 df-vsca 13431 df-assa 14982 |
| This theorem is referenced by: issubassa3 14995 |
| Copyright terms: Public domain | W3C validator |