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

Theorem qsdisj 8852
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 2740 . . 3 (𝐴 / 𝑅) = (𝐴 / 𝑅)
3 eqeq1 2744 . . . 4 ([𝑥]𝑅 = 𝐵 → ([𝑥]𝑅 = 𝐶𝐵 = 𝐶))
4 ineq1 4234 . . . . 5 ([𝑥]𝑅 = 𝐵 → ([𝑥]𝑅𝐶) = (𝐵𝐶))
54eqeq1d 2742 . . . 4 ([𝑥]𝑅 = 𝐵 → (([𝑥]𝑅𝐶) = ∅ ↔ (𝐵𝐶) = ∅))
63, 5orbi12d 917 . . 3 ([𝑥]𝑅 = 𝐵 → (([𝑥]𝑅 = 𝐶 ∨ ([𝑥]𝑅𝐶) = ∅) ↔ (𝐵 = 𝐶 ∨ (𝐵𝐶) = ∅)))
7 qsdisj.3 . . . 4 (𝜑𝐶 ∈ (𝐴 / 𝑅))
8 eqeq2 2752 . . . . . 6 ([𝑦]𝑅 = 𝐶 → ([𝑥]𝑅 = [𝑦]𝑅 ↔ [𝑥]𝑅 = 𝐶))
9 ineq2 4235 . . . . . . 7 ([𝑦]𝑅 = 𝐶 → ([𝑥]𝑅 ∩ [𝑦]𝑅) = ([𝑥]𝑅𝐶))
109eqeq1d 2742 . . . . . 6 ([𝑦]𝑅 = 𝐶 → (([𝑥]𝑅 ∩ [𝑦]𝑅) = ∅ ↔ ([𝑥]𝑅𝐶) = ∅))
118, 10orbi12d 917 . . . . 5 ([𝑦]𝑅 = 𝐶 → (([𝑥]𝑅 = [𝑦]𝑅 ∨ ([𝑥]𝑅 ∩ [𝑦]𝑅) = ∅) ↔ ([𝑥]𝑅 = 𝐶 ∨ ([𝑥]𝑅𝐶) = ∅)))
12 qsdisj.1 . . . . . . 7 (𝜑𝑅 Er 𝑋)
1312ad2antrr 725 . . . . . 6 (((𝜑𝑥𝐴) ∧ 𝑦𝐴) → 𝑅 Er 𝑋)
14 erdisj 8817 . . . . . 6 (𝑅 Er 𝑋 → ([𝑥]𝑅 = [𝑦]𝑅 ∨ ([𝑥]𝑅 ∩ [𝑦]𝑅) = ∅))
1513, 14syl 17 . . . . 5 (((𝜑𝑥𝐴) ∧ 𝑦𝐴) → ([𝑥]𝑅 = [𝑦]𝑅 ∨ ([𝑥]𝑅 ∩ [𝑦]𝑅) = ∅))
162, 11, 15ectocld 8842 . . . 4 (((𝜑𝑥𝐴) ∧ 𝐶 ∈ (𝐴 / 𝑅)) → ([𝑥]𝑅 = 𝐶 ∨ ([𝑥]𝑅𝐶) = ∅))
177, 16mpidan 688 . . 3 ((𝜑𝑥𝐴) → ([𝑥]𝑅 = 𝐶 ∨ ([𝑥]𝑅𝐶) = ∅))
182, 6, 17ectocld 8842 . 2 ((𝜑𝐵 ∈ (𝐴 / 𝑅)) → (𝐵 = 𝐶 ∨ (𝐵𝐶) = ∅))
191, 18mpdan 686 1 (𝜑 → (𝐵 = 𝐶 ∨ (𝐵𝐶) = ∅))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  wo 846   = wceq 1537  wcel 2108  cin 3975  c0 4352   Er wer 8760  [cec 8761   / cqs 8762
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pr 5447
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-clab 2718  df-cleq 2732  df-clel 2819  df-ne 2947  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-sn 4649  df-pr 4651  df-op 4655  df-br 5167  df-opab 5229  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-er 8763  df-ec 8765  df-qs 8769
This theorem is referenced by:  qsdisj2  8853  uniinqs  8855  cldsubg  24140  erprt  38829
  Copyright terms: Public domain W3C validator