Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > ralsn | Unicode version |
Description: Convert a quantification over a singleton to a substitution. (Contributed by NM, 27-Apr-2009.) |
Ref | Expression |
---|---|
ralsn.1 | |
ralsn.2 |
Ref | Expression |
---|---|
ralsn |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ralsn.1 | . 2 | |
2 | ralsn.2 | . . 3 | |
3 | 2 | ralsng 3599 | . 2 |
4 | 1, 3 | ax-mp 5 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wb 104 wceq 1335 wcel 2128 wral 2435 cvv 2712 csn 3560 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 699 ax-5 1427 ax-7 1428 ax-gen 1429 ax-ie1 1473 ax-ie2 1474 ax-8 1484 ax-10 1485 ax-11 1486 ax-i12 1487 ax-bndl 1489 ax-4 1490 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2139 |
This theorem depends on definitions: df-bi 116 df-3an 965 df-tru 1338 df-nf 1441 df-sb 1743 df-clab 2144 df-cleq 2150 df-clel 2153 df-nfc 2288 df-ral 2440 df-v 2714 df-sbc 2938 df-sn 3566 |
This theorem is referenced by: tfr0dm 6263 elixpsn 6673 finomni 7066 nninfsellemdc 13544 |
Copyright terms: Public domain | W3C validator |