MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  qsdisj Structured version   Visualization version   GIF version

Theorem qsdisj 8791
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.
StepHypRef Expression
1 qsdisj.2 . 2 (𝜑𝐵 ∈ (𝐴 / 𝑅))
2 eqid 2769 . . 3 (𝐴 / 𝑅) = (𝐴 / 𝑅)
3 eqeq1 2773 . . . 4 ([𝑥]𝑅 = 𝐵 → ([𝑥]𝑅 = 𝐶𝐵 = 𝐶))
4 ineq1 4174 . . . . 5 ([𝑥]𝑅 = 𝐵 → ([𝑥]𝑅𝐶) = (𝐵𝐶))
54eqeq1d 2771 . . . 4 ([𝑥]𝑅 = 𝐵 → (([𝑥]𝑅𝐶) = ∅ ↔ (𝐵𝐶) = ∅))
63, 5orbi12d 931 . . 3 ([𝑥]𝑅 = 𝐵 → (([𝑥]𝑅 = 𝐶 ∨ ([𝑥]𝑅𝐶) = ∅) ↔ (𝐵 = 𝐶 ∨ (𝐵𝐶) = ∅)))
7 qsdisj.3 . . . 4 (𝜑𝐶 ∈ (𝐴 / 𝑅))
8 eqeq2 2781 . . . . . 6 ([𝑦]𝑅 = 𝐶 → ([𝑥]𝑅 = [𝑦]𝑅 ↔ [𝑥]𝑅 = 𝐶))
9 ineq2 4175 . . . . . . 7 ([𝑦]𝑅 = 𝐶 → ([𝑥]𝑅 ∩ [𝑦]𝑅) = ([𝑥]𝑅𝐶))
109eqeq1d 2771 . . . . . 6 ([𝑦]𝑅 = 𝐶 → (([𝑥]𝑅 ∩ [𝑦]𝑅) = ∅ ↔ ([𝑥]𝑅𝐶) = ∅))
118, 10orbi12d 931 . . . . 5 ([𝑦]𝑅 = 𝐶 → (([𝑥]𝑅 = [𝑦]𝑅 ∨ ([𝑥]𝑅 ∩ [𝑦]𝑅) = ∅) ↔ ([𝑥]𝑅 = 𝐶 ∨ ([𝑥]𝑅𝐶) = ∅)))
12 qsdisj.1 . . . . . . 7 (𝜑𝑅 Er 𝑋)
1312ad2antrr 738 . . . . . 6 (((𝜑𝑥𝐴) ∧ 𝑦𝐴) → 𝑅 Er 𝑋)
14 erdisj 8751 . . . . . 6 (𝑅 Er 𝑋 → ([𝑥]𝑅 = [𝑦]𝑅 ∨ ([𝑥]𝑅 ∩ [𝑦]𝑅) = ∅))
1513, 14syl 18 . . . . 5 (((𝜑𝑥𝐴) ∧ 𝑦𝐴) → ([𝑥]𝑅 = [𝑦]𝑅 ∨ ([𝑥]𝑅 ∩ [𝑦]𝑅) = ∅))
162, 11, 15ectocld 8779 . . . 4 (((𝜑𝑥𝐴) ∧ 𝐶 ∈ (𝐴 / 𝑅)) → ([𝑥]𝑅 = 𝐶 ∨ ([𝑥]𝑅𝐶) = ∅))
177, 16mpidan 701 . . 3 ((𝜑𝑥𝐴) → ([𝑥]𝑅 = 𝐶 ∨ ([𝑥]𝑅𝐶) = ∅))
182, 6, 17ectocld 8779 . 2 ((𝜑𝐵 ∈ (𝐴 / 𝑅)) → (𝐵 = 𝐶 ∨ (𝐵𝐶) = ∅))
191, 18mpdan 699 1 (𝜑 → (𝐵 = 𝐶 ∨ (𝐵𝐶) = ∅))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 400  wo 860   = wceq 1567  wcel 2149  cin 3912  c0 4294   Er wer 8690  [cec 8691   / cqs 8692
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-ext 2741  ax-sep 5261  ax-pr 5405
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-sb 2098  df-clab 2748  df-cleq 2761  df-clel 2844  df-ne 2965  df-ral 3086  df-rex 3096  df-rab 3424  df-v 3465  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-br 5114  df-opab 5178  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-res 5674  df-ima 5675  df-er 8693  df-ec 8695  df-qs 8699
This theorem is referenced by:  qsdisj2  8792  uniinqs  8794  cldsubg  24236  erprt  39536
  Copyright terms: Public domain W3C validator