Theorem onsupnmax 41962

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 3100	. . . . . . . . 9 ⊢ (∃𝑥 ∈ 𝐴 ¬ ∃𝑦 ∈ 𝐴 𝑥 ∈ 𝑦 ↔ ¬ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 𝑥 ∈ 𝑦)
2		ralnex 3072	. . . . . . . . . 10 ⊢ (∀𝑦 ∈ 𝐴 ¬ 𝑥 ∈ 𝑦 ↔ ¬ ∃𝑦 ∈ 𝐴 𝑥 ∈ 𝑦)
3	2	rexbii 3094	. . . . . . . . 9 ⊢ (∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 ∈ 𝑦 ↔ ∃𝑥 ∈ 𝐴 ¬ ∃𝑦 ∈ 𝐴 𝑥 ∈ 𝑦)
4		ssunib 41954	. . . . . . . . . 10 ⊢ (𝐴 ⊆ ∪ 𝐴 ↔ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 𝑥 ∈ 𝑦)
5	4	notbii 319	. . . . . . . . 9 ⊢ (¬ 𝐴 ⊆ ∪ 𝐴 ↔ ¬ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 𝑥 ∈ 𝑦)
6	1, 3, 5	3bitr4ri 303	. . . . . . . 8 ⊢ (¬ 𝐴 ⊆ ∪ 𝐴 ↔ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 ∈ 𝑦)
7		simpll 765	. . . . . . . . . . . 12 ⊢ (((𝐴 ⊆ On ∧ ∪ 𝐴 ∈ On) ∧ 𝑥 ∈ 𝐴) → 𝐴 ⊆ On)
8	7	sselda 3981	. . . . . . . . . . 11 ⊢ ((((𝐴 ⊆ On ∧ ∪ 𝐴 ∈ On) ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ 𝐴) → 𝑦 ∈ On)
9		simpl 483	. . . . . . . . . . . . 13 ⊢ ((𝐴 ⊆ On ∧ ∪ 𝐴 ∈ On) → 𝐴 ⊆ On)
10	9	sselda 3981	. . . . . . . . . . . 12 ⊢ (((𝐴 ⊆ On ∧ ∪ 𝐴 ∈ On) ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ On)
11	10	adantr 481	. . . . . . . . . . 11 ⊢ ((((𝐴 ⊆ On ∧ ∪ 𝐴 ∈ On) ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ 𝐴) → 𝑥 ∈ On)
12		ontri1 6395	. . . . . . . . . . 11 ⊢ ((𝑦 ∈ On ∧ 𝑥 ∈ On) → (𝑦 ⊆ 𝑥 ↔ ¬ 𝑥 ∈ 𝑦))
13	8, 11, 12	syl2anc 584	. . . . . . . . . 10 ⊢ ((((𝐴 ⊆ On ∧ ∪ 𝐴 ∈ On) ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ 𝐴) → (𝑦 ⊆ 𝑥 ↔ ¬ 𝑥 ∈ 𝑦))
14	13	ralbidva 3175	. . . . . . . . 9 ⊢ (((𝐴 ⊆ On ∧ ∪ 𝐴 ∈ On) ∧ 𝑥 ∈ 𝐴) → (∀𝑦 ∈ 𝐴 𝑦 ⊆ 𝑥 ↔ ∀𝑦 ∈ 𝐴 ¬ 𝑥 ∈ 𝑦))
15	14	rexbidva 3176	. . . . . . . 8 ⊢ ((𝐴 ⊆ On ∧ ∪ 𝐴 ∈ On) → (∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝑦 ⊆ 𝑥 ↔ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 ∈ 𝑦))
16	6, 15	bitr4id 289	. . . . . . 7 ⊢ ((𝐴 ⊆ On ∧ ∪ 𝐴 ∈ On) → (¬ 𝐴 ⊆ ∪ 𝐴 ↔ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝑦 ⊆ 𝑥))
17		unielid 41953	. . . . . . . . 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 4915	. . . . 5 ⊢ (𝐴 ⊆ ∪ 𝐴 → ∪ 𝐴 ⊆ ∪ ∪ 𝐴)
23	21, 22	syl6 35	. . . 4 ⊢ ((𝐴 ⊆ On ∧ ∪ 𝐴 ∈ On) → (¬ ∪ 𝐴 ∈ 𝐴 → ∪ 𝐴 ⊆ ∪ ∪ 𝐴))
24		ssorduni 7762	. . . . . . . 8 ⊢ (𝐴 ⊆ On → Ord ∪ 𝐴)
25		orduniss 6458	. . . . . . . 8 ⊢ (Ord ∪ 𝐴 → ∪ ∪ 𝐴 ⊆ ∪ 𝐴)
26	24, 25	syl 17	. . . . . . 7 ⊢ (𝐴 ⊆ On → ∪ ∪ 𝐴 ⊆ ∪ 𝐴)
27	26	biantrud 532	. . . . . 6 ⊢ (𝐴 ⊆ On → (∪ 𝐴 ⊆ ∪ ∪ 𝐴 ↔ (∪ 𝐴 ⊆ ∪ ∪ 𝐴 ∧ ∪ ∪ 𝐴 ⊆ ∪ 𝐴)))
28		eqss 3996	. . . . . 6 ⊢ (∪ 𝐴 = ∪ ∪ 𝐴 ↔ (∪ 𝐴 ⊆ ∪ ∪ 𝐴 ∧ ∪ ∪ 𝐴 ⊆ ∪ 𝐴))
29	27, 28	bitr4di 288	. . . . 5 ⊢ (𝐴 ⊆ On → (∪ 𝐴 ⊆ ∪ ∪ 𝐴 ↔ ∪ 𝐴 = ∪ ∪ 𝐴))
30	29	adantr 481	. . . 4 ⊢ ((𝐴 ⊆ On ∧ ∪ 𝐴 ∈ On) → (∪ 𝐴 ⊆ ∪ ∪ 𝐴 ↔ ∪ 𝐴 = ∪ ∪ 𝐴))
31	23, 30	sylibd 238	. . 3 ⊢ ((𝐴 ⊆ On ∧ ∪ 𝐴 ∈ On) → (¬ ∪ 𝐴 ∈ 𝐴 → ∪ 𝐴 = ∪ ∪ 𝐴))
32	31	ex 413	. 2 ⊢ (𝐴 ⊆ On → (∪ 𝐴 ∈ On → (¬ ∪ 𝐴 ∈ 𝐴 → ∪ 𝐴 = ∪ ∪ 𝐴)))
33		unon 7815	. . . . 5 ⊢ ∪ On = On
34	33	a1i 11	. . . 4 ⊢ (∪ 𝐴 = On → ∪ On = On)
35		unieq 4918	. . . 4 ⊢ (∪ 𝐴 = On → ∪ ∪ 𝐴 = ∪ On)
36		id 22	. . . 4 ⊢ (∪ 𝐴 = On → ∪ 𝐴 = On)
37	34, 35, 36	3eqtr4rd 2783	. . 3 ⊢ (∪ 𝐴 = On → ∪ 𝐴 = ∪ ∪ 𝐴)
38	37	a1i13 27	. 2 ⊢ (𝐴 ⊆ On → (∪ 𝐴 = On → (¬ ∪ 𝐴 ∈ 𝐴 → ∪ 𝐴 = ∪ ∪ 𝐴)))
39		ordeleqon 7765	. . 3 ⊢ (Ord ∪ 𝐴 ↔ (∪ 𝐴 ∈ On ∨ ∪ 𝐴 = On))
40	24, 39	sylib 217	. 2 ⊢ (𝐴 ⊆ On → (∪ 𝐴 ∈ On ∨ ∪ 𝐴 = On))
41	32, 38, 40	mpjaod 858	1 ⊢ (𝐴 ⊆ On → (¬ ∪ 𝐴 ∈ 𝐴 → ∪ 𝐴 = ∪ ∪ 𝐴))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 396   ∨ wo 845   = wceq 1541   ∈ wcel 2106  ∀wral 3061  ∃wrex 3070   ⊆ wss 3947  ∪ cuni 4907  Ord word 6360  Oncon0 6361

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 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2703  ax-sep 5298  ax-nul 5305  ax-pr 5426  ax-un 7721

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-clab 2710  df-cleq 2724  df-clel 2810  df-ne 2941  df-ral 3062  df-rex 3071  df-rab 3433  df-v 3476  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-pss 3966  df-nul 4322  df-if 4528  df-pw 4603  df-sn 4628  df-pr 4630  df-op 4634  df-uni 4908  df-br 5148  df-opab 5210  df-tr 5265  df-eprel 5579  df-po 5587  df-so 5588  df-fr 5630  df-we 5632  df-ord 6364  df-on 6365  df-suc 6367

This theorem is referenced by:  onsupeqnmax  41981  onsupsucismax  42014