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 3939 | . . 3 ⊢ 𝐴 ⊆ 𝐴 | |
2 | sseq1 3942 | . . . 4 ⊢ (𝑥 = 𝐴 → (𝑥 ⊆ 𝐴 ↔ 𝐴 ⊆ 𝐴)) | |
3 | 2 | elrab3 3618 | . . 3 ⊢ (𝐴 ∈ 𝐵 → (𝐴 ∈ {𝑥 ∈ 𝐵 ∣ 𝑥 ⊆ 𝐴} ↔ 𝐴 ⊆ 𝐴)) |
4 | 1, 3 | mpbiri 257 | . 2 ⊢ (𝐴 ∈ 𝐵 → 𝐴 ∈ {𝑥 ∈ 𝐵 ∣ 𝑥 ⊆ 𝐴}) |
5 | sseq1 3942 | . . . . 5 ⊢ (𝑥 = 𝑦 → (𝑥 ⊆ 𝐴 ↔ 𝑦 ⊆ 𝐴)) | |
6 | 5 | elrab 3617 | . . . 4 ⊢ (𝑦 ∈ {𝑥 ∈ 𝐵 ∣ 𝑥 ⊆ 𝐴} ↔ (𝑦 ∈ 𝐵 ∧ 𝑦 ⊆ 𝐴)) |
7 | 6 | simprbi 496 | . . 3 ⊢ (𝑦 ∈ {𝑥 ∈ 𝐵 ∣ 𝑥 ⊆ 𝐴} → 𝑦 ⊆ 𝐴) |
8 | 7 | rgen 3073 | . 2 ⊢ ∀𝑦 ∈ {𝑥 ∈ 𝐵 ∣ 𝑥 ⊆ 𝐴}𝑦 ⊆ 𝐴 |
9 | ssunieq 4873 | . . 3 ⊢ ((𝐴 ∈ {𝑥 ∈ 𝐵 ∣ 𝑥 ⊆ 𝐴} ∧ ∀𝑦 ∈ {𝑥 ∈ 𝐵 ∣ 𝑥 ⊆ 𝐴}𝑦 ⊆ 𝐴) → 𝐴 = ∪ {𝑥 ∈ 𝐵 ∣ 𝑥 ⊆ 𝐴}) | |
10 | 9 | eqcomd 2744 | . 2 ⊢ ((𝐴 ∈ {𝑥 ∈ 𝐵 ∣ 𝑥 ⊆ 𝐴} ∧ ∀𝑦 ∈ {𝑥 ∈ 𝐵 ∣ 𝑥 ⊆ 𝐴}𝑦 ⊆ 𝐴) → ∪ {𝑥 ∈ 𝐵 ∣ 𝑥 ⊆ 𝐴} = 𝐴) |
11 | 4, 8, 10 | sylancl 585 | 1 ⊢ (𝐴 ∈ 𝐵 → ∪ {𝑥 ∈ 𝐵 ∣ 𝑥 ⊆ 𝐴} = 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1539 ∈ wcel 2108 ∀wral 3063 {crab 3067 ⊆ wss 3883 ∪ cuni 4836 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-11 2156 ax-ext 2709 |
This theorem depends on definitions: df-bi 206 df-an 396 df-tru 1542 df-ex 1784 df-sb 2069 df-clab 2716 df-cleq 2730 df-clel 2817 df-ral 3068 df-rab 3072 df-v 3424 df-in 3890 df-ss 3900 df-uni 4837 |
This theorem is referenced by: lssuni 20116 chsupid 29675 shatomistici 30624 lssats 36953 lpssat 36954 lssatle 36956 lssat 36957 mrelatglbALT 46170 mreclat 46171 toplatmeet 46177 |
Copyright terms: Public domain | W3C validator |