Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > nfra2xy | GIF version |
Description: Not-free given two restricted quantifiers. (Contributed by Jim Kingdon, 20-Aug-2018.) |
Ref | Expression |
---|---|
nfra2xy | ⊢ Ⅎ𝑦∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝜑 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfcv 2312 | . 2 ⊢ Ⅎ𝑦𝐴 | |
2 | nfra1 2501 | . 2 ⊢ Ⅎ𝑦∀𝑦 ∈ 𝐵 𝜑 | |
3 | 1, 2 | nfralxy 2508 | 1 ⊢ Ⅎ𝑦∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝜑 |
Colors of variables: wff set class |
Syntax hints: Ⅎwnf 1453 ∀wral 2448 |
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 1440 ax-7 1441 ax-gen 1442 ax-ie1 1486 ax-ie2 1487 ax-4 1503 ax-17 1519 ax-ial 1527 ax-i5r 1528 ax-ext 2152 |
This theorem depends on definitions: df-bi 116 df-tru 1351 df-nf 1454 df-cleq 2163 df-clel 2166 df-nfc 2301 df-ral 2453 |
This theorem is referenced by: invdisj 3983 reusv3 4445 |
Copyright terms: Public domain | W3C validator |