![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > raldifsnb | Structured version Visualization version GIF version |
Description: Restricted universal quantification on a class difference with a singleton in terms of an implication. (Contributed by Alexander van der Vekens, 26-Jan-2018.) |
Ref | Expression |
---|---|
raldifsnb | ⊢ (∀𝑥 ∈ 𝐴 (𝑥 ≠ 𝑌 → 𝜑) ↔ ∀𝑥 ∈ (𝐴 ∖ {𝑌})𝜑) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | velsn 4226 | . . . . . 6 ⊢ (𝑥 ∈ {𝑌} ↔ 𝑥 = 𝑌) | |
2 | nnel 2935 | . . . . . 6 ⊢ (¬ 𝑥 ∉ {𝑌} ↔ 𝑥 ∈ {𝑌}) | |
3 | nne 2827 | . . . . . 6 ⊢ (¬ 𝑥 ≠ 𝑌 ↔ 𝑥 = 𝑌) | |
4 | 1, 2, 3 | 3bitr4ri 293 | . . . . 5 ⊢ (¬ 𝑥 ≠ 𝑌 ↔ ¬ 𝑥 ∉ {𝑌}) |
5 | 4 | con4bii 310 | . . . 4 ⊢ (𝑥 ≠ 𝑌 ↔ 𝑥 ∉ {𝑌}) |
6 | 5 | imbi1i 338 | . . 3 ⊢ ((𝑥 ≠ 𝑌 → 𝜑) ↔ (𝑥 ∉ {𝑌} → 𝜑)) |
7 | 6 | ralbii 3009 | . 2 ⊢ (∀𝑥 ∈ 𝐴 (𝑥 ≠ 𝑌 → 𝜑) ↔ ∀𝑥 ∈ 𝐴 (𝑥 ∉ {𝑌} → 𝜑)) |
8 | raldifb 3783 | . 2 ⊢ (∀𝑥 ∈ 𝐴 (𝑥 ∉ {𝑌} → 𝜑) ↔ ∀𝑥 ∈ (𝐴 ∖ {𝑌})𝜑) | |
9 | 7, 8 | bitri 264 | 1 ⊢ (∀𝑥 ∈ 𝐴 (𝑥 ≠ 𝑌 → 𝜑) ↔ ∀𝑥 ∈ (𝐴 ∖ {𝑌})𝜑) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 196 = wceq 1523 ∈ wcel 2030 ≠ wne 2823 ∉ wnel 2926 ∀wral 2941 ∖ cdif 3604 {csn 4210 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1762 ax-4 1777 ax-5 1879 ax-6 1945 ax-7 1981 ax-9 2039 ax-10 2059 ax-11 2074 ax-12 2087 ax-13 2282 ax-ext 2631 |
This theorem depends on definitions: df-bi 197 df-or 384 df-an 385 df-tru 1526 df-ex 1745 df-nf 1750 df-sb 1938 df-clab 2638 df-cleq 2644 df-clel 2647 df-nfc 2782 df-ne 2824 df-nel 2927 df-ral 2946 df-v 3233 df-dif 3610 df-sn 4211 |
This theorem is referenced by: dff14b 6568 |
Copyright terms: Public domain | W3C validator |