| 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 2763 | . . 3 ⊢ (𝐴 / 𝑅) = (𝐴 / 𝑅) | |
| 3 | eqeq1 2767 | . . . 4 ⊢ ([𝑥]𝑅 = 𝐵 → ([𝑥]𝑅 = 𝐶 ↔ 𝐵 = 𝐶)) | |
| 4 | ineq1 4166 | . . . . 5 ⊢ ([𝑥]𝑅 = 𝐵 → ([𝑥]𝑅 ∩ 𝐶) = (𝐵 ∩ 𝐶)) | |
| 5 | 4 | eqeq1d 2765 | . . . 4 ⊢ ([𝑥]𝑅 = 𝐵 → (([𝑥]𝑅 ∩ 𝐶) = ∅ ↔ (𝐵 ∩ 𝐶) = ∅)) |
| 6 | 3, 5 | orbi12d 931 | . . 3 ⊢ ([𝑥]𝑅 = 𝐵 → (([𝑥]𝑅 = 𝐶 ∨ ([𝑥]𝑅 ∩ 𝐶) = ∅) ↔ (𝐵 = 𝐶 ∨ (𝐵 ∩ 𝐶) = ∅))) |
| 7 | qsdisj.3 | . . . 4 ⊢ (𝜑 → 𝐶 ∈ (𝐴 / 𝑅)) | |
| 8 | eqeq2 2775 | . . . . . 6 ⊢ ([𝑦]𝑅 = 𝐶 → ([𝑥]𝑅 = [𝑦]𝑅 ↔ [𝑥]𝑅 = 𝐶)) | |
| 9 | ineq2 4167 | . . . . . . 7 ⊢ ([𝑦]𝑅 = 𝐶 → ([𝑥]𝑅 ∩ [𝑦]𝑅) = ([𝑥]𝑅 ∩ 𝐶)) | |
| 10 | 9 | eqeq1d 2765 | . . . . . 6 ⊢ ([𝑦]𝑅 = 𝐶 → (([𝑥]𝑅 ∩ [𝑦]𝑅) = ∅ ↔ ([𝑥]𝑅 ∩ 𝐶) = ∅)) |
| 11 | 8, 10 | orbi12d 931 | . . . . 5 ⊢ ([𝑦]𝑅 = 𝐶 → (([𝑥]𝑅 = [𝑦]𝑅 ∨ ([𝑥]𝑅 ∩ [𝑦]𝑅) = ∅) ↔ ([𝑥]𝑅 = 𝐶 ∨ ([𝑥]𝑅 ∩ 𝐶) = ∅))) |
| 12 | qsdisj.1 | . . . . . . 7 ⊢ (𝜑 → 𝑅 Er 𝑋) | |
| 13 | 12 | ad2antrr 738 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ 𝐴) → 𝑅 Er 𝑋) |
| 14 | erdisj 8748 | . . . . . 6 ⊢ (𝑅 Er 𝑋 → ([𝑥]𝑅 = [𝑦]𝑅 ∨ ([𝑥]𝑅 ∩ [𝑦]𝑅) = ∅)) | |
| 15 | 13, 14 | syl 18 | . . . . 5 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ 𝐴) → ([𝑥]𝑅 = [𝑦]𝑅 ∨ ([𝑥]𝑅 ∩ [𝑦]𝑅) = ∅)) |
| 16 | 2, 11, 15 | ectocld 8776 | . . . 4 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝐶 ∈ (𝐴 / 𝑅)) → ([𝑥]𝑅 = 𝐶 ∨ ([𝑥]𝑅 ∩ 𝐶) = ∅)) |
| 17 | 7, 16 | mpidan 701 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ([𝑥]𝑅 = 𝐶 ∨ ([𝑥]𝑅 ∩ 𝐶) = ∅)) |
| 18 | 2, 6, 17 | ectocld 8776 | . 2 ⊢ ((𝜑 ∧ 𝐵 ∈ (𝐴 / 𝑅)) → (𝐵 = 𝐶 ∨ (𝐵 ∩ 𝐶) = ∅)) |
| 19 | 1, 18 | mpdan 699 | 1 ⊢ (𝜑 → (𝐵 = 𝐶 ∨ (𝐵 ∩ 𝐶) = ∅)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 ∨ wo 860 = wceq 1570 ∈ wcel 2143 ∩ cin 3904 ∅c0 4286 Er wer 8687 [cec 8688 / cqs 8689 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-ext 2735 ax-sep 5257 ax-pr 5404 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-sb 2097 df-clab 2742 df-cleq 2755 df-clel 2838 df-ne 2959 df-ral 3080 df-rex 3090 df-rab 3417 df-v 3457 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4488 df-sn 4590 df-pr 4592 df-op 4596 df-br 5110 df-opab 5174 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-er 8690 df-ec 8692 df-qs 8696 |
| This theorem is referenced by: qsdisj2 8789 uniinqs 8791 cldsubg 24268 erprt 39647 |
| Copyright terms: Public domain | W3C validator |