| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > unimax | Structured version Visualization version GIF version | ||
| Description: Any member of a class is the largest of those members that it includes. (Contributed by NM, 13-Aug-2002.) |
| Ref | Expression |
|---|---|
| unimax | ⊢ (𝐴 ∈ 𝐵 → ∪ {𝑥 ∈ 𝐵 ∣ 𝑥 ⊆ 𝐴} = 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ssid 3958 | . . 3 ⊢ 𝐴 ⊆ 𝐴 | |
| 2 | sseq1 3961 | . . . 4 ⊢ (𝑥 = 𝐴 → (𝑥 ⊆ 𝐴 ↔ 𝐴 ⊆ 𝐴)) | |
| 3 | 2 | elrab3 3649 | . . 3 ⊢ (𝐴 ∈ 𝐵 → (𝐴 ∈ {𝑥 ∈ 𝐵 ∣ 𝑥 ⊆ 𝐴} ↔ 𝐴 ⊆ 𝐴)) |
| 4 | 1, 3 | mpbiri 258 | . 2 ⊢ (𝐴 ∈ 𝐵 → 𝐴 ∈ {𝑥 ∈ 𝐵 ∣ 𝑥 ⊆ 𝐴}) |
| 5 | sseq1 3961 | . . . . 5 ⊢ (𝑥 = 𝑦 → (𝑥 ⊆ 𝐴 ↔ 𝑦 ⊆ 𝐴)) | |
| 6 | 5 | elrab 3648 | . . . 4 ⊢ (𝑦 ∈ {𝑥 ∈ 𝐵 ∣ 𝑥 ⊆ 𝐴} ↔ (𝑦 ∈ 𝐵 ∧ 𝑦 ⊆ 𝐴)) |
| 7 | 6 | simprbi 497 | . . 3 ⊢ (𝑦 ∈ {𝑥 ∈ 𝐵 ∣ 𝑥 ⊆ 𝐴} → 𝑦 ⊆ 𝐴) |
| 8 | 7 | rgen 3054 | . 2 ⊢ ∀𝑦 ∈ {𝑥 ∈ 𝐵 ∣ 𝑥 ⊆ 𝐴}𝑦 ⊆ 𝐴 |
| 9 | ssunieq 4901 | . . 3 ⊢ ((𝐴 ∈ {𝑥 ∈ 𝐵 ∣ 𝑥 ⊆ 𝐴} ∧ ∀𝑦 ∈ {𝑥 ∈ 𝐵 ∣ 𝑥 ⊆ 𝐴}𝑦 ⊆ 𝐴) → 𝐴 = ∪ {𝑥 ∈ 𝐵 ∣ 𝑥 ⊆ 𝐴}) | |
| 10 | 9 | eqcomd 2743 | . 2 ⊢ ((𝐴 ∈ {𝑥 ∈ 𝐵 ∣ 𝑥 ⊆ 𝐴} ∧ ∀𝑦 ∈ {𝑥 ∈ 𝐵 ∣ 𝑥 ⊆ 𝐴}𝑦 ⊆ 𝐴) → ∪ {𝑥 ∈ 𝐵 ∣ 𝑥 ⊆ 𝐴} = 𝐴) |
| 11 | 4, 8, 10 | sylancl 587 | 1 ⊢ (𝐴 ∈ 𝐵 → ∪ {𝑥 ∈ 𝐵 ∣ 𝑥 ⊆ 𝐴} = 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ∀wral 3052 {crab 3401 ⊆ wss 3903 ∪ cuni 4865 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2709 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-tru 1545 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-ral 3053 df-rab 3402 df-v 3444 df-ss 3920 df-uni 4866 |
| This theorem is referenced by: lssuni 20902 chsupid 31500 shatomistici 32449 lssats 39388 lpssat 39389 lssatle 39391 lssat 39392 mrelatglbALT 49355 mreclat 49356 toplatmeet 49362 |
| Copyright terms: Public domain | W3C validator |