| 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 6373 | . 2 ⊢ (Ord 𝐴 → (𝐴 ∩ {𝐴}) = ∅) | |
| 2 | disj3 4420 | . . 3 ⊢ ((𝐴 ∩ {𝐴}) = ∅ ↔ 𝐴 = (𝐴 ∖ {𝐴})) | |
| 3 | df-suc 6341 | . . . . . 6 ⊢ suc 𝐴 = (𝐴 ∪ {𝐴}) | |
| 4 | 3 | difeq1i 4088 | . . . . 5 ⊢ (suc 𝐴 ∖ {𝐴}) = ((𝐴 ∪ {𝐴}) ∖ {𝐴}) |
| 5 | difun2 4447 | . . . . 5 ⊢ ((𝐴 ∪ {𝐴}) ∖ {𝐴}) = (𝐴 ∖ {𝐴}) | |
| 6 | 4, 5 | eqtri 2753 | . . . 4 ⊢ (suc 𝐴 ∖ {𝐴}) = (𝐴 ∖ {𝐴}) |
| 7 | 6 | eqeq2i 2743 | . . 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 1540 ∖ cdif 3914 ∪ cun 3915 ∩ cin 3916 ∅c0 4299 {csn 4592 Ord word 6334 suc csuc 6337 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-ext 2702 ax-sep 5254 ax-nul 5264 ax-pr 5390 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-sb 2066 df-clab 2709 df-cleq 2722 df-clel 2804 df-ne 2927 df-ral 3046 df-rex 3055 df-rab 3409 df-v 3452 df-dif 3920 df-un 3922 df-in 3924 df-ss 3934 df-nul 4300 df-if 4492 df-pw 4568 df-sn 4593 df-pr 4595 df-op 4599 df-br 5111 df-opab 5173 df-eprel 5541 df-fr 5594 df-we 5596 df-ord 6338 df-suc 6341 |
| This theorem is referenced by: dif1enlem 9126 dif1enlemOLD 9127 pssnn 9138 phplem2 9175 cantnfresb 43320 |
| Copyright terms: Public domain | W3C validator |