| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > frirrg | Unicode version | ||
| Description: A well-founded relation
is irreflexive. This is the case where |
| Ref | Expression |
|---|---|
| frirrg |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpr 110 |
. . . 4
| |
| 2 | simpl3 1033 |
. . . 4
| |
| 3 | 1, 2 | sseldd 3249 |
. . 3
|
| 4 | neldifsnd 3840 |
. . 3
| |
| 5 | 3, 4 | pm2.65da 671 |
. 2
|
| 6 | simplr 533 |
. . . . . 6
| |
| 7 | simplr 533 |
. . . . . . . . . . 11
| |
| 8 | 7 | ad2antrr 492 |
. . . . . . . . . 10
|
| 9 | simpr 110 |
. . . . . . . . . 10
| |
| 10 | 8, 9 | breqtrrd 4153 |
. . . . . . . . 9
|
| 11 | breq1 4128 |
. . . . . . . . . . 11
| |
| 12 | eleq1 2301 |
. . . . . . . . . . 11
| |
| 13 | 11, 12 | imbi12d 234 |
. . . . . . . . . 10
|
| 14 | simplr 533 |
. . . . . . . . . 10
| |
| 15 | simpll3 1069 |
. . . . . . . . . . 11
| |
| 16 | 15 | ad2antrr 492 |
. . . . . . . . . 10
|
| 17 | 13, 14, 16 | rspcdva 2934 |
. . . . . . . . 9
|
| 18 | 10, 17 | mpd 13 |
. . . . . . . 8
|
| 19 | neldifsnd 3840 |
. . . . . . . 8
| |
| 20 | 18, 19 | pm2.65da 671 |
. . . . . . 7
|
| 21 | velsn 3722 |
. . . . . . 7
| |
| 22 | 20, 21 | sylnibr 688 |
. . . . . 6
|
| 23 | 6, 22 | eldifd 3230 |
. . . . 5
|
| 24 | 23 | ex 115 |
. . . 4
|
| 25 | 24 | ralrimiva 2623 |
. . 3
|
| 26 | df-frind 4472 |
. . . . . . . 8
| |
| 27 | df-frfor 4471 |
. . . . . . . . 9
| |
| 28 | 27 | albii 1523 |
. . . . . . . 8
|
| 29 | 26, 28 | bitri 184 |
. . . . . . 7
|
| 30 | 29 | biimpi 120 |
. . . . . 6
|
| 31 | 30 | 3ad2ant1 1049 |
. . . . 5
|
| 32 | difexg 4270 |
. . . . . . 7
| |
| 33 | eleq2 2302 |
. . . . . . . . . . . . 13
| |
| 34 | 33 | imbi2d 230 |
. . . . . . . . . . . 12
|
| 35 | 34 | ralbidv 2550 |
. . . . . . . . . . 11
|
| 36 | eleq2 2302 |
. . . . . . . . . . 11
| |
| 37 | 35, 36 | imbi12d 234 |
. . . . . . . . . 10
|
| 38 | 37 | ralbidv 2550 |
. . . . . . . . 9
|
| 39 | sseq2 3272 |
. . . . . . . . 9
| |
| 40 | 38, 39 | imbi12d 234 |
. . . . . . . 8
|
| 41 | 40 | spcgv 2912 |
. . . . . . 7
|
| 42 | 32, 41 | syl 14 |
. . . . . 6
|
| 43 | 42 | 3ad2ant2 1050 |
. . . . 5
|
| 44 | 31, 43 | mpd 13 |
. . . 4
|
| 45 | 44 | adantr 276 |
. . 3
|
| 46 | 25, 45 | mpd 13 |
. 2
|
| 47 | 5, 46 | mtand 675 |
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 623 ax-in2 624 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-ext 2220 ax-sep 4244 |
| This theorem depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-nf 1514 df-sb 1816 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-ral 2533 df-v 2823 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-sn 3711 df-pr 3712 df-op 3714 df-br 4126 df-frfor 4471 df-frind 4472 |
| This theorem is referenced by: efrirr 4493 wepo 4499 wetriext 4719 |
| Copyright terms: Public domain | W3C validator |