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 2282 | . 2 ⊢ Ⅎ𝑦𝐴 | |
2 | nfcv 2282 | . 2 ⊢ Ⅎ𝑥𝐵 | |
3 | 1, 2 | ralcomf 2595 | 1 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝜑 ↔ ∀𝑦 ∈ 𝐵 ∀𝑥 ∈ 𝐴 𝜑) |
Colors of variables: wff set class |
Syntax hints: ↔ wb 104 ∀wral 2417 |
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 1424 ax-7 1425 ax-gen 1426 ax-ie1 1470 ax-ie2 1471 ax-8 1483 ax-10 1484 ax-11 1485 ax-i12 1486 ax-bndl 1487 ax-4 1488 ax-17 1507 ax-i9 1511 ax-ial 1515 ax-i5r 1516 ax-ext 2122 |
This theorem depends on definitions: df-bi 116 df-nf 1438 df-sb 1737 df-cleq 2133 df-clel 2136 df-nfc 2271 df-ral 2422 |
This theorem is referenced by: ralcom4 2711 ssint 3795 issod 4249 reusv3 4389 cnvpom 5089 cnvsom 5090 fununi 5199 isocnv2 5721 dfsmo2 6192 ixpiinm 6626 rexfiuz 10793 tgss2 12287 cnmptcom 12506 |
Copyright terms: Public domain | W3C validator |