| Mathbox for Peter Mazsa |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > rnqmapeleldisjsim | Structured version Visualization version GIF version | ||
| Description: Element-disjointness of the quotient carrier forces coset disjointness. Supplies the "cosets don't overlap unless equal" direction, but expressed via ran QMap 𝑅 (the quotient carrier) and ElDisjs. This is the structural reason Disjs needs a "carrier disjointness" level distinct from the "unique representatives" level. (Contributed by Peter Mazsa, 16-Feb-2026.) |
| Ref | Expression |
|---|---|
| rnqmapeleldisjsim | ⊢ ((𝑅 ∈ 𝑉 ∧ ran QMap 𝑅 ∈ ElDisjs ∧ (𝐴 ∈ dom 𝑅 ∧ 𝐵 ∈ dom 𝑅)) → (([𝐴]𝑅 ∩ [𝐵]𝑅) ≠ ∅ → [𝐴]𝑅 = [𝐵]𝑅)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rnqmap 38657 | . . . . 5 ⊢ ran QMap 𝑅 = (dom 𝑅 / 𝑅) | |
| 2 | 1 | eleq1i 2828 | . . . 4 ⊢ (ran QMap 𝑅 ∈ ElDisjs ↔ (dom 𝑅 / 𝑅) ∈ ElDisjs ) |
| 3 | dmqsex 38565 | . . . . 5 ⊢ (𝑅 ∈ 𝑉 → (dom 𝑅 / 𝑅) ∈ V) | |
| 4 | eleldisjseldisj 39032 | . . . . 5 ⊢ ((dom 𝑅 / 𝑅) ∈ V → ((dom 𝑅 / 𝑅) ∈ ElDisjs ↔ ElDisj (dom 𝑅 / 𝑅))) | |
| 5 | 3, 4 | syl 17 | . . . 4 ⊢ (𝑅 ∈ 𝑉 → ((dom 𝑅 / 𝑅) ∈ ElDisjs ↔ ElDisj (dom 𝑅 / 𝑅))) |
| 6 | 2, 5 | bitrid 283 | . . 3 ⊢ (𝑅 ∈ 𝑉 → (ran QMap 𝑅 ∈ ElDisjs ↔ ElDisj (dom 𝑅 / 𝑅))) |
| 7 | eldisjim3 39018 | . . . 4 ⊢ ( ElDisj (dom 𝑅 / 𝑅) → (([𝐴]𝑅 ∈ (dom 𝑅 / 𝑅) ∧ [𝐵]𝑅 ∈ (dom 𝑅 / 𝑅)) → (([𝐴]𝑅 ∩ [𝐵]𝑅) ≠ ∅ → [𝐴]𝑅 = [𝐵]𝑅))) | |
| 8 | eceldmqs 8728 | . . . . . 6 ⊢ (𝑅 ∈ 𝑉 → ([𝐴]𝑅 ∈ (dom 𝑅 / 𝑅) ↔ 𝐴 ∈ dom 𝑅)) | |
| 9 | eceldmqs 8728 | . . . . . 6 ⊢ (𝑅 ∈ 𝑉 → ([𝐵]𝑅 ∈ (dom 𝑅 / 𝑅) ↔ 𝐵 ∈ dom 𝑅)) | |
| 10 | 8, 9 | anbi12d 633 | . . . . 5 ⊢ (𝑅 ∈ 𝑉 → (([𝐴]𝑅 ∈ (dom 𝑅 / 𝑅) ∧ [𝐵]𝑅 ∈ (dom 𝑅 / 𝑅)) ↔ (𝐴 ∈ dom 𝑅 ∧ 𝐵 ∈ dom 𝑅))) |
| 11 | 10 | imbi1d 341 | . . . 4 ⊢ (𝑅 ∈ 𝑉 → ((([𝐴]𝑅 ∈ (dom 𝑅 / 𝑅) ∧ [𝐵]𝑅 ∈ (dom 𝑅 / 𝑅)) → (([𝐴]𝑅 ∩ [𝐵]𝑅) ≠ ∅ → [𝐴]𝑅 = [𝐵]𝑅)) ↔ ((𝐴 ∈ dom 𝑅 ∧ 𝐵 ∈ dom 𝑅) → (([𝐴]𝑅 ∩ [𝐵]𝑅) ≠ ∅ → [𝐴]𝑅 = [𝐵]𝑅)))) |
| 12 | 7, 11 | imbitrid 244 | . . 3 ⊢ (𝑅 ∈ 𝑉 → ( ElDisj (dom 𝑅 / 𝑅) → ((𝐴 ∈ dom 𝑅 ∧ 𝐵 ∈ dom 𝑅) → (([𝐴]𝑅 ∩ [𝐵]𝑅) ≠ ∅ → [𝐴]𝑅 = [𝐵]𝑅)))) |
| 13 | 6, 12 | sylbid 240 | . 2 ⊢ (𝑅 ∈ 𝑉 → (ran QMap 𝑅 ∈ ElDisjs → ((𝐴 ∈ dom 𝑅 ∧ 𝐵 ∈ dom 𝑅) → (([𝐴]𝑅 ∩ [𝐵]𝑅) ≠ ∅ → [𝐴]𝑅 = [𝐵]𝑅)))) |
| 14 | 13 | 3imp 1111 | 1 ⊢ ((𝑅 ∈ 𝑉 ∧ ran QMap 𝑅 ∈ ElDisjs ∧ (𝐴 ∈ dom 𝑅 ∧ 𝐵 ∈ dom 𝑅)) → (([𝐴]𝑅 ∩ [𝐵]𝑅) ≠ ∅ → [𝐴]𝑅 = [𝐵]𝑅)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ≠ wne 2933 Vcvv 3441 ∩ cin 3901 ∅c0 4286 dom cdm 5625 ran crn 5626 [cec 8635 / cqs 8636 QMap cqmap 38378 ElDisjs celdisjs 38423 ElDisj weldisj 38424 |
| 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-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5225 ax-sep 5242 ax-nul 5252 ax-pow 5311 ax-pr 5378 ax-un 7682 |
| 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-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3062 df-rmo 3351 df-rab 3401 df-v 3443 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4287 df-if 4481 df-pw 4557 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-iun 4949 df-br 5100 df-opab 5162 df-mpt 5181 df-id 5520 df-eprel 5525 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-ec 8639 df-qs 8643 df-rels 38643 df-qmap 38649 df-coss 38704 df-ssr 38781 df-cnvrefs 38808 df-cnvrefrels 38809 df-cnvrefrel 38810 df-disjss 38991 df-disjs 38992 df-disjALTV 38993 df-eldisjs 38994 df-eldisj 38995 |
| This theorem is referenced by: eldisjs6 39143 |
| Copyright terms: Public domain | W3C validator |