Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > ralcom | GIF version |
Description: Commutation of restricted quantifiers. (Contributed by NM, 13-Oct-1999.) (Revised by Mario Carneiro, 14-Oct-2016.) |
Ref | Expression |
---|---|
ralcom | ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝜑 ↔ ∀𝑦 ∈ 𝐵 ∀𝑥 ∈ 𝐴 𝜑) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfcv 2258 | . 2 ⊢ Ⅎ𝑦𝐴 | |
2 | nfcv 2258 | . 2 ⊢ Ⅎ𝑥𝐵 | |
3 | 1, 2 | ralcomf 2569 | 1 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝜑 ↔ ∀𝑦 ∈ 𝐵 ∀𝑥 ∈ 𝐴 𝜑) |
Colors of variables: wff set class |
Syntax hints: ↔ wb 104 ∀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-io 683 ax-5 1408 ax-7 1409 ax-gen 1410 ax-ie1 1454 ax-ie2 1455 ax-8 1467 ax-10 1468 ax-11 1469 ax-i12 1470 ax-bndl 1471 ax-4 1472 ax-17 1491 ax-i9 1495 ax-ial 1499 ax-i5r 1500 ax-ext 2099 |
This theorem depends on definitions: df-bi 116 df-nf 1422 df-sb 1721 df-cleq 2110 df-clel 2113 df-nfc 2247 df-ral 2398 |
This theorem is referenced by: ralcom4 2682 ssint 3757 issod 4211 reusv3 4351 cnvpom 5051 cnvsom 5052 fununi 5161 isocnv2 5681 dfsmo2 6152 ixpiinm 6586 rexfiuz 10729 tgss2 12175 cnmptcom 12394 |
Copyright terms: Public domain | W3C validator |