| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > uniqsw | Structured version Visualization version GIF version | ||
| Description: The union of a quotient set. More restrictive antecedent; kept for backward compatibility; for new work, prefer uniqs 8769. (Contributed by NM, 9-Dec-2008.) (Proof shortened by AV, 25-Nov-2025.) |
| Ref | Expression |
|---|---|
| uniqsw | ⊢ (𝑅 ∈ 𝑉 → ∪ (𝐴 / 𝑅) = (𝑅 “ 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | resexg 6025 | . 2 ⊢ (𝑅 ∈ 𝑉 → (𝑅 ↾ 𝐴) ∈ V) | |
| 2 | uniqs 8769 | . 2 ⊢ ((𝑅 ↾ 𝐴) ∈ V → ∪ (𝐴 / 𝑅) = (𝑅 “ 𝐴)) | |
| 3 | 1, 2 | syl 18 | 1 ⊢ (𝑅 ∈ 𝑉 → ∪ (𝐴 / 𝑅) = (𝑅 “ 𝐴)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1569 ∈ wcel 2142 Vcvv 3454 ∪ cuni 4871 ↾ cres 5662 “ cima 5663 / cqs 8691 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-11 2191 ax-ext 2734 ax-sep 5256 ax-pr 5403 ax-un 7734 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-sb 2096 df-clab 2741 df-cleq 2754 df-clel 2837 df-ral 3079 df-rex 3089 df-rab 3416 df-v 3456 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4487 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-iun 4957 df-br 5109 df-opab 5173 df-xp 5666 df-rel 5667 df-cnv 5668 df-dm 5670 df-rn 5671 df-res 5672 df-ima 5673 df-ec 8694 df-qs 8698 |
| This theorem is used by: uniqs2 8772 ecqs 8775 |
| Copyright terms: Public domain | W3C validator |