| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > predon | Structured version Visualization version GIF version | ||
| Description: The predecessor of an ordinal under E and On is itself. (Contributed by Scott Fenton, 27-Mar-2011.) (Proof shortened by BJ, 16-Oct-2024.) |
| Ref | Expression |
|---|---|
| predon | ⊢ (𝐴 ∈ On → Pred( E , On, 𝐴) = 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | tron 6346 | . 2 ⊢ Tr On | |
| 2 | trpred 6295 | . 2 ⊢ ((Tr On ∧ 𝐴 ∈ On) → Pred( E , On, 𝐴) = 𝐴) | |
| 3 | 1, 2 | mpan 691 | 1 ⊢ (𝐴 ∈ On → Pred( E , On, 𝐴) = 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1542 ∈ wcel 2114 Tr wtr 5192 E cep 5530 Predcpred 6264 Oncon0 6323 |
| 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-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-br 5086 df-opab 5148 df-tr 5193 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6265 df-ord 6326 df-on 6327 |
| This theorem is referenced by: dfrecs3 8312 tfr2ALT 8340 tfr3ALT 8341 on2recsov 8604 on2ind 8605 on3ind 8606 |
| Copyright terms: Public domain | W3C validator |