Theorem uniordint 7744

Description: The union of a set of ordinals is equal to the intersection of its upper bounds. Problem 2.5(ii) of [BellMachover] p. 471. (Contributed by NM, 20-Sep-2003.)

Hypothesis

Ref	Expression
uniordint.1	⊢ 𝐴 ∈ V

Assertion

Ref	Expression
uniordint	⊢ (𝐴 ⊆ On → ∪ 𝐴 = ∩ {𝑥 ∈ On ∣ ∀𝑦 ∈ 𝐴 𝑦 ⊆ 𝑥})

Distinct variable group:   𝑥,𝑦,𝐴

Proof of Theorem uniordint

Step	Hyp	Ref	Expression
1		uniordint.1	. . 3 ⊢ 𝐴 ∈ V
2	1	ssonunii 7724	. 2 ⊢ (𝐴 ⊆ On → ∪ 𝐴 ∈ On)
3		intmin 4921	. . 3 ⊢ (∪ 𝐴 ∈ On → ∩ {𝑥 ∈ On ∣ ∪ 𝐴 ⊆ 𝑥} = ∪ 𝐴)
4		unissb 4894	. . . . 5 ⊢ (∪ 𝐴 ⊆ 𝑥 ↔ ∀𝑦 ∈ 𝐴 𝑦 ⊆ 𝑥)
5	4	rabbii 3402	. . . 4 ⊢ {𝑥 ∈ On ∣ ∪ 𝐴 ⊆ 𝑥} = {𝑥 ∈ On ∣ ∀𝑦 ∈ 𝐴 𝑦 ⊆ 𝑥}
6	5	inteqi 4904	. . 3 ⊢ ∩ {𝑥 ∈ On ∣ ∪ 𝐴 ⊆ 𝑥} = ∩ {𝑥 ∈ On ∣ ∀𝑦 ∈ 𝐴 𝑦 ⊆ 𝑥}
7	3, 6	eqtr3di 2784	. 2 ⊢ (∪ 𝐴 ∈ On → ∪ 𝐴 = ∩ {𝑥 ∈ On ∣ ∀𝑦 ∈ 𝐴 𝑦 ⊆ 𝑥})
8	2, 7	syl 17	1 ⊢ (𝐴 ⊆ On → ∪ 𝐴 = ∩ {𝑥 ∈ On ∣ ∀𝑦 ∈ 𝐴 𝑦 ⊆ 𝑥})

Syntax hints:   → wi 4   = wceq 1541   ∈ wcel 2113  ∀wral 3049  {crab 3397  Vcvv 3438   ⊆ wss 3899  ∪ cuni 4861  ∩ cint 4900  Oncon0 6315

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2706  ax-sep 5239  ax-nul 5249  ax-pr 5375  ax-un 7678

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-clab 2713  df-cleq 2726  df-clel 2809  df-ne 2931  df-ral 3050  df-rex 3059  df-rab 3398  df-v 3440  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4579  df-pr 4581  df-op 4585  df-uni 4862  df-int 4901  df-br 5097  df-opab 5159  df-tr 5204  df-eprel 5522  df-po 5530  df-so 5531  df-fr 5575  df-we 5577  df-ord 6318  df-on 6319

This theorem is referenced by: (None)