| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > uniqs | Structured version Visualization version GIF version | ||
| Description: The union of a quotient set, like uniqsw 8768 but with a weaker antecedent: only the restriction of 𝑅 by 𝐴 needs to be a set, not 𝑅 itself, see e.g. cnvepima 38986. (Contributed by NM, 9-Dec-2008.) (Revised by Peter Mazsa, 20-Jun-2019.) |
| Ref | Expression |
|---|---|
| uniqs | ⊢ ((𝑅 ↾ 𝐴) ∈ 𝑉 → ∪ (𝐴 / 𝑅) = (𝑅 “ 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elecex 8741 | . . . . 5 ⊢ ((𝑅 ↾ 𝐴) ∈ 𝑉 → (𝑥 ∈ 𝐴 → [𝑥]𝑅 ∈ V)) | |
| 2 | 1 | ralrimiv 3156 | . . . 4 ⊢ ((𝑅 ↾ 𝐴) ∈ 𝑉 → ∀𝑥 ∈ 𝐴 [𝑥]𝑅 ∈ V) |
| 3 | dfiun2g 4994 | . . . 4 ⊢ (∀𝑥 ∈ 𝐴 [𝑥]𝑅 ∈ V → ∪ 𝑥 ∈ 𝐴 [𝑥]𝑅 = ∪ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = [𝑥]𝑅}) | |
| 4 | 2, 3 | syl 18 | . . 3 ⊢ ((𝑅 ↾ 𝐴) ∈ 𝑉 → ∪ 𝑥 ∈ 𝐴 [𝑥]𝑅 = ∪ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = [𝑥]𝑅}) |
| 5 | 4 | eqcomd 2769 | . 2 ⊢ ((𝑅 ↾ 𝐴) ∈ 𝑉 → ∪ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = [𝑥]𝑅} = ∪ 𝑥 ∈ 𝐴 [𝑥]𝑅) |
| 6 | df-qs 8696 | . . 3 ⊢ (𝐴 / 𝑅) = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = [𝑥]𝑅} | |
| 7 | 6 | unieqi 4884 | . 2 ⊢ ∪ (𝐴 / 𝑅) = ∪ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = [𝑥]𝑅} |
| 8 | df-ec 8692 | . . . . 5 ⊢ [𝑥]𝑅 = (𝑅 “ {𝑥}) | |
| 9 | 8 | a1i 11 | . . . 4 ⊢ (𝑥 ∈ 𝐴 → [𝑥]𝑅 = (𝑅 “ {𝑥})) |
| 10 | 9 | iuneq2i 4978 | . . 3 ⊢ ∪ 𝑥 ∈ 𝐴 [𝑥]𝑅 = ∪ 𝑥 ∈ 𝐴 (𝑅 “ {𝑥}) |
| 11 | imaiun 7243 | . . 3 ⊢ (𝑅 “ ∪ 𝑥 ∈ 𝐴 {𝑥}) = ∪ 𝑥 ∈ 𝐴 (𝑅 “ {𝑥}) | |
| 12 | iunid 5025 | . . . 4 ⊢ ∪ 𝑥 ∈ 𝐴 {𝑥} = 𝐴 | |
| 13 | 12 | imaeq2i 6060 | . . 3 ⊢ (𝑅 “ ∪ 𝑥 ∈ 𝐴 {𝑥}) = (𝑅 “ 𝐴) |
| 14 | 10, 11, 13 | 3eqtr2ri 2793 | . 2 ⊢ (𝑅 “ 𝐴) = ∪ 𝑥 ∈ 𝐴 [𝑥]𝑅 |
| 15 | 5, 7, 14 | 3eqtr4g 2823 | 1 ⊢ ((𝑅 ↾ 𝐴) ∈ 𝑉 → ∪ (𝐴 / 𝑅) = (𝑅 “ 𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1570 ∈ wcel 2143 {cab 2741 ∀wral 3079 ∃wrex 3089 Vcvv 3455 {csn 4589 ∪ cuni 4872 ∪ ciun 4956 ↾ cres 5663 “ cima 5664 [cec 8688 / cqs 8689 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-11 2192 ax-ext 2735 ax-sep 5257 ax-pr 5404 ax-un 7732 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-sb 2097 df-clab 2742 df-cleq 2755 df-clel 2838 df-ral 3080 df-rex 3090 df-rab 3417 df-v 3457 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4488 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-iun 4958 df-br 5110 df-opab 5174 df-xp 5667 df-rel 5668 df-cnv 5669 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-ec 8692 df-qs 8696 |
| This theorem is referenced by: uniqsw 8768 rnresequniqs 38983 cnvepima 38986 |
| Copyright terms: Public domain | W3C validator |