Theorem onsupnmax 42553

Description: If the union of a class of ordinals is not the maximum element of that class, then the union is a limit ordinal or empty. But this isn't a biconditional since 𝐴 could be a non-empty set where a limit ordinal or the empty set happens to be the largest element. (Contributed by RP, 27-Jan-2025.)

Assertion

Ref	Expression
onsupnmax	⊢ (𝐴 ⊆ On → (¬ ∪ 𝐴 ∈ 𝐴 → ∪ 𝐴 = ∪ ∪ 𝐴))

Proof of Theorem onsupnmax

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		rexnal 3094	. . . . . . . . 9 ⊢ (∃𝑥 ∈ 𝐴 ¬ ∃𝑦 ∈ 𝐴 𝑥 ∈ 𝑦 ↔ ¬ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 𝑥 ∈ 𝑦)
2		ralnex 3066	. . . . . . . . . 10 ⊢ (∀𝑦 ∈ 𝐴 ¬ 𝑥 ∈ 𝑦 ↔ ¬ ∃𝑦 ∈ 𝐴 𝑥 ∈ 𝑦)
3	2	rexbii 3088	. . . . . . . . 9 ⊢ (∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 ∈ 𝑦 ↔ ∃𝑥 ∈ 𝐴 ¬ ∃𝑦 ∈ 𝐴 𝑥 ∈ 𝑦)
4		ssunib 42545	. . . . . . . . . 10 ⊢ (𝐴 ⊆ ∪ 𝐴 ↔ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 𝑥 ∈ 𝑦)
5	4	notbii 320	. . . . . . . . 9 ⊢ (¬ 𝐴 ⊆ ∪ 𝐴 ↔ ¬ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 𝑥 ∈ 𝑦)
6	1, 3, 5	3bitr4ri 304	. . . . . . . 8 ⊢ (¬ 𝐴 ⊆ ∪ 𝐴 ↔ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 ∈ 𝑦)
7		simpll 764	. . . . . . . . . . . 12 ⊢ (((𝐴 ⊆ On ∧ ∪ 𝐴 ∈ On) ∧ 𝑥 ∈ 𝐴) → 𝐴 ⊆ On)
8	7	sselda 3977	. . . . . . . . . . 11 ⊢ ((((𝐴 ⊆ On ∧ ∪ 𝐴 ∈ On) ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ 𝐴) → 𝑦 ∈ On)
9		simpl 482	. . . . . . . . . . . . 13 ⊢ ((𝐴 ⊆ On ∧ ∪ 𝐴 ∈ On) → 𝐴 ⊆ On)
10	9	sselda 3977	. . . . . . . . . . . 12 ⊢ (((𝐴 ⊆ On ∧ ∪ 𝐴 ∈ On) ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ On)
11	10	adantr 480	. . . . . . . . . . 11 ⊢ ((((𝐴 ⊆ On ∧ ∪ 𝐴 ∈ On) ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ 𝐴) → 𝑥 ∈ On)
12		ontri1 6392	. . . . . . . . . . 11 ⊢ ((𝑦 ∈ On ∧ 𝑥 ∈ On) → (𝑦 ⊆ 𝑥 ↔ ¬ 𝑥 ∈ 𝑦))
13	8, 11, 12	syl2anc 583	. . . . . . . . . 10 ⊢ ((((𝐴 ⊆ On ∧ ∪ 𝐴 ∈ On) ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ 𝐴) → (𝑦 ⊆ 𝑥 ↔ ¬ 𝑥 ∈ 𝑦))
14	13	ralbidva 3169	. . . . . . . . 9 ⊢ (((𝐴 ⊆ On ∧ ∪ 𝐴 ∈ On) ∧ 𝑥 ∈ 𝐴) → (∀𝑦 ∈ 𝐴 𝑦 ⊆ 𝑥 ↔ ∀𝑦 ∈ 𝐴 ¬ 𝑥 ∈ 𝑦))
15	14	rexbidva 3170	. . . . . . . 8 ⊢ ((𝐴 ⊆ On ∧ ∪ 𝐴 ∈ On) → (∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝑦 ⊆ 𝑥 ↔ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 ∈ 𝑦))
16	6, 15	bitr4id 290	. . . . . . 7 ⊢ ((𝐴 ⊆ On ∧ ∪ 𝐴 ∈ On) → (¬ 𝐴 ⊆ ∪ 𝐴 ↔ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝑦 ⊆ 𝑥))
17		unielid 42544	. . . . . . . . 9 ⊢ (∪ 𝐴 ∈ 𝐴 ↔ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝑦 ⊆ 𝑥)
18	17	a1i 11	. . . . . . . 8 ⊢ ((𝐴 ⊆ On ∧ ∪ 𝐴 ∈ On) → (∪ 𝐴 ∈ 𝐴 ↔ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝑦 ⊆ 𝑥))
19	18	biimprd 247	. . . . . . 7 ⊢ ((𝐴 ⊆ On ∧ ∪ 𝐴 ∈ On) → (∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝑦 ⊆ 𝑥 → ∪ 𝐴 ∈ 𝐴))
20	16, 19	sylbid 239	. . . . . 6 ⊢ ((𝐴 ⊆ On ∧ ∪ 𝐴 ∈ On) → (¬ 𝐴 ⊆ ∪ 𝐴 → ∪ 𝐴 ∈ 𝐴))
21	20	con1d 145	. . . . 5 ⊢ ((𝐴 ⊆ On ∧ ∪ 𝐴 ∈ On) → (¬ ∪ 𝐴 ∈ 𝐴 → 𝐴 ⊆ ∪ 𝐴))
22		uniss 4910	. . . . 5 ⊢ (𝐴 ⊆ ∪ 𝐴 → ∪ 𝐴 ⊆ ∪ ∪ 𝐴)
23	21, 22	syl6 35	. . . 4 ⊢ ((𝐴 ⊆ On ∧ ∪ 𝐴 ∈ On) → (¬ ∪ 𝐴 ∈ 𝐴 → ∪ 𝐴 ⊆ ∪ ∪ 𝐴))
24		ssorduni 7763	. . . . . . . 8 ⊢ (𝐴 ⊆ On → Ord ∪ 𝐴)
25		orduniss 6455	. . . . . . . 8 ⊢ (Ord ∪ 𝐴 → ∪ ∪ 𝐴 ⊆ ∪ 𝐴)
26	24, 25	syl 17	. . . . . . 7 ⊢ (𝐴 ⊆ On → ∪ ∪ 𝐴 ⊆ ∪ 𝐴)
27	26	biantrud 531	. . . . . 6 ⊢ (𝐴 ⊆ On → (∪ 𝐴 ⊆ ∪ ∪ 𝐴 ↔ (∪ 𝐴 ⊆ ∪ ∪ 𝐴 ∧ ∪ ∪ 𝐴 ⊆ ∪ 𝐴)))
28		eqss 3992	. . . . . 6 ⊢ (∪ 𝐴 = ∪ ∪ 𝐴 ↔ (∪ 𝐴 ⊆ ∪ ∪ 𝐴 ∧ ∪ ∪ 𝐴 ⊆ ∪ 𝐴))
29	27, 28	bitr4di 289	. . . . 5 ⊢ (𝐴 ⊆ On → (∪ 𝐴 ⊆ ∪ ∪ 𝐴 ↔ ∪ 𝐴 = ∪ ∪ 𝐴))
30	29	adantr 480	. . . 4 ⊢ ((𝐴 ⊆ On ∧ ∪ 𝐴 ∈ On) → (∪ 𝐴 ⊆ ∪ ∪ 𝐴 ↔ ∪ 𝐴 = ∪ ∪ 𝐴))
31	23, 30	sylibd 238	. . 3 ⊢ ((𝐴 ⊆ On ∧ ∪ 𝐴 ∈ On) → (¬ ∪ 𝐴 ∈ 𝐴 → ∪ 𝐴 = ∪ ∪ 𝐴))
32	31	ex 412	. 2 ⊢ (𝐴 ⊆ On → (∪ 𝐴 ∈ On → (¬ ∪ 𝐴 ∈ 𝐴 → ∪ 𝐴 = ∪ ∪ 𝐴)))
33		unon 7816	. . . . 5 ⊢ ∪ On = On
34	33	a1i 11	. . . 4 ⊢ (∪ 𝐴 = On → ∪ On = On)
35		unieq 4913	. . . 4 ⊢ (∪ 𝐴 = On → ∪ ∪ 𝐴 = ∪ On)
36		id 22	. . . 4 ⊢ (∪ 𝐴 = On → ∪ 𝐴 = On)
37	34, 35, 36	3eqtr4rd 2777	. . 3 ⊢ (∪ 𝐴 = On → ∪ 𝐴 = ∪ ∪ 𝐴)
38	37	a1i13 27	. 2 ⊢ (𝐴 ⊆ On → (∪ 𝐴 = On → (¬ ∪ 𝐴 ∈ 𝐴 → ∪ 𝐴 = ∪ ∪ 𝐴)))
39		ordeleqon 7766	. . 3 ⊢ (Ord ∪ 𝐴 ↔ (∪ 𝐴 ∈ On ∨ ∪ 𝐴 = On))
40	24, 39	sylib 217	. 2 ⊢ (𝐴 ⊆ On → (∪ 𝐴 ∈ On ∨ ∪ 𝐴 = On))
41	32, 38, 40	mpjaod 857	1 ⊢ (𝐴 ⊆ On → (¬ ∪ 𝐴 ∈ 𝐴 → ∪ 𝐴 = ∪ ∪ 𝐴))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 395   ∨ wo 844   = wceq 1533   ∈ wcel 2098  ∀wral 3055  ∃wrex 3064   ⊆ wss 3943  ∪ cuni 4902  Ord word 6357  Oncon0 6358

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2163  ax-ext 2697  ax-sep 5292  ax-nul 5299  ax-pr 5420  ax-un 7722

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3or 1085  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-clab 2704  df-cleq 2718  df-clel 2804  df-ne 2935  df-ral 3056  df-rex 3065  df-rab 3427  df-v 3470  df-dif 3946  df-un 3948  df-in 3950  df-ss 3960  df-pss 3962  df-nul 4318  df-if 4524  df-pw 4599  df-sn 4624  df-pr 4626  df-op 4630  df-uni 4903  df-br 5142  df-opab 5204  df-tr 5259  df-eprel 5573  df-po 5581  df-so 5582  df-fr 5624  df-we 5626  df-ord 6361  df-on 6362  df-suc 6364

This theorem is referenced by:  onsupeqnmax  42572  onsupsucismax  42605