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 2178 | . 2 ⊢ Ⅎ𝑦𝐴 | |
2 | nfra1 2355 | . 2 ⊢ Ⅎ𝑦∀𝑦 ∈ 𝐵 𝜑 | |
3 | 1, 2 | nfralxy 2360 | 1 ⊢ Ⅎ𝑦∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝜑 |
Colors of variables: wff set class |
Syntax hints: Ⅎwnf 1349 ∀wral 2306 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 99 ax-ia2 100 ax-ia3 101 ax-5 1336 ax-7 1337 ax-gen 1338 ax-ie1 1382 ax-ie2 1383 ax-4 1400 ax-17 1419 ax-ial 1427 ax-i5r 1428 ax-ext 2022 |
This theorem depends on definitions: df-bi 110 df-tru 1246 df-nf 1350 df-cleq 2033 df-clel 2036 df-nfc 2167 df-ral 2311 |
This theorem is referenced by: invdisj 3759 reusv3 4192 |
Copyright terms: Public domain | W3C validator |