Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > ralcom3 | GIF version |
Description: A commutative law for restricted quantifiers that swaps the domain of the restriction. (Contributed by NM, 22-Feb-2004.) |
Ref | Expression |
---|---|
ralcom3 | ⊢ (∀𝑥 ∈ 𝐴 (𝑥 ∈ 𝐵 → 𝜑) ↔ ∀𝑥 ∈ 𝐵 (𝑥 ∈ 𝐴 → 𝜑)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | pm2.04 76 | . . 3 ⊢ ((𝑥 ∈ 𝐴 → (𝑥 ∈ 𝐵 → 𝜑)) → (𝑥 ∈ 𝐵 → (𝑥 ∈ 𝐴 → 𝜑))) | |
2 | 1 | ralimi2 2381 | . 2 ⊢ (∀𝑥 ∈ 𝐴 (𝑥 ∈ 𝐵 → 𝜑) → ∀𝑥 ∈ 𝐵 (𝑥 ∈ 𝐴 → 𝜑)) |
3 | pm2.04 76 | . . 3 ⊢ ((𝑥 ∈ 𝐵 → (𝑥 ∈ 𝐴 → 𝜑)) → (𝑥 ∈ 𝐴 → (𝑥 ∈ 𝐵 → 𝜑))) | |
4 | 3 | ralimi2 2381 | . 2 ⊢ (∀𝑥 ∈ 𝐵 (𝑥 ∈ 𝐴 → 𝜑) → ∀𝑥 ∈ 𝐴 (𝑥 ∈ 𝐵 → 𝜑)) |
5 | 2, 4 | impbii 117 | 1 ⊢ (∀𝑥 ∈ 𝐴 (𝑥 ∈ 𝐵 → 𝜑) ↔ ∀𝑥 ∈ 𝐵 (𝑥 ∈ 𝐴 → 𝜑)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ↔ wb 98 ∈ wcel 1393 ∀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-gen 1338 |
This theorem depends on definitions: df-bi 110 df-ral 2311 |
This theorem is referenced by: zfregfr 4298 |
Copyright terms: Public domain | W3C validator |