| Mathbox for Scott Fenton |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > untsucf | Structured version Visualization version GIF version | ||
| Description: If a class is untangled, then so is its successor. (Contributed by Scott Fenton, 28-Feb-2011.) (Revised by Mario Carneiro, 11-Dec-2016.) |
| Ref | Expression |
|---|---|
| untsucf.1 | ⊢ Ⅎ𝑦𝐴 |
| Ref | Expression |
|---|---|
| untsucf | ⊢ (∀𝑥 ∈ 𝐴 ¬ 𝑥 ∈ 𝑥 → ∀𝑦 ∈ suc 𝐴 ¬ 𝑦 ∈ 𝑦) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | untsucf.1 | . . 3 ⊢ Ⅎ𝑦𝐴 | |
| 2 | nfv 1947 | . . 3 ⊢ Ⅎ𝑦 ¬ 𝑥 ∈ 𝑥 | |
| 3 | 1, 2 | nfralw 3314 | . 2 ⊢ Ⅎ𝑦∀𝑥 ∈ 𝐴 ¬ 𝑥 ∈ 𝑥 |
| 4 | vex 3461 | . . . 4 ⊢ 𝑦 ∈ V | |
| 5 | 4 | elsuc 6437 | . . 3 ⊢ (𝑦 ∈ suc 𝐴 ↔ (𝑦 ∈ 𝐴 ∨ 𝑦 = 𝐴)) |
| 6 | elequ1 2153 | . . . . . . 7 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ 𝑥 ↔ 𝑦 ∈ 𝑥)) | |
| 7 | elequ2 2161 | . . . . . . 7 ⊢ (𝑥 = 𝑦 → (𝑦 ∈ 𝑥 ↔ 𝑦 ∈ 𝑦)) | |
| 8 | 6, 7 | bitrd 282 | . . . . . 6 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ 𝑥 ↔ 𝑦 ∈ 𝑦)) |
| 9 | 8 | notbid 321 | . . . . 5 ⊢ (𝑥 = 𝑦 → (¬ 𝑥 ∈ 𝑥 ↔ ¬ 𝑦 ∈ 𝑦)) |
| 10 | 9 | rspccv 3580 | . . . 4 ⊢ (∀𝑥 ∈ 𝐴 ¬ 𝑥 ∈ 𝑥 → (𝑦 ∈ 𝐴 → ¬ 𝑦 ∈ 𝑦)) |
| 11 | untelirr 36237 | . . . . 5 ⊢ (∀𝑥 ∈ 𝐴 ¬ 𝑥 ∈ 𝑥 → ¬ 𝐴 ∈ 𝐴) | |
| 12 | eleq1 2853 | . . . . . . 7 ⊢ (𝑦 = 𝐴 → (𝑦 ∈ 𝑦 ↔ 𝐴 ∈ 𝑦)) | |
| 13 | eleq2 2854 | . . . . . . 7 ⊢ (𝑦 = 𝐴 → (𝐴 ∈ 𝑦 ↔ 𝐴 ∈ 𝐴)) | |
| 14 | 12, 13 | bitrd 282 | . . . . . 6 ⊢ (𝑦 = 𝐴 → (𝑦 ∈ 𝑦 ↔ 𝐴 ∈ 𝐴)) |
| 15 | 14 | notbid 321 | . . . . 5 ⊢ (𝑦 = 𝐴 → (¬ 𝑦 ∈ 𝑦 ↔ ¬ 𝐴 ∈ 𝐴)) |
| 16 | 11, 15 | syl5ibrcom 250 | . . . 4 ⊢ (∀𝑥 ∈ 𝐴 ¬ 𝑥 ∈ 𝑥 → (𝑦 = 𝐴 → ¬ 𝑦 ∈ 𝑦)) |
| 17 | 10, 16 | jaod 873 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 ¬ 𝑥 ∈ 𝑥 → ((𝑦 ∈ 𝐴 ∨ 𝑦 = 𝐴) → ¬ 𝑦 ∈ 𝑦)) |
| 18 | 5, 17 | biimtrid 245 | . 2 ⊢ (∀𝑥 ∈ 𝐴 ¬ 𝑥 ∈ 𝑥 → (𝑦 ∈ suc 𝐴 → ¬ 𝑦 ∈ 𝑦)) |
| 19 | 3, 18 | ralrimi 3265 | 1 ⊢ (∀𝑥 ∈ 𝐴 ¬ 𝑥 ∈ 𝑥 → ∀𝑦 ∈ suc 𝐴 ¬ 𝑦 ∈ 𝑦) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∨ wo 861 = wceq 1570 ∈ wcel 2146 Ⅎwnfc 2912 ∀wral 3081 suc csuc 6366 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-tru 1573 df-ex 1813 df-nf 1817 df-sb 2100 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ral 3082 df-v 3459 df-un 3911 df-sn 4592 df-suc 6370 |
| This theorem is used by: dfon2lem3 36312 |
| Copyright terms: Public domain | W3C validator |