![]() |
Mathbox for Richard Penner |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > onsssupeqcond | Structured version Visualization version GIF version |
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.) |
Ref | Expression |
---|---|
onsssupeqcond | ⊢ ((𝐴 ⊆ On ∧ 𝐴 ∈ 𝑉) → ((𝐵 ⊆ 𝐴 ∧ ∀𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐵 𝑎 ⊆ 𝑏) → ∪ 𝐴 = ∪ 𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | uniss2 4944 | . . . 4 ⊢ (∀𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐵 𝑎 ⊆ 𝑏 → ∪ 𝐴 ⊆ ∪ 𝐵) | |
2 | 1 | adantl 483 | . . 3 ⊢ ((𝐵 ⊆ 𝐴 ∧ ∀𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐵 𝑎 ⊆ 𝑏) → ∪ 𝐴 ⊆ ∪ 𝐵) |
3 | uniss 4915 | . . . 4 ⊢ (𝐵 ⊆ 𝐴 → ∪ 𝐵 ⊆ ∪ 𝐴) | |
4 | 3 | adantr 482 | . . 3 ⊢ ((𝐵 ⊆ 𝐴 ∧ ∀𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐵 𝑎 ⊆ 𝑏) → ∪ 𝐵 ⊆ ∪ 𝐴) |
5 | 2, 4 | eqssd 3998 | . 2 ⊢ ((𝐵 ⊆ 𝐴 ∧ ∀𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐵 𝑎 ⊆ 𝑏) → ∪ 𝐴 = ∪ 𝐵) |
6 | 5 | a1i 11 | 1 ⊢ ((𝐴 ⊆ On ∧ 𝐴 ∈ 𝑉) → ((𝐵 ⊆ 𝐴 ∧ ∀𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐵 𝑎 ⊆ 𝑏) → ∪ 𝐴 = ∪ 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 397 = wceq 1542 ∈ wcel 2107 ∀wral 3062 ∃wrex 3071 ⊆ wss 3947 ∪ cuni 4907 Oncon0 6361 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-ext 2704 |
This theorem depends on definitions: df-bi 206 df-an 398 df-tru 1545 df-ex 1783 df-sb 2069 df-clab 2711 df-cleq 2725 df-clel 2811 df-ral 3063 df-rex 3072 df-v 3477 df-in 3954 df-ss 3964 df-uni 4908 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |