| 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 6361 | . 2 ⊢ (Ord 𝐴 → (𝐴 ∩ {𝐴}) = ∅) | |
| 2 | disj3 4394 | . . 3 ⊢ ((𝐴 ∩ {𝐴}) = ∅ ↔ 𝐴 = (𝐴 ∖ {𝐴})) | |
| 3 | df-suc 6329 | . . . . . 6 ⊢ suc 𝐴 = (𝐴 ∪ {𝐴}) | |
| 4 | 3 | difeq1i 4062 | . . . . 5 ⊢ (suc 𝐴 ∖ {𝐴}) = ((𝐴 ∪ {𝐴}) ∖ {𝐴}) |
| 5 | difun2 4421 | . . . . 5 ⊢ ((𝐴 ∪ {𝐴}) ∖ {𝐴}) = (𝐴 ∖ {𝐴}) | |
| 6 | 4, 5 | eqtri 2759 | . . . 4 ⊢ (suc 𝐴 ∖ {𝐴}) = (𝐴 ∖ {𝐴}) |
| 7 | 6 | eqeq2i 2749 | . . 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 3886 ∪ cun 3887 ∩ cin 3888 ∅c0 4273 {csn 4567 Ord word 6322 suc csuc 6325 |
| 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 2708 ax-sep 5231 ax-pr 5375 |
| 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 2715 df-cleq 2728 df-clel 2811 df-ne 2933 df-ral 3052 df-rex 3062 df-rab 3390 df-v 3431 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-br 5086 df-opab 5148 df-eprel 5531 df-fr 5584 df-we 5586 df-ord 6326 df-suc 6329 |
| This theorem is referenced by: dif1enlem 9094 pssnn 9103 phplem2 9139 cantnfresb 43752 |
| Copyright terms: Public domain | W3C validator |