| 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 3934 | . 2 ⊢ 𝐴 ⊆ 𝐴 | |
| 2 | unielss 44360 | . 2 ⊢ (𝐴 ⊆ 𝐴 → (∪ 𝐴 ∈ 𝐴 ↔ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝑦 ⊆ 𝑥)) | |
| 3 | 1, 2 | ax-mp 5 | 1 ⊢ (∪ 𝐴 ∈ 𝐴 ↔ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝑦 ⊆ 𝑥) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∈ wcel 2146 ∀wral 3079 ∃wrex 3089 ⊆ wss 3899 ∪ cuni 4869 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2196 ax-12 2215 ax-ext 2735 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-tru 1572 df-ex 1812 df-nf 1816 df-sb 2101 df-clab 2742 df-cleq 2755 df-clel 2838 df-ral 3080 df-rex 3090 df-ss 3900 df-uni 4870 |
| This theorem is used by: onsupnmax 44370 onsupeqmax 44388 onsupeqnmax 44389 |
| Copyright terms: Public domain | W3C validator |