Mathbox for Scott Fenton |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > distel | Structured version Visualization version GIF version |
Description: Distinctors in terms of membership. (NOTE: this only works with relations where we can prove el 5287 and elirrv 9285.) (Contributed by Scott Fenton, 15-Dec-2010.) |
Ref | Expression |
---|---|
distel | ⊢ (¬ ∀𝑦 𝑦 = 𝑥 ↔ ¬ ∀𝑦 ¬ 𝑥 ∈ 𝑦) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | el 5287 | . . 3 ⊢ ∃𝑧 𝑥 ∈ 𝑧 | |
2 | df-ex 1784 | . . . 4 ⊢ (∃𝑧 𝑥 ∈ 𝑧 ↔ ¬ ∀𝑧 ¬ 𝑥 ∈ 𝑧) | |
3 | nfnae 2434 | . . . . . 6 ⊢ Ⅎ𝑦 ¬ ∀𝑦 𝑦 = 𝑥 | |
4 | dveel1 2461 | . . . . . . . 8 ⊢ (¬ ∀𝑦 𝑦 = 𝑥 → (𝑥 ∈ 𝑧 → ∀𝑦 𝑥 ∈ 𝑧)) | |
5 | 3, 4 | nf5d 2284 | . . . . . . 7 ⊢ (¬ ∀𝑦 𝑦 = 𝑥 → Ⅎ𝑦 𝑥 ∈ 𝑧) |
6 | 5 | nfnd 1862 | . . . . . 6 ⊢ (¬ ∀𝑦 𝑦 = 𝑥 → Ⅎ𝑦 ¬ 𝑥 ∈ 𝑧) |
7 | elequ2 2123 | . . . . . . . 8 ⊢ (𝑧 = 𝑦 → (𝑥 ∈ 𝑧 ↔ 𝑥 ∈ 𝑦)) | |
8 | 7 | notbid 317 | . . . . . . 7 ⊢ (𝑧 = 𝑦 → (¬ 𝑥 ∈ 𝑧 ↔ ¬ 𝑥 ∈ 𝑦)) |
9 | 8 | a1i 11 | . . . . . 6 ⊢ (¬ ∀𝑦 𝑦 = 𝑥 → (𝑧 = 𝑦 → (¬ 𝑥 ∈ 𝑧 ↔ ¬ 𝑥 ∈ 𝑦))) |
10 | 3, 6, 9 | cbvald 2407 | . . . . 5 ⊢ (¬ ∀𝑦 𝑦 = 𝑥 → (∀𝑧 ¬ 𝑥 ∈ 𝑧 ↔ ∀𝑦 ¬ 𝑥 ∈ 𝑦)) |
11 | 10 | notbid 317 | . . . 4 ⊢ (¬ ∀𝑦 𝑦 = 𝑥 → (¬ ∀𝑧 ¬ 𝑥 ∈ 𝑧 ↔ ¬ ∀𝑦 ¬ 𝑥 ∈ 𝑦)) |
12 | 2, 11 | syl5bb 282 | . . 3 ⊢ (¬ ∀𝑦 𝑦 = 𝑥 → (∃𝑧 𝑥 ∈ 𝑧 ↔ ¬ ∀𝑦 ¬ 𝑥 ∈ 𝑦)) |
13 | 1, 12 | mpbii 232 | . 2 ⊢ (¬ ∀𝑦 𝑦 = 𝑥 → ¬ ∀𝑦 ¬ 𝑥 ∈ 𝑦) |
14 | elirrv 9285 | . . . . 5 ⊢ ¬ 𝑦 ∈ 𝑦 | |
15 | elequ1 2115 | . . . . 5 ⊢ (𝑦 = 𝑥 → (𝑦 ∈ 𝑦 ↔ 𝑥 ∈ 𝑦)) | |
16 | 14, 15 | mtbii 325 | . . . 4 ⊢ (𝑦 = 𝑥 → ¬ 𝑥 ∈ 𝑦) |
17 | 16 | alimi 1815 | . . 3 ⊢ (∀𝑦 𝑦 = 𝑥 → ∀𝑦 ¬ 𝑥 ∈ 𝑦) |
18 | 17 | con3i 154 | . 2 ⊢ (¬ ∀𝑦 ¬ 𝑥 ∈ 𝑦 → ¬ ∀𝑦 𝑦 = 𝑥) |
19 | 13, 18 | impbii 208 | 1 ⊢ (¬ ∀𝑦 𝑦 = 𝑥 ↔ ¬ ∀𝑦 ¬ 𝑥 ∈ 𝑦) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∀wal 1537 ∃wex 1783 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-13 2372 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-reg 9281 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-clab 2716 df-cleq 2730 df-clel 2817 df-ral 3068 df-rex 3069 df-v 3424 df-dif 3886 df-un 3888 df-nul 4254 df-sn 4559 df-pr 4561 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |