| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > orddif | Structured version Visualization version GIF version | ||
| Description: Ordinal derived from its successor. (Contributed by NM, 20-May-1998.) |
| Ref | Expression |
|---|---|
| orddif | ⊢ (Ord 𝐴 → 𝐴 = (suc 𝐴 ∖ {𝐴})) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | orddisj 6396 | . 2 ⊢ (Ord 𝐴 → (𝐴 ∩ {𝐴}) = ∅) | |
| 2 | disj3 4417 | . . 3 ⊢ ((𝐴 ∩ {𝐴}) = ∅ ↔ 𝐴 = (𝐴 ∖ {𝐴})) | |
| 3 | df-suc 6363 | . . . . . 6 ⊢ suc 𝐴 = (𝐴 ∪ {𝐴}) | |
| 4 | 3 | difeq1i 4085 | . . . . 5 ⊢ (suc 𝐴 ∖ {𝐴}) = ((𝐴 ∪ {𝐴}) ∖ {𝐴}) |
| 5 | difun2 4444 | . . . . 5 ⊢ ((𝐴 ∪ {𝐴}) ∖ {𝐴}) = (𝐴 ∖ {𝐴}) | |
| 6 | 4, 5 | eqtri 2792 | . . . 4 ⊢ (suc 𝐴 ∖ {𝐴}) = (𝐴 ∖ {𝐴}) |
| 7 | 6 | eqeq2i 2782 | . . 3 ⊢ (𝐴 = (suc 𝐴 ∖ {𝐴}) ↔ 𝐴 = (𝐴 ∖ {𝐴})) |
| 8 | 2, 7 | bitr4i 281 | . 2 ⊢ ((𝐴 ∩ {𝐴}) = ∅ ↔ 𝐴 = (suc 𝐴 ∖ {𝐴})) |
| 9 | 1, 8 | sylib 221 | 1 ⊢ (Ord 𝐴 → 𝐴 = (suc 𝐴 ∖ {𝐴})) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1567 ∖ cdif 3910 ∪ cun 3911 ∩ cin 3912 ∅c0 4294 {csn 4591 Ord word 6356 suc csuc 6359 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-ext 2741 ax-sep 5258 ax-pr 5402 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-sb 2098 df-clab 2748 df-cleq 2761 df-clel 2844 df-ne 2965 df-ral 3086 df-rex 3096 df-rab 3424 df-v 3465 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-br 5111 df-opab 5175 df-eprel 5559 df-fr 5612 df-we 5614 df-ord 6360 df-suc 6363 |
| This theorem is referenced by: dif1enlem 9140 pssnn 9149 phplem2 9185 cantnfresb 43936 |
| Copyright terms: Public domain | W3C validator |