| 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 6363 | . 2 ⊢ (Ord 𝐴 → (𝐴 ∩ {𝐴}) = ∅) | |
| 2 | disj3 4408 | . . 3 ⊢ ((𝐴 ∩ {𝐴}) = ∅ ↔ 𝐴 = (𝐴 ∖ {𝐴})) | |
| 3 | df-suc 6331 | . . . . . 6 ⊢ suc 𝐴 = (𝐴 ∪ {𝐴}) | |
| 4 | 3 | difeq1i 4076 | . . . . 5 ⊢ (suc 𝐴 ∖ {𝐴}) = ((𝐴 ∪ {𝐴}) ∖ {𝐴}) |
| 5 | difun2 4435 | . . . . 5 ⊢ ((𝐴 ∪ {𝐴}) ∖ {𝐴}) = (𝐴 ∖ {𝐴}) | |
| 6 | 4, 5 | eqtri 2760 | . . . 4 ⊢ (suc 𝐴 ∖ {𝐴}) = (𝐴 ∖ {𝐴}) |
| 7 | 6 | eqeq2i 2750 | . . 3 ⊢ (𝐴 = (suc 𝐴 ∖ {𝐴}) ↔ 𝐴 = (𝐴 ∖ {𝐴})) |
| 8 | 2, 7 | bitr4i 278 | . 2 ⊢ ((𝐴 ∩ {𝐴}) = ∅ ↔ 𝐴 = (suc 𝐴 ∖ {𝐴})) |
| 9 | 1, 8 | sylib 218 | 1 ⊢ (Ord 𝐴 → 𝐴 = (suc 𝐴 ∖ {𝐴})) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1542 ∖ cdif 3900 ∪ cun 3901 ∩ cin 3902 ∅c0 4287 {csn 4582 Ord word 6324 suc csuc 6327 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2709 ax-sep 5243 ax-pr 5379 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-ne 2934 df-ral 3053 df-rex 3063 df-rab 3402 df-v 3444 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-br 5101 df-opab 5163 df-eprel 5532 df-fr 5585 df-we 5587 df-ord 6328 df-suc 6331 |
| This theorem is referenced by: dif1enlem 9096 pssnn 9105 phplem2 9141 cantnfresb 43678 |
| Copyright terms: Public domain | W3C validator |