Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > ralpr | Unicode version |
Description: Convert a quantification over a pair to a conjunction. (Contributed by NM, 3-Jun-2007.) (Revised by Mario Carneiro, 23-Apr-2015.) |
Ref | Expression |
---|---|
ralpr.1 | |
ralpr.2 | |
ralpr.3 | |
ralpr.4 |
Ref | Expression |
---|---|
ralpr |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ralpr.1 | . 2 | |
2 | ralpr.2 | . 2 | |
3 | ralpr.3 | . . 3 | |
4 | ralpr.4 | . . 3 | |
5 | 3, 4 | ralprg 3627 | . 2 |
6 | 1, 2, 5 | mp2an 423 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wa 103 wb 104 wceq 1343 wcel 2136 wral 2444 cvv 2726 cpr 3577 |
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 1435 ax-7 1436 ax-gen 1437 ax-ie1 1481 ax-ie2 1482 ax-8 1492 ax-10 1493 ax-11 1494 ax-i12 1495 ax-bndl 1497 ax-4 1498 ax-17 1514 ax-i9 1518 ax-ial 1522 ax-i5r 1523 ax-ext 2147 |
This theorem depends on definitions: df-bi 116 df-3an 970 df-tru 1346 df-nf 1449 df-sb 1751 df-clab 2152 df-cleq 2158 df-clel 2161 df-nfc 2297 df-ral 2449 df-v 2728 df-sbc 2952 df-un 3120 df-sn 3582 df-pr 3583 |
This theorem is referenced by: fzprval 10017 |
Copyright terms: Public domain | W3C validator |