Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > ralidm | Unicode version |
Description: Idempotent law for restricted quantifier. (Contributed by NM, 28-Mar-1997.) |
Ref | Expression |
---|---|
ralidm |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfra1 2443 | . . 3 | |
2 | anidm 393 | . . . 4 | |
3 | rsp2 2459 | . . . 4 | |
4 | 2, 3 | syl5bir 152 | . . 3 |
5 | 1, 4 | ralrimi 2480 | . 2 |
6 | ax-1 6 | . . . 4 | |
7 | nfra1 2443 | . . . . 5 | |
8 | 7 | 19.23 1641 | . . . 4 |
9 | 6, 8 | sylibr 133 | . . 3 |
10 | df-ral 2398 | . . 3 | |
11 | 9, 10 | sylibr 133 | . 2 |
12 | 5, 11 | impbii 125 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wa 103 wb 104 wal 1314 wex 1453 wcel 1465 wral 2393 |
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-5 1408 ax-gen 1410 ax-ie1 1454 ax-ie2 1455 ax-4 1472 ax-ial 1499 ax-i5r 1500 |
This theorem depends on definitions: df-bi 116 df-nf 1422 df-ral 2398 |
This theorem is referenced by: issref 4891 cnvpom 5051 |
Copyright terms: Public domain | W3C validator |