| Mathbox for Peter Mazsa |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > disjimdmqseq | Structured version Visualization version GIF version | ||
| Description: Disjointness implies unique-generation of quotient blocks. Converts existence-quotient comprehension (see df-qs 8686) into a uniqueness-comprehension under disjointness; rewrites (dom 𝑅 / 𝑅) carriers as exactly the class of blocks with a unique representative. This is the "unique generator per block" content in a carrier-normal form. (Contributed by Peter Mazsa, 5-Feb-2026.) |
| Ref | Expression |
|---|---|
| disjimdmqseq | ⊢ ( Disj 𝑅 → (dom 𝑅 / 𝑅) = {𝑡 ∣ ∃!𝑢 ∈ dom 𝑅 𝑡 = [𝑢]𝑅}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | disjimrmoeqec 39312 | . . . 4 ⊢ ( Disj 𝑅 → ∃*𝑢 ∈ dom 𝑅 𝑡 = [𝑢]𝑅) | |
| 2 | 1 | biantrud 539 | . . 3 ⊢ ( Disj 𝑅 → (𝑡 ∈ (dom 𝑅 / 𝑅) ↔ (𝑡 ∈ (dom 𝑅 / 𝑅) ∧ ∃*𝑢 ∈ dom 𝑅 𝑡 = [𝑢]𝑅))) |
| 3 | elqsg 8747 | . . . . . 6 ⊢ (𝑡 ∈ V → (𝑡 ∈ (dom 𝑅 / 𝑅) ↔ ∃𝑢 ∈ dom 𝑅 𝑡 = [𝑢]𝑅)) | |
| 4 | 3 | elv 3461 | . . . . 5 ⊢ (𝑡 ∈ (dom 𝑅 / 𝑅) ↔ ∃𝑢 ∈ dom 𝑅 𝑡 = [𝑢]𝑅) |
| 5 | 4 | anbi1i 633 | . . . 4 ⊢ ((𝑡 ∈ (dom 𝑅 / 𝑅) ∧ ∃*𝑢 ∈ dom 𝑅 𝑡 = [𝑢]𝑅) ↔ (∃𝑢 ∈ dom 𝑅 𝑡 = [𝑢]𝑅 ∧ ∃*𝑢 ∈ dom 𝑅 𝑡 = [𝑢]𝑅)) |
| 6 | reu5 3371 | . . . 4 ⊢ (∃!𝑢 ∈ dom 𝑅 𝑡 = [𝑢]𝑅 ↔ (∃𝑢 ∈ dom 𝑅 𝑡 = [𝑢]𝑅 ∧ ∃*𝑢 ∈ dom 𝑅 𝑡 = [𝑢]𝑅)) | |
| 7 | 5, 6 | bitr4i 280 | . . 3 ⊢ ((𝑡 ∈ (dom 𝑅 / 𝑅) ∧ ∃*𝑢 ∈ dom 𝑅 𝑡 = [𝑢]𝑅) ↔ ∃!𝑢 ∈ dom 𝑅 𝑡 = [𝑢]𝑅) |
| 8 | 2, 7 | bitrdi 289 | . 2 ⊢ ( Disj 𝑅 → (𝑡 ∈ (dom 𝑅 / 𝑅) ↔ ∃!𝑢 ∈ dom 𝑅 𝑡 = [𝑢]𝑅)) |
| 9 | 8 | eqabdv 2897 | 1 ⊢ ( Disj 𝑅 → (dom 𝑅 / 𝑅) = {𝑡 ∣ ∃!𝑢 ∈ dom 𝑅 𝑡 = [𝑢]𝑅}) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 399 = wceq 1562 ∈ wcel 2144 {cab 2742 ∃wrex 3088 ∃!wreu 3367 ∃*wrmo 3368 Vcvv 3456 dom cdm 5649 [cec 8678 / cqs 8679 Disj wdisjALTV 38723 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1817 ax-4 1831 ax-5 1932 ax-6 1989 ax-7 2030 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2214 ax-ext 2736 ax-sep 5248 ax-pr 5392 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1101 df-tru 1565 df-fal 1575 df-ex 1802 df-nf 1806 df-sb 2093 df-mo 2568 df-eu 2598 df-clab 2743 df-cleq 2756 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3079 df-rex 3089 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3458 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4288 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-br 5103 df-opab 5165 df-id 5544 df-xp 5655 df-rel 5656 df-cnv 5657 df-co 5658 df-dm 5659 df-rn 5660 df-res 5661 df-ima 5662 df-ec 8682 df-qs 8686 df-coss 39005 df-cnvrefrel 39111 df-disjALTV 39294 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |