| 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 6348 | . 2 ⊢ Tr On | |
| 2 | trpred 6297 | . 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 5207 E cep 5531 Predcpred 6266 Oncon0 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 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-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-br 5101 df-opab 5163 df-tr 5208 df-eprel 5532 df-po 5540 df-so 5541 df-fr 5585 df-we 5587 df-xp 5638 df-rel 5639 df-cnv 5640 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-pred 6267 df-ord 6328 df-on 6329 |
| This theorem is referenced by: dfrecs3 8314 tfr2ALT 8342 tfr3ALT 8343 on2recsov 8606 on2ind 8607 on3ind 8608 |
| Copyright terms: Public domain | W3C validator |