| 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 3953 | . 2 ⊢ 𝐴 ⊆ 𝐴 | |
| 2 | unielss 44062 | . 2 ⊢ (𝐴 ⊆ 𝐴 → (∪ 𝐴 ∈ 𝐴 ↔ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝑦 ⊆ 𝑥)) | |
| 3 | 1, 2 | ax-mp 5 | 1 ⊢ (∪ 𝐴 ∈ 𝐴 ↔ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝑦 ⊆ 𝑥) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∈ wcel 2145 ∀wral 3076 ∃wrex 3086 ⊆ wss 3899 ∪ cuni 4867 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-tru 1573 df-ex 1813 df-nf 1817 df-sb 2100 df-clab 2739 df-cleq 2752 df-clel 2835 df-ral 3077 df-rex 3087 df-ss 3916 df-uni 4868 |
| This theorem is used by: onsupnmax 44072 onsupeqmax 44090 onsupeqnmax 44091 |
| Copyright terms: Public domain | W3C validator |