| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > nfra2xy | Unicode version | ||
| Description: Not-free given two restricted quantifiers. (Contributed by Jim Kingdon, 20-Aug-2018.) |
| Ref | Expression |
|---|---|
| nfra2xy |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nfcv 2348 |
. 2
| |
| 2 | nfra1 2537 |
. 2
| |
| 3 | 1, 2 | nfralxy 2544 |
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-5 1470 ax-7 1471 ax-gen 1472 ax-ie1 1516 ax-ie2 1517 ax-4 1533 ax-17 1549 ax-ial 1557 ax-i5r 1558 ax-ext 2187 |
| This theorem depends on definitions: df-bi 117 df-tru 1376 df-nf 1484 df-cleq 2198 df-clel 2201 df-nfc 2337 df-ral 2489 |
| This theorem is referenced by: invdisj 4038 reusv3 4507 |
| Copyright terms: Public domain | W3C validator |