| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > qsdisj | Structured version Visualization version GIF version | ||
| Description: Members of a quotient set do not overlap. (Contributed by Rodolfo Medina, 12-Oct-2010.) (Revised by Mario Carneiro, 11-Jul-2014.) |
| Ref | Expression |
|---|---|
| qsdisj.1 | ⊢ (𝜑 → 𝑅 Er 𝑋) |
| qsdisj.2 | ⊢ (𝜑 → 𝐵 ∈ (𝐴 / 𝑅)) |
| qsdisj.3 | ⊢ (𝜑 → 𝐶 ∈ (𝐴 / 𝑅)) |
| Ref | Expression |
|---|---|
| qsdisj | ⊢ (𝜑 → (𝐵 = 𝐶 ∨ (𝐵 ∩ 𝐶) = ∅)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | qsdisj.2 | . 2 ⊢ (𝜑 → 𝐵 ∈ (𝐴 / 𝑅)) | |
| 2 | eqid 2731 | . . 3 ⊢ (𝐴 / 𝑅) = (𝐴 / 𝑅) | |
| 3 | eqeq1 2735 | . . . 4 ⊢ ([𝑥]𝑅 = 𝐵 → ([𝑥]𝑅 = 𝐶 ↔ 𝐵 = 𝐶)) | |
| 4 | ineq1 4160 | . . . . 5 ⊢ ([𝑥]𝑅 = 𝐵 → ([𝑥]𝑅 ∩ 𝐶) = (𝐵 ∩ 𝐶)) | |
| 5 | 4 | eqeq1d 2733 | . . . 4 ⊢ ([𝑥]𝑅 = 𝐵 → (([𝑥]𝑅 ∩ 𝐶) = ∅ ↔ (𝐵 ∩ 𝐶) = ∅)) |
| 6 | 3, 5 | orbi12d 918 | . . 3 ⊢ ([𝑥]𝑅 = 𝐵 → (([𝑥]𝑅 = 𝐶 ∨ ([𝑥]𝑅 ∩ 𝐶) = ∅) ↔ (𝐵 = 𝐶 ∨ (𝐵 ∩ 𝐶) = ∅))) |
| 7 | qsdisj.3 | . . . 4 ⊢ (𝜑 → 𝐶 ∈ (𝐴 / 𝑅)) | |
| 8 | eqeq2 2743 | . . . . . 6 ⊢ ([𝑦]𝑅 = 𝐶 → ([𝑥]𝑅 = [𝑦]𝑅 ↔ [𝑥]𝑅 = 𝐶)) | |
| 9 | ineq2 4161 | . . . . . . 7 ⊢ ([𝑦]𝑅 = 𝐶 → ([𝑥]𝑅 ∩ [𝑦]𝑅) = ([𝑥]𝑅 ∩ 𝐶)) | |
| 10 | 9 | eqeq1d 2733 | . . . . . 6 ⊢ ([𝑦]𝑅 = 𝐶 → (([𝑥]𝑅 ∩ [𝑦]𝑅) = ∅ ↔ ([𝑥]𝑅 ∩ 𝐶) = ∅)) |
| 11 | 8, 10 | orbi12d 918 | . . . . 5 ⊢ ([𝑦]𝑅 = 𝐶 → (([𝑥]𝑅 = [𝑦]𝑅 ∨ ([𝑥]𝑅 ∩ [𝑦]𝑅) = ∅) ↔ ([𝑥]𝑅 = 𝐶 ∨ ([𝑥]𝑅 ∩ 𝐶) = ∅))) |
| 12 | qsdisj.1 | . . . . . . 7 ⊢ (𝜑 → 𝑅 Er 𝑋) | |
| 13 | 12 | ad2antrr 726 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ 𝐴) → 𝑅 Er 𝑋) |
| 14 | erdisj 8679 | . . . . . 6 ⊢ (𝑅 Er 𝑋 → ([𝑥]𝑅 = [𝑦]𝑅 ∨ ([𝑥]𝑅 ∩ [𝑦]𝑅) = ∅)) | |
| 15 | 13, 14 | syl 17 | . . . . 5 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ 𝐴) → ([𝑥]𝑅 = [𝑦]𝑅 ∨ ([𝑥]𝑅 ∩ [𝑦]𝑅) = ∅)) |
| 16 | 2, 11, 15 | ectocld 8706 | . . . 4 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝐶 ∈ (𝐴 / 𝑅)) → ([𝑥]𝑅 = 𝐶 ∨ ([𝑥]𝑅 ∩ 𝐶) = ∅)) |
| 17 | 7, 16 | mpidan 689 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ([𝑥]𝑅 = 𝐶 ∨ ([𝑥]𝑅 ∩ 𝐶) = ∅)) |
| 18 | 2, 6, 17 | ectocld 8706 | . 2 ⊢ ((𝜑 ∧ 𝐵 ∈ (𝐴 / 𝑅)) → (𝐵 = 𝐶 ∨ (𝐵 ∩ 𝐶) = ∅)) |
| 19 | 1, 18 | mpdan 687 | 1 ⊢ (𝜑 → (𝐵 = 𝐶 ∨ (𝐵 ∩ 𝐶) = ∅)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∨ wo 847 = wceq 1541 ∈ wcel 2111 ∩ cin 3896 ∅c0 4280 Er wer 8619 [cec 8620 / cqs 8621 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-ext 2703 ax-sep 5232 ax-nul 5242 ax-pr 5368 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-sb 2068 df-clab 2710 df-cleq 2723 df-clel 2806 df-ne 2929 df-ral 3048 df-rex 3057 df-rab 3396 df-v 3438 df-dif 3900 df-un 3902 df-in 3904 df-ss 3914 df-nul 4281 df-if 4473 df-sn 4574 df-pr 4576 df-op 4580 df-br 5090 df-opab 5152 df-xp 5620 df-rel 5621 df-cnv 5622 df-co 5623 df-dm 5624 df-rn 5625 df-res 5626 df-ima 5627 df-er 8622 df-ec 8624 df-qs 8628 |
| This theorem is referenced by: qsdisj2 8719 uniinqs 8721 cldsubg 24026 erprt 38920 |
| Copyright terms: Public domain | W3C validator |