Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > iunonOLD | Unicode version |
Description: The indexed union of a
set of ordinal numbers ( x ) is an ordinal
number. (Contributed by NM, 13-Oct-2003.) (Revised by Mario Carneiro,
5-Dec-2016.) (New usage is discouraged.)
(Proof modification is discouraged.) |
Ref | Expression |
---|---|
iunonOLD.1 | |
iunonOLD.2 |
Ref | Expression |
---|---|
iunonOLD |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | iunonOLD.1 | . 2 | |
2 | iunon 7028 | . 2 | |
3 | 1, 2 | mpan 670 | 1 |
Colors of variables: wff setvar class |
Syntax hints: -> wi 4 e. wcel 1818
A. wral 2807 cvv 3109
U_ ciun 4330 con0 4883 |
This theorem is referenced by: alephon 8471 cfsmolem 8671 hsmexlem5 8831 inar1 9174 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1618 ax-4 1631 ax-5 1704 ax-6 1747 ax-7 1790 ax-8 1820 ax-9 1822 ax-10 1837 ax-11 1842 ax-12 1854 ax-13 1999 ax-ext 2435 ax-rep 4563 ax-sep 4573 ax-nul 4581 ax-pr 4691 ax-un 6592 |
This theorem depends on definitions: df-bi 185 df-or 370 df-an 371 df-3or 974 df-3an 975 df-tru 1398 df-ex 1613 df-nf 1617 df-sb 1740 df-eu 2286 df-mo 2287 df-clab 2443 df-cleq 2449 df-clel 2452 df-nfc 2607 df-ne 2654 df-ral 2812 df-rex 2813 df-reu 2814 df-rab 2816 df-v 3111 df-sbc 3328 df-csb 3435 df-dif 3478 df-un 3480 df-in 3482 df-ss 3489 df-pss 3491 df-nul 3785 df-if 3942 df-sn 4030 df-pr 4032 df-tp 4034 df-op 4036 df-uni 4250 df-iun 4332 df-br 4453 df-opab 4511 df-mpt 4512 df-tr 4546 df-eprel 4796 df-id 4800 df-po 4805 df-so 4806 df-fr 4843 df-we 4845 df-ord 4886 df-on 4887 df-xp 5010 df-rel 5011 df-cnv 5012 df-co 5013 df-dm 5014 df-rn 5015 df-res 5016 df-ima 5017 df-iota 5556 df-fun 5595 df-fn 5596 df-f 5597 df-f1 5598 df-fo 5599 df-f1o 5600 df-fv 5601 |
Copyright terms: Public domain | W3C validator |