| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > ralss | Unicode version | ||
| Description: Restricted universal quantification on a subset in terms of superset. (Contributed by Stefan O'Rear, 3-Apr-2015.) |
| Ref | Expression |
|---|---|
| ralss |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ssel 2993 |
. . . . 5
| |
| 2 | 1 | pm4.71rd 386 |
. . . 4
|
| 3 | 2 | imbi1d 229 |
. . 3
|
| 4 | impexp 259 |
. . 3
| |
| 5 | 3, 4 | syl6bb 194 |
. 2
|
| 6 | 5 | ralbidv2 2370 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-5 1376 ax-7 1377 ax-gen 1378 ax-ie1 1422 ax-ie2 1423 ax-8 1435 ax-11 1437 ax-4 1440 ax-17 1459 ax-i9 1463 ax-ial 1467 ax-i5r 1468 ax-ext 2063 |
| This theorem depends on definitions: df-bi 115 df-nf 1390 df-sb 1686 df-clab 2068 df-cleq 2074 df-clel 2077 df-ral 2353 df-in 2979 df-ss 2986 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |