| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > suppssfvg | Unicode version | ||
| Description: Formula building theorem for support restriction, on a function which preserves zero. (Contributed by Stefan O'Rear, 9-Mar-2015.) (Revised by AV, 28-May-2019.) |
| Ref | Expression |
|---|---|
| suppssfv.a |
|
| suppssfv.f |
|
| suppssfv.v |
|
| suppssfv.y |
|
| suppssfvg.d |
|
| Ref | Expression |
|---|---|
| suppssfvg |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | suppssfvg.d |
. . . . . . 7
| |
| 2 | 1 | adantr 276 |
. . . . . 6
|
| 3 | 2 | elexd 2826 |
. . . . 5
|
| 4 | df-supp 6435 |
. . . . . . 7
| |
| 5 | 4 | elmpocl2 6250 |
. . . . . 6
|
| 6 | 5 | adantl 277 |
. . . . 5
|
| 7 | simpl 109 |
. . . . 5
| |
| 8 | eldifsni 3821 |
. . . . . . . . 9
| |
| 9 | suppssfv.v |
. . . . . . . . . . . . 13
| |
| 10 | 9 | elexd 2826 |
. . . . . . . . . . . 12
|
| 11 | 10 | ad4ant23 515 |
. . . . . . . . . . 11
|
| 12 | suppssfv.f |
. . . . . . . . . . . . . . 15
| |
| 13 | fveqeq2 5678 |
. . . . . . . . . . . . . . 15
| |
| 14 | 12, 13 | syl5ibrcom 157 |
. . . . . . . . . . . . . 14
|
| 15 | 14 | necon3d 2456 |
. . . . . . . . . . . . 13
|
| 16 | 15 | ad2antlr 489 |
. . . . . . . . . . . 12
|
| 17 | 16 | imp 124 |
. . . . . . . . . . 11
|
| 18 | eldifsn 3819 |
. . . . . . . . . . 11
| |
| 19 | 11, 17, 18 | sylanbrc 417 |
. . . . . . . . . 10
|
| 20 | 19 | ex 115 |
. . . . . . . . 9
|
| 21 | 8, 20 | syl5 32 |
. . . . . . . 8
|
| 22 | 21 | ss2rabdv 3318 |
. . . . . . 7
|
| 23 | eqid 2232 |
. . . . . . . 8
| |
| 24 | simpll 527 |
. . . . . . . 8
| |
| 25 | simplr 529 |
. . . . . . . 8
| |
| 26 | 23, 24, 25 | mptsuppdifd 6454 |
. . . . . . 7
|
| 27 | eqid 2232 |
. . . . . . . 8
| |
| 28 | suppssfv.y |
. . . . . . . . 9
| |
| 29 | 28 | adantl 277 |
. . . . . . . 8
|
| 30 | 27, 24, 29 | mptsuppdifd 6454 |
. . . . . . 7
|
| 31 | 22, 26, 30 | 3sstr4d 3282 |
. . . . . 6
|
| 32 | suppssfv.a |
. . . . . . 7
| |
| 33 | 32 | adantl 277 |
. . . . . 6
|
| 34 | 31, 33 | sstrd 3247 |
. . . . 5
|
| 35 | 3, 6, 7, 34 | syl21anc 1273 |
. . . 4
|
| 36 | simpr 110 |
. . . 4
| |
| 37 | 35, 36 | sseldd 3238 |
. . 3
|
| 38 | 37 | ex 115 |
. 2
|
| 39 | 38 | ssrdv 3243 |
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-in1 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2205 ax-14 2206 ax-ext 2214 ax-coll 4224 ax-sep 4227 ax-pow 4286 ax-pr 4321 ax-un 4553 ax-setind 4658 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2083 df-mo 2084 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-ne 2413 df-ral 2525 df-rex 2526 df-reu 2527 df-rab 2529 df-v 2814 df-sbc 3042 df-csb 3138 df-dif 3212 df-un 3214 df-in 3216 df-ss 3223 df-pw 3670 df-sn 3694 df-pr 3695 df-op 3697 df-uni 3914 df-iun 3992 df-br 4109 df-opab 4171 df-mpt 4172 df-id 4413 df-xp 4754 df-rel 4755 df-cnv 4756 df-co 4757 df-dm 4758 df-rn 4759 df-res 4760 df-ima 4761 df-iota 5311 df-fun 5353 df-fn 5354 df-f 5355 df-f1 5356 df-fo 5357 df-f1o 5358 df-fv 5359 df-ov 6052 df-oprab 6053 df-mpo 6054 df-supp 6435 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |