| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > raaanv | GIF version | ||
| Description: Rearrange restricted quantifiers. (Contributed by NM, 11-Mar-1997.) |
| Ref | Expression |
|---|---|
| raaanv | ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝜑 ∧ 𝜓) ↔ (∀𝑥 ∈ 𝐴 𝜑 ∧ ∀𝑦 ∈ 𝐴 𝜓)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nfv 1576 | . 2 ⊢ Ⅎ𝑦𝜑 | |
| 2 | nfv 1576 | . 2 ⊢ Ⅎ𝑥𝜓 | |
| 3 | 1, 2 | raaan 3600 | 1 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝜑 ∧ 𝜓) ↔ (∀𝑥 ∈ 𝐴 𝜑 ∧ ∀𝑦 ∈ 𝐴 𝜓)) |
| Colors of variables: wff set class |
| Syntax hints: ∧ wa 104 ↔ wb 105 ∀wral 2510 |
| 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 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-ext 2213 |
| This theorem depends on definitions: df-bi 117 df-tru 1400 df-nf 1509 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ral 2515 |
| This theorem is referenced by: reusv3i 4556 f1mpt 5911 |
| Copyright terms: Public domain | W3C validator |