| Mathbox for Peter Mazsa |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > qseq | Structured version Visualization version GIF version | ||
| Description: The quotient set equal to
a class.
This theorem is used when a class 𝐴 is identified with a quotient (dom 𝑅 / 𝑅). In such a situation, every element 𝑢 ∈ 𝐴 is an 𝑅-coset [𝑣]𝑅 for some 𝑣 ∈ dom 𝑅, but there is no requirement that the "witness" 𝑣 be equal to its own block [𝑣]𝑅. 𝐴 is a set of blocks (equivalence classes), not a set of raw witnesses. In particular, when (dom 𝑅 / 𝑅) = 𝐴 is read together with a partition hypothesis 𝑅 Part 𝐴 (defined as dfpart2 39581), 𝐴 is being treated as the set of blocks [𝑣]𝑅; it does not assert any fixed-point condition 𝑣 = [𝑣]𝑅 such as would arise from the mistaken reading 𝑢 ∈ 𝐴 ↔ 𝑢 = [𝑢]𝑅. Cf. dmqsblocks 39676. (Contributed by Peter Mazsa, 19-Oct-2018.) |
| Ref | Expression |
|---|---|
| qseq | ⊢ ((𝐵 / 𝑅) = 𝐴 ↔ ∀𝑢(𝑢 ∈ 𝐴 ↔ ∃𝑣 ∈ 𝐵 𝑢 = [𝑣]𝑅)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-qs 8706 | . . 3 ⊢ (𝐵 / 𝑅) = {𝑢 ∣ ∃𝑣 ∈ 𝐵 𝑢 = [𝑣]𝑅} | |
| 2 | 1 | eqeq2i 2778 | . 2 ⊢ (𝐴 = (𝐵 / 𝑅) ↔ 𝐴 = {𝑢 ∣ ∃𝑣 ∈ 𝐵 𝑢 = [𝑣]𝑅}) |
| 3 | eqcom 2772 | . 2 ⊢ (𝐴 = (𝐵 / 𝑅) ↔ (𝐵 / 𝑅) = 𝐴) | |
| 4 | eqabb 2904 | . 2 ⊢ (𝐴 = {𝑢 ∣ ∃𝑣 ∈ 𝐵 𝑢 = [𝑣]𝑅} ↔ ∀𝑢(𝑢 ∈ 𝐴 ↔ ∃𝑣 ∈ 𝐵 𝑢 = [𝑣]𝑅)) | |
| 5 | 2, 3, 4 | 3bitr3i 304 | 1 ⊢ ((𝐵 / 𝑅) = 𝐴 ↔ ∀𝑢(𝑢 ∈ 𝐴 ↔ ∃𝑣 ∈ 𝐵 𝑢 = [𝑣]𝑅)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∀wal 1568 = wceq 1570 ∈ wcel 2146 {cab 2743 ∃wrex 3091 [cec 8698 / cqs 8699 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-tru 1573 df-ex 1813 df-nf 1817 df-sb 2100 df-clab 2744 df-cleq 2757 df-clel 2840 df-qs 8706 |
| This theorem is used by: dmqsblocks 39676 |
| Copyright terms: Public domain | W3C validator |