Theorem onsssupeqcond 43238

Description: If for every element of a set of ordinals there is an element of a subset which is at least as large, then the union of the set and the subset is the same. Lemma 2.12 of [Schloeder] p. 5. (Contributed by RP, 27-Jan-2025.)

Assertion

Ref	Expression
onsssupeqcond	⊢ ((𝐴 ⊆ On ∧ 𝐴 ∈ 𝑉) → ((𝐵 ⊆ 𝐴 ∧ ∀𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐵 𝑎 ⊆ 𝑏) → ∪ 𝐴 = ∪ 𝐵))

Distinct variable groups:   𝐴,𝑎   𝐵,𝑎,𝑏

Allowed substitution hints:   𝐴(𝑏)   𝑉(𝑎,𝑏)

Proof of Theorem onsssupeqcond

Step	Hyp	Ref	Expression
1		uniss2 4923	. . . 4 ⊢ (∀𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐵 𝑎 ⊆ 𝑏 → ∪ 𝐴 ⊆ ∪ 𝐵)
2	1	adantl 481	. . 3 ⊢ ((𝐵 ⊆ 𝐴 ∧ ∀𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐵 𝑎 ⊆ 𝑏) → ∪ 𝐴 ⊆ ∪ 𝐵)
3		uniss 4897	. . . 4 ⊢ (𝐵 ⊆ 𝐴 → ∪ 𝐵 ⊆ ∪ 𝐴)
4	3	adantr 480	. . 3 ⊢ ((𝐵 ⊆ 𝐴 ∧ ∀𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐵 𝑎 ⊆ 𝑏) → ∪ 𝐵 ⊆ ∪ 𝐴)
5	2, 4	eqssd 3983	. 2 ⊢ ((𝐵 ⊆ 𝐴 ∧ ∀𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐵 𝑎 ⊆ 𝑏) → ∪ 𝐴 = ∪ 𝐵)
6	5	a1i 11	1 ⊢ ((𝐴 ⊆ On ∧ 𝐴 ∈ 𝑉) → ((𝐵 ⊆ 𝐴 ∧ ∀𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐵 𝑎 ⊆ 𝑏) → ∪ 𝐴 = ∪ 𝐵))

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1539   ∈ wcel 2107  ∀wral 3050  ∃wrex 3059   ⊆ wss 3933  ∪ cuni 4889  Oncon0 6365

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1909  ax-6 1966  ax-7 2006  ax-8 2109  ax-9 2117  ax-ext 2706

This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1542  df-ex 1779  df-sb 2064  df-clab 2713  df-cleq 2726  df-clel 2808  df-ral 3051  df-rex 3060  df-v 3466  df-ss 3950  df-uni 4890

This theorem is referenced by: (None)