| Mathbox for Peter Mazsa |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > brdmqssqs | Structured version Visualization version GIF version | ||
| Description: If 𝐴 and 𝑅 are sets, the domain quotient binary relation and the domain quotient predicate are the same. (Contributed by Peter Mazsa, 14-Aug-2021.) |
| Ref | Expression |
|---|---|
| brdmqssqs | ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑅 ∈ 𝑊) → (𝑅 DomainQss 𝐴 ↔ 𝑅 DomainQs 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | brdmqss 39039 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑅 ∈ 𝑊) → (𝑅 DomainQss 𝐴 ↔ (dom 𝑅 / 𝑅) = 𝐴)) | |
| 2 | df-dmqs 39032 | . 2 ⊢ (𝑅 DomainQs 𝐴 ↔ (dom 𝑅 / 𝑅) = 𝐴) | |
| 3 | 1, 2 | bitr4di 289 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑅 ∈ 𝑊) → (𝑅 DomainQss 𝐴 ↔ 𝑅 DomainQs 𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1542 ∈ wcel 2114 class class class wbr 5074 dom cdm 5620 / cqs 8631 DomainQss cdmqss 38515 DomainQs wdmqs 38516 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2707 ax-sep 5220 ax-pr 5364 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-clab 2714 df-cleq 2727 df-clel 2810 df-rex 3060 df-rab 3388 df-v 3429 df-dif 3888 df-un 3890 df-in 3892 df-ss 3902 df-nul 4264 df-if 4457 df-sn 4558 df-pr 4560 df-op 4564 df-br 5075 df-opab 5137 df-cnv 5628 df-dm 5630 df-rn 5631 df-res 5632 df-ima 5633 df-ec 8634 df-qs 8638 df-dmqss 39031 df-dmqs 39032 |
| This theorem is referenced by: brerser 39071 brpartspart 39185 |
| Copyright terms: Public domain | W3C validator |