Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > raldifb | Structured version Visualization version GIF version |
Description: Restricted universal quantification on a class difference in terms of an implication. (Contributed by Alexander van der Vekens, 3-Jan-2018.) |
Ref | Expression |
---|---|
raldifb | ⊢ (∀𝑥 ∈ 𝐴 (𝑥 ∉ 𝐵 → 𝜑) ↔ ∀𝑥 ∈ (𝐴 ∖ 𝐵)𝜑) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | impexp 461 | . . 3 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝑥 ∉ 𝐵) → 𝜑) ↔ (𝑥 ∈ 𝐴 → (𝑥 ∉ 𝐵 → 𝜑))) | |
2 | df-nel 2783 | . . . . . 6 ⊢ (𝑥 ∉ 𝐵 ↔ ¬ 𝑥 ∈ 𝐵) | |
3 | 2 | anbi2i 726 | . . . . 5 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑥 ∉ 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐵)) |
4 | eldif 3550 | . . . . 5 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐵)) | |
5 | 3, 4 | bitr4i 266 | . . . 4 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑥 ∉ 𝐵) ↔ 𝑥 ∈ (𝐴 ∖ 𝐵)) |
6 | 5 | imbi1i 338 | . . 3 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝑥 ∉ 𝐵) → 𝜑) ↔ (𝑥 ∈ (𝐴 ∖ 𝐵) → 𝜑)) |
7 | 1, 6 | bitr3i 265 | . 2 ⊢ ((𝑥 ∈ 𝐴 → (𝑥 ∉ 𝐵 → 𝜑)) ↔ (𝑥 ∈ (𝐴 ∖ 𝐵) → 𝜑)) |
8 | 7 | ralbii2 2961 | 1 ⊢ (∀𝑥 ∈ 𝐴 (𝑥 ∉ 𝐵 → 𝜑) ↔ ∀𝑥 ∈ (𝐴 ∖ 𝐵)𝜑) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 195 ∧ wa 383 ∈ wcel 1977 ∉ wnel 2781 ∀wral 2896 ∖ cdif 3537 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-nel 2783 df-ral 2901 df-v 3175 df-dif 3543 |
This theorem is referenced by: raldifsnb 4266 coprmproddvdslem 15214 cusgrares 26001 2spotdisj 26588 poimirlem26 32605 2wspdisj 41165 aacllem 42356 |
Copyright terms: Public domain | W3C validator |