| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > notsep | Structured version Visualization version GIF version | ||
| Description: In the Separation Scheme sepgi 5259, we require that 𝑦 not occur in 𝜑 (which can be generalized to "not be free in"). That requirement is necessary: notsep 5333, which requires only ax-ext 2734 and ax-nul 5268 on top of first-order logic, derives *non*-existence of a "separating set" for specific values of the containing set 𝐴 and of the separating condition 𝜑. Therefore, from the axioms required by notsep 5333 and an overly strong axiom of separation without the requirement that 𝑦 not occur in 𝜑, we could derive ⊥, a contradiction. (Contributed by NM, 8-Feb-2006.) (Proof shortened by BJ, 18-Nov-2023.) |
| Ref | Expression |
|---|---|
| notsep.1 | ⊢ 𝐴 = {∅} |
| notsep.2 | ⊢ (𝜑 ↔ ¬ 𝑥 ∈ 𝑦) |
| Ref | Expression |
|---|---|
| notsep | ⊢ ¬ ∃𝑦∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝐴 ∧ 𝜑)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | notsep.1 | . . . . . 6 ⊢ 𝐴 = {∅} | |
| 2 | 0ex 5269 | . . . . . . 7 ⊢ ∅ ∈ V | |
| 3 | 2 | snnz 4741 | . . . . . 6 ⊢ {∅} ≠ ∅ |
| 4 | 1, 3 | eqnetri 3027 | . . . . 5 ⊢ 𝐴 ≠ ∅ |
| 5 | n0 4306 | . . . . 5 ⊢ (𝐴 ≠ ∅ ↔ ∃𝑥 𝑥 ∈ 𝐴) | |
| 6 | 4, 5 | mpbi 233 | . . . 4 ⊢ ∃𝑥 𝑥 ∈ 𝐴 |
| 7 | pm5.19 390 | . . . . 5 ⊢ ¬ (𝑥 ∈ 𝑦 ↔ ¬ 𝑥 ∈ 𝑦) | |
| 8 | ibar 537 | . . . . . . 7 ⊢ (𝑥 ∈ 𝐴 → (𝜑 ↔ (𝑥 ∈ 𝐴 ∧ 𝜑))) | |
| 9 | notsep.2 | . . . . . . 7 ⊢ (𝜑 ↔ ¬ 𝑥 ∈ 𝑦) | |
| 10 | 8, 9 | bitr3di 289 | . . . . . 6 ⊢ (𝑥 ∈ 𝐴 → ((𝑥 ∈ 𝐴 ∧ 𝜑) ↔ ¬ 𝑥 ∈ 𝑦)) |
| 11 | 10 | bibi2d 345 | . . . . 5 ⊢ (𝑥 ∈ 𝐴 → ((𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝐴 ∧ 𝜑)) ↔ (𝑥 ∈ 𝑦 ↔ ¬ 𝑥 ∈ 𝑦))) |
| 12 | 7, 11 | mtbiri 330 | . . . 4 ⊢ (𝑥 ∈ 𝐴 → ¬ (𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝐴 ∧ 𝜑))) |
| 13 | 6, 12 | eximii 1866 | . . 3 ⊢ ∃𝑥 ¬ (𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝐴 ∧ 𝜑)) |
| 14 | exnal 1856 | . . 3 ⊢ (∃𝑥 ¬ (𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝐴 ∧ 𝜑)) ↔ ¬ ∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝐴 ∧ 𝜑))) | |
| 15 | 13, 14 | mpbi 233 | . 2 ⊢ ¬ ∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝐴 ∧ 𝜑)) |
| 16 | 15 | nex 1829 | 1 ⊢ ¬ ∃𝑦∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝐴 ∧ 𝜑)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 ↔ wb 209 ∧ wa 400 ∀wal 1567 = wceq 1569 ∃wex 1808 ∈ wcel 2142 ≠ wne 2957 ∅c0 4285 {csn 4588 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-ext 2734 ax-nul 5268 |
| This proof depends on definitions: df-bi 210 df-an 401 df-tru 1572 df-fal 1582 df-ex 1809 df-sb 2096 df-clab 2741 df-cleq 2754 df-clel 2837 df-ne 2958 df-v 3456 df-dif 3907 df-nul 4286 df-sn 4589 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |