Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > acsfn2 | Structured version Visualization version Unicode version |
Description: Algebraicity of a two-argument closure condition. (Contributed by Stefan O'Rear, 3-Apr-2015.) |
Ref | Expression |
---|---|
acsfn2 | ACS |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elpwi 4168 | . . . . 5 | |
2 | ralss 3668 | . . . . . 6 | |
3 | ralss 3668 | . . . . . . . 8 | |
4 | r19.21v 2960 | . . . . . . . 8 | |
5 | impexp 462 | . . . . . . . . . 10 | |
6 | vex 3203 | . . . . . . . . . . . 12 | |
7 | vex 3203 | . . . . . . . . . . . 12 | |
8 | 6, 7 | prss 4351 | . . . . . . . . . . 11 |
9 | 8 | imbi1i 339 | . . . . . . . . . 10 |
10 | 5, 9 | bitr3i 266 | . . . . . . . . 9 |
11 | 10 | ralbii 2980 | . . . . . . . 8 |
12 | 3, 4, 11 | 3bitr3g 302 | . . . . . . 7 |
13 | 12 | ralbidv 2986 | . . . . . 6 |
14 | 2, 13 | bitrd 268 | . . . . 5 |
15 | 1, 14 | syl 17 | . . . 4 |
16 | 15 | rabbiia 3185 | . . 3 |
17 | riinrab 4596 | . . 3 | |
18 | 16, 17 | eqtr4i 2647 | . 2 |
19 | mreacs 16319 | . . . 4 ACS Moore | |
20 | 19 | adantr 481 | . . 3 ACS Moore |
21 | riinrab 4596 | . . . . . . 7 | |
22 | 19 | ad2antrr 762 | . . . . . . . 8 ACS Moore |
23 | simpll 790 | . . . . . . . . . . . 12 | |
24 | simprr 796 | . . . . . . . . . . . 12 | |
25 | prssi 4353 | . . . . . . . . . . . . . 14 | |
26 | 25 | ancoms 469 | . . . . . . . . . . . . 13 |
27 | 26 | ad2ant2lr 784 | . . . . . . . . . . . 12 |
28 | prfi 8235 | . . . . . . . . . . . . 13 | |
29 | 28 | a1i 11 | . . . . . . . . . . . 12 |
30 | acsfn 16320 | . . . . . . . . . . . 12 ACS | |
31 | 23, 24, 27, 29, 30 | syl22anc 1327 | . . . . . . . . . . 11 ACS |
32 | 31 | expr 643 | . . . . . . . . . 10 ACS |
33 | 32 | ralimdva 2962 | . . . . . . . . 9 ACS |
34 | 33 | imp 445 | . . . . . . . 8 ACS |
35 | mreriincl 16258 | . . . . . . . 8 ACS Moore ACS ACS | |
36 | 22, 34, 35 | syl2anc 693 | . . . . . . 7 ACS |
37 | 21, 36 | syl5eqelr 2706 | . . . . . 6 ACS |
38 | 37 | ex 450 | . . . . 5 ACS |
39 | 38 | ralimdva 2962 | . . . 4 ACS |
40 | 39 | imp 445 | . . 3 ACS |
41 | mreriincl 16258 | . . 3 ACS Moore ACS ACS | |
42 | 20, 40, 41 | syl2anc 693 | . 2 ACS |
43 | 18, 42 | syl5eqel 2705 | 1 ACS |
Colors of variables: wff setvar class |
Syntax hints: wi 4 wb 196 wa 384 wcel 1990 wral 2912 crab 2916 cin 3573 wss 3574 cpw 4158 cpr 4179 ciin 4521 cfv 5888 cfn 7955 Moorecmre 16242 ACScacs 16245 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-ral 2917 df-rex 2918 df-reu 2919 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-pss 3590 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-tp 4182 df-op 4184 df-uni 4437 df-int 4476 df-iun 4522 df-iin 4523 df-br 4654 df-opab 4713 df-mpt 4730 df-tr 4753 df-id 5024 df-eprel 5029 df-po 5035 df-so 5036 df-fr 5073 df-we 5075 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-pred 5680 df-ord 5726 df-on 5727 df-lim 5728 df-suc 5729 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-ov 6653 df-oprab 6654 df-mpt2 6655 df-om 7066 df-wrecs 7407 df-recs 7468 df-rdg 7506 df-1o 7560 df-oadd 7564 df-er 7742 df-en 7956 df-fin 7959 df-mre 16246 df-mrc 16247 df-acs 16249 |
This theorem is referenced by: submacs 17365 submgmacs 41804 |
Copyright terms: Public domain | W3C validator |