| 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 8750 but with a weaker antecedent: only the restriction of 𝑅 by 𝐴 needs to be a set, not 𝑅 itself, see e.g. cnvepima 38797. (Contributed by NM, 9-Dec-2008.) (Revised by Peter Mazsa, 20-Jun-2019.) |
| Ref | Expression |
|---|---|
| uniqs | ⊢ ((𝑅 ↾ 𝐴) ∈ 𝑉 → ∪ (𝐴 / 𝑅) = (𝑅 “ 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elecex 8723 | . . . . 5 ⊢ ((𝑅 ↾ 𝐴) ∈ 𝑉 → (𝑥 ∈ 𝐴 → [𝑥]𝑅 ∈ V)) | |
| 2 | 1 | ralrimiv 3152 | . . . 4 ⊢ ((𝑅 ↾ 𝐴) ∈ 𝑉 → ∀𝑥 ∈ 𝐴 [𝑥]𝑅 ∈ V) |
| 3 | dfiun2g 4984 | . . . 4 ⊢ (∀𝑥 ∈ 𝐴 [𝑥]𝑅 ∈ V → ∪ 𝑥 ∈ 𝐴 [𝑥]𝑅 = ∪ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = [𝑥]𝑅}) | |
| 4 | 2, 3 | syl 17 | . . 3 ⊢ ((𝑅 ↾ 𝐴) ∈ 𝑉 → ∪ 𝑥 ∈ 𝐴 [𝑥]𝑅 = ∪ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = [𝑥]𝑅}) |
| 5 | 4 | eqcomd 2767 | . 2 ⊢ ((𝑅 ↾ 𝐴) ∈ 𝑉 → ∪ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = [𝑥]𝑅} = ∪ 𝑥 ∈ 𝐴 [𝑥]𝑅) |
| 6 | df-qs 8678 | . . 3 ⊢ (𝐴 / 𝑅) = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = [𝑥]𝑅} | |
| 7 | 6 | unieqi 4874 | . 2 ⊢ ∪ (𝐴 / 𝑅) = ∪ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = [𝑥]𝑅} |
| 8 | df-ec 8674 | . . . . 5 ⊢ [𝑥]𝑅 = (𝑅 “ {𝑥}) | |
| 9 | 8 | a1i 11 | . . . 4 ⊢ (𝑥 ∈ 𝐴 → [𝑥]𝑅 = (𝑅 “ {𝑥})) |
| 10 | 9 | iuneq2i 4968 | . . 3 ⊢ ∪ 𝑥 ∈ 𝐴 [𝑥]𝑅 = ∪ 𝑥 ∈ 𝐴 (𝑅 “ {𝑥}) |
| 11 | imaiun 7224 | . . 3 ⊢ (𝑅 “ ∪ 𝑥 ∈ 𝐴 {𝑥}) = ∪ 𝑥 ∈ 𝐴 (𝑅 “ {𝑥}) | |
| 12 | iunid 5015 | . . . 4 ⊢ ∪ 𝑥 ∈ 𝐴 {𝑥} = 𝐴 | |
| 13 | 12 | imaeq2i 6043 | . . 3 ⊢ (𝑅 “ ∪ 𝑥 ∈ 𝐴 {𝑥}) = (𝑅 “ 𝐴) |
| 14 | 10, 11, 13 | 3eqtr2ri 2791 | . 2 ⊢ (𝑅 “ 𝐴) = ∪ 𝑥 ∈ 𝐴 [𝑥]𝑅 |
| 15 | 5, 7, 14 | 3eqtr4g 2821 | 1 ⊢ ((𝑅 ↾ 𝐴) ∈ 𝑉 → ∪ (𝐴 / 𝑅) = (𝑅 “ 𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1559 ∈ wcel 2141 {cab 2739 ∀wral 3075 ∃wrex 3085 Vcvv 3453 {csn 4579 ∪ cuni 4862 ∪ ciun 4946 ↾ cres 5645 “ cima 5646 [cec 8670 / cqs 8671 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-11 2190 ax-ext 2733 ax-sep 5243 ax-pr 5387 ax-un 7713 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-sb 2090 df-clab 2740 df-cleq 2753 df-clel 2836 df-ral 3076 df-rex 3086 df-rab 3414 df-v 3455 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4284 df-if 4478 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4863 df-iun 4948 df-br 5098 df-opab 5160 df-xp 5649 df-rel 5650 df-cnv 5651 df-dm 5653 df-rn 5654 df-res 5655 df-ima 5656 df-ec 8674 df-qs 8678 |
| This theorem is referenced by: uniqsw 8750 rnresequniqs 38794 cnvepima 38797 |
| Copyright terms: Public domain | W3C validator |