| Mathbox for Richard Penner |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > unielid | Structured version Visualization version GIF version | ||
| Description: Two ways to say the union of a class is an element of that class. (Contributed by RP, 27-Jan-2025.) |
| Ref | Expression |
|---|---|
| unielid | ⊢ (∪ 𝐴 ∈ 𝐴 ↔ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝑦 ⊆ 𝑥) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ssid 3958 | . 2 ⊢ 𝐴 ⊆ 𝐴 | |
| 2 | unielss 43792 | . 2 ⊢ (𝐴 ⊆ 𝐴 → (∪ 𝐴 ∈ 𝐴 ↔ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝑦 ⊆ 𝑥)) | |
| 3 | 1, 2 | ax-mp 5 | 1 ⊢ (∪ 𝐴 ∈ 𝐴 ↔ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝑦 ⊆ 𝑥) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 208 ∈ wcel 2142 ∀wral 3076 ∃wrex 3086 ⊆ wss 3904 ∪ cuni 4865 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-tru 1563 df-ex 1800 df-nf 1804 df-sb 2091 df-clab 2741 df-cleq 2754 df-clel 2837 df-ral 3077 df-rex 3087 df-ss 3921 df-uni 4866 |
| This theorem is referenced by: onsupnmax 43802 onsupeqmax 43820 onsupeqnmax 43821 |
| Copyright terms: Public domain | W3C validator |