Theorem qsdisj 8384

Description: Members of a quotient set do not overlap. (Contributed by Rodolfo Medina, 12-Oct-2010.) (Revised by Mario Carneiro, 11-Jul-2014.)

Hypotheses

Ref	Expression
qsdisj.1	⊢ (𝜑 → 𝑅 Er 𝑋)
qsdisj.2	⊢ (𝜑 → 𝐵 ∈ (𝐴 / 𝑅))
qsdisj.3	⊢ (𝜑 → 𝐶 ∈ (𝐴 / 𝑅))

Assertion

Ref	Expression
qsdisj	⊢ (𝜑 → (𝐵 = 𝐶 ∨ (𝐵 ∩ 𝐶) = ∅))

Proof of Theorem qsdisj

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		qsdisj.2	. 2 ⊢ (𝜑 → 𝐵 ∈ (𝐴 / 𝑅))
2		eqid 2758	. . 3 ⊢ (𝐴 / 𝑅) = (𝐴 / 𝑅)
3		eqeq1 2762	. . . 4 ⊢ ([𝑥]𝑅 = 𝐵 → ([𝑥]𝑅 = 𝐶 ↔ 𝐵 = 𝐶))
4		ineq1 4109	. . . . 5 ⊢ ([𝑥]𝑅 = 𝐵 → ([𝑥]𝑅 ∩ 𝐶) = (𝐵 ∩ 𝐶))
5	4	eqeq1d 2760	. . . 4 ⊢ ([𝑥]𝑅 = 𝐵 → (([𝑥]𝑅 ∩ 𝐶) = ∅ ↔ (𝐵 ∩ 𝐶) = ∅))
6	3, 5	orbi12d 916	. . 3 ⊢ ([𝑥]𝑅 = 𝐵 → (([𝑥]𝑅 = 𝐶 ∨ ([𝑥]𝑅 ∩ 𝐶) = ∅) ↔ (𝐵 = 𝐶 ∨ (𝐵 ∩ 𝐶) = ∅)))
7		qsdisj.3	. . . 4 ⊢ (𝜑 → 𝐶 ∈ (𝐴 / 𝑅))
8		eqeq2 2770	. . . . . 6 ⊢ ([𝑦]𝑅 = 𝐶 → ([𝑥]𝑅 = [𝑦]𝑅 ↔ [𝑥]𝑅 = 𝐶))
9		ineq2 4111	. . . . . . 7 ⊢ ([𝑦]𝑅 = 𝐶 → ([𝑥]𝑅 ∩ [𝑦]𝑅) = ([𝑥]𝑅 ∩ 𝐶))
10	9	eqeq1d 2760	. . . . . 6 ⊢ ([𝑦]𝑅 = 𝐶 → (([𝑥]𝑅 ∩ [𝑦]𝑅) = ∅ ↔ ([𝑥]𝑅 ∩ 𝐶) = ∅))
11	8, 10	orbi12d 916	. . . . 5 ⊢ ([𝑦]𝑅 = 𝐶 → (([𝑥]𝑅 = [𝑦]𝑅 ∨ ([𝑥]𝑅 ∩ [𝑦]𝑅) = ∅) ↔ ([𝑥]𝑅 = 𝐶 ∨ ([𝑥]𝑅 ∩ 𝐶) = ∅)))
12		qsdisj.1	. . . . . . 7 ⊢ (𝜑 → 𝑅 Er 𝑋)
13	12	ad2antrr 725	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ 𝐴) → 𝑅 Er 𝑋)
14		erdisj 8351	. . . . . 6 ⊢ (𝑅 Er 𝑋 → ([𝑥]𝑅 = [𝑦]𝑅 ∨ ([𝑥]𝑅 ∩ [𝑦]𝑅) = ∅))
15	13, 14	syl 17	. . . . 5 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ 𝐴) → ([𝑥]𝑅 = [𝑦]𝑅 ∨ ([𝑥]𝑅 ∩ [𝑦]𝑅) = ∅))
16	2, 11, 15	ectocld 8374	. . . 4 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝐶 ∈ (𝐴 / 𝑅)) → ([𝑥]𝑅 = 𝐶 ∨ ([𝑥]𝑅 ∩ 𝐶) = ∅))
17	7, 16	mpidan 688	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ([𝑥]𝑅 = 𝐶 ∨ ([𝑥]𝑅 ∩ 𝐶) = ∅))
18	2, 6, 17	ectocld 8374	. 2 ⊢ ((𝜑 ∧ 𝐵 ∈ (𝐴 / 𝑅)) → (𝐵 = 𝐶 ∨ (𝐵 ∩ 𝐶) = ∅))
19	1, 18	mpdan 686	1 ⊢ (𝜑 → (𝐵 = 𝐶 ∨ (𝐵 ∩ 𝐶) = ∅))

Syntax hints:   → wi 4   ∧ wa 399   ∨ wo 844   = wceq 1538   ∈ wcel 2111   ∩ cin 3857  ∅c0 4225   Er wer 8296  [cec 8297   / cqs 8298

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 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2729  ax-sep 5169  ax-nul 5176  ax-pr 5298

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-fal 1551  df-ex 1782  df-nf 1786  df-sb 2070  df-clab 2736  df-cleq 2750  df-clel 2830  df-nfc 2901  df-ne 2952  df-ral 3075  df-rex 3076  df-rab 3079  df-v 3411  df-sbc 3697  df-dif 3861  df-un 3863  df-in 3865  df-ss 3875  df-nul 4226  df-if 4421  df-sn 4523  df-pr 4525  df-op 4529  df-br 5033  df-opab 5095  df-xp 5530  df-rel 5531  df-cnv 5532  df-co 5533  df-dm 5534  df-rn 5535  df-res 5536  df-ima 5537  df-er 8299  df-ec 8301  df-qs 8305

This theorem is referenced by:  qsdisj2  8385  uniinqs  8387  cldsubg  22811  erprt  36471