| 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 2762 | . . 3 ⊢ (𝐴 / 𝑅) = (𝐴 / 𝑅) | |
| 3 | eqeq1 2766 | . . . 4 ⊢ ([𝑥]𝑅 = 𝐵 → ([𝑥]𝑅 = 𝐶 ↔ 𝐵 = 𝐶)) | |
| 4 | ineq1 4165 | . . . . 5 ⊢ ([𝑥]𝑅 = 𝐵 → ([𝑥]𝑅 ∩ 𝐶) = (𝐵 ∩ 𝐶)) | |
| 5 | 4 | eqeq1d 2764 | . . . 4 ⊢ ([𝑥]𝑅 = 𝐵 → (([𝑥]𝑅 ∩ 𝐶) = ∅ ↔ (𝐵 ∩ 𝐶) = ∅)) |
| 6 | 3, 5 | orbi12d 929 | . . 3 ⊢ ([𝑥]𝑅 = 𝐵 → (([𝑥]𝑅 = 𝐶 ∨ ([𝑥]𝑅 ∩ 𝐶) = ∅) ↔ (𝐵 = 𝐶 ∨ (𝐵 ∩ 𝐶) = ∅))) |
| 7 | qsdisj.3 | . . . 4 ⊢ (𝜑 → 𝐶 ∈ (𝐴 / 𝑅)) | |
| 8 | eqeq2 2774 | . . . . . 6 ⊢ ([𝑦]𝑅 = 𝐶 → ([𝑥]𝑅 = [𝑦]𝑅 ↔ [𝑥]𝑅 = 𝐶)) | |
| 9 | ineq2 4166 | . . . . . . 7 ⊢ ([𝑦]𝑅 = 𝐶 → ([𝑥]𝑅 ∩ [𝑦]𝑅) = ([𝑥]𝑅 ∩ 𝐶)) | |
| 10 | 9 | eqeq1d 2764 | . . . . . 6 ⊢ ([𝑦]𝑅 = 𝐶 → (([𝑥]𝑅 ∩ [𝑦]𝑅) = ∅ ↔ ([𝑥]𝑅 ∩ 𝐶) = ∅)) |
| 11 | 8, 10 | orbi12d 929 | . . . . 5 ⊢ ([𝑦]𝑅 = 𝐶 → (([𝑥]𝑅 = [𝑦]𝑅 ∨ ([𝑥]𝑅 ∩ [𝑦]𝑅) = ∅) ↔ ([𝑥]𝑅 = 𝐶 ∨ ([𝑥]𝑅 ∩ 𝐶) = ∅))) |
| 12 | qsdisj.1 | . . . . . . 7 ⊢ (𝜑 → 𝑅 Er 𝑋) | |
| 13 | 12 | ad2antrr 736 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ 𝐴) → 𝑅 Er 𝑋) |
| 14 | erdisj 8736 | . . . . . 6 ⊢ (𝑅 Er 𝑋 → ([𝑥]𝑅 = [𝑦]𝑅 ∨ ([𝑥]𝑅 ∩ [𝑦]𝑅) = ∅)) | |
| 15 | 13, 14 | syl 17 | . . . . 5 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ 𝐴) → ([𝑥]𝑅 = [𝑦]𝑅 ∨ ([𝑥]𝑅 ∩ [𝑦]𝑅) = ∅)) |
| 16 | 2, 11, 15 | ectocld 8764 | . . . 4 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝐶 ∈ (𝐴 / 𝑅)) → ([𝑥]𝑅 = 𝐶 ∨ ([𝑥]𝑅 ∩ 𝐶) = ∅)) |
| 17 | 7, 16 | mpidan 699 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ([𝑥]𝑅 = 𝐶 ∨ ([𝑥]𝑅 ∩ 𝐶) = ∅)) |
| 18 | 2, 6, 17 | ectocld 8764 | . 2 ⊢ ((𝜑 ∧ 𝐵 ∈ (𝐴 / 𝑅)) → (𝐵 = 𝐶 ∨ (𝐵 ∩ 𝐶) = ∅)) |
| 19 | 1, 18 | mpdan 697 | 1 ⊢ (𝜑 → (𝐵 = 𝐶 ∨ (𝐵 ∩ 𝐶) = ∅)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 399 ∨ wo 858 = wceq 1560 ∈ wcel 2142 ∩ cin 3903 ∅c0 4285 Er wer 8675 [cec 8676 / cqs 8677 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-8 2144 ax-9 2152 ax-ext 2734 ax-sep 5246 ax-pr 5390 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1100 df-tru 1563 df-fal 1573 df-ex 1800 df-sb 2091 df-clab 2741 df-cleq 2754 df-clel 2837 df-ne 2958 df-ral 3077 df-rex 3087 df-rab 3415 df-v 3456 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4481 df-sn 4583 df-pr 4585 df-op 4589 df-br 5101 df-opab 5163 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-er 8678 df-ec 8680 df-qs 8684 |
| This theorem is referenced by: qsdisj2 8777 uniinqs 8779 cldsubg 24168 erprt 39494 |
| Copyright terms: Public domain | W3C validator |