Theorem unizlim 3113

Description: An ordinal equal to its own union is either zero or a limit ordinal.

Assertion

Ref	Expression
unizlim	|- (Ord A -> (A = U.A <-> (A = (/) \/ Lim A)))

Proof of Theorem unizlim

Step	Hyp	Ref	Expression
1		df-lim 2953	. . . . . . . . 9 |- (Lim A <-> (Ord A /\ A =/= (/) /\ A = U.A))
2	1	biimpr 152	. . . . . . . 8 |- ((Ord A /\ A =/= (/) /\ A = U.A) -> Lim A)
3	2	3exp 832	. . . . . . 7 |- (Ord A -> (A =/= (/) -> (A = U.A -> Lim A)))
4		df-ne 1587	. . . . . . 7 |- (A =/= (/) <-> -. A = (/))
5	3, 4	syl5ibr 207	. . . . . 6 |- (Ord A -> (-. A = (/) -> (A = U.A -> Lim A)))
6	5	com23 32	. . . . 5 |- (Ord A -> (A = U.A -> (-. A = (/) -> Lim A)))
7	6	imp 350	. . . 4 |- ((Ord A /\ A = U.A) -> (-. A = (/) -> Lim A))
8	7	orrd 233	. . 3 |- ((Ord A /\ A = U.A) -> (A = (/) \/ Lim A))
9	8	ex 373	. 2 |- (Ord A -> (A = U.A -> (A = (/) \/ Lim A)))
10		uni0 2525	. . . . 5 |- U.(/) = (/)
11	10	eqcomi 1479	. . . 4 |- (/) = U.(/)
12		id 59	. . . 4 |- (A = (/) -> A = (/))
13		unieq 2510	. . . 4 |- (A = (/) -> U.A = U.(/))
14	11, 12, 13	3eqtr4a 1532	. . 3 |- (A = (/) -> A = U.A)
15		limuni 3029	. . 3 |- (Lim A -> A = U.A)
16	14, 15	jaoi 341	. 2 |- ((A = (/) \/ Lim A) -> A = U.A)
17	9, 16	impbid1 517	1 |- (Ord A -> (A = U.A <-> (A = (/) \/ Lim A)))

Syntax hints:  -. wn 2   -> wi 3   <-> wb 146   \/ wo 222   /\ wa 223   /\ w3a 775   = wceq 956   =/= wne 1585  (/)c0 2280  U.cuni 2503  Ord word 2947  Lim wlim 2949

This theorem is referenced by:  ordzsl 3116

This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 962  ax-gen 963  ax-8 964  ax-10 966  ax-12 968  ax-17 971  ax-4 973  ax-5o 975  ax-6o 978  ax-9o 1123  ax-10o 1140  ax-16 1210  ax-11o 1218  ax-ext 1459

This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-3an 777  df-ex 981  df-sb 1172  df-clab 1464  df-cleq 1469  df-clel 1472  df-ne 1587  df-ral 1649  df-rex 1650  df-v 1812  df-dif 2049  df-in 2051  df-ss 2053  df-nul 2281  df-sn 2412  df-uni 2504  df-lim 2953

Copyright terms: Public domain