Users' Mathboxes Mathbox for Peter Mazsa < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  qsdisjALTV Structured version   Visualization version   GIF version

Theorem qsdisjALTV 36728
Description: Elements of a quotient set do not overlap. (Contributed by Rodolfo Medina, 12-Oct-2010.) (Revised by Mario Carneiro, 11-Jul-2014.) (Revised by Peter Mazsa, 3-Jun-2019.)
Hypotheses
Ref Expression
qsdisjALTV.1 (𝜑 → EqvRel 𝑅)
qsdisjALTV.2 (𝜑𝐵 ∈ (𝐴 / 𝑅))
qsdisjALTV.3 (𝜑𝐶 ∈ (𝐴 / 𝑅))
Assertion
Ref Expression
qsdisjALTV (𝜑 → (𝐵 = 𝐶 ∨ (𝐵𝐶) = ∅))

Proof of Theorem qsdisjALTV
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 qsdisjALTV.2 . 2 (𝜑𝐵 ∈ (𝐴 / 𝑅))
2 eqid 2738 . . 3 (𝐴 / 𝑅) = (𝐴 / 𝑅)
3 eqeq1 2742 . . . 4 ([𝑥]𝑅 = 𝐵 → ([𝑥]𝑅 = 𝐶𝐵 = 𝐶))
4 ineq1 4139 . . . . 5 ([𝑥]𝑅 = 𝐵 → ([𝑥]𝑅𝐶) = (𝐵𝐶))
54eqeq1d 2740 . . . 4 ([𝑥]𝑅 = 𝐵 → (([𝑥]𝑅𝐶) = ∅ ↔ (𝐵𝐶) = ∅))
63, 5orbi12d 916 . . 3 ([𝑥]𝑅 = 𝐵 → (([𝑥]𝑅 = 𝐶 ∨ ([𝑥]𝑅𝐶) = ∅) ↔ (𝐵 = 𝐶 ∨ (𝐵𝐶) = ∅)))
7 qsdisjALTV.3 . . . 4 (𝜑𝐶 ∈ (𝐴 / 𝑅))
8 eqeq2 2750 . . . . . 6 ([𝑦]𝑅 = 𝐶 → ([𝑥]𝑅 = [𝑦]𝑅 ↔ [𝑥]𝑅 = 𝐶))
9 ineq2 4140 . . . . . . 7 ([𝑦]𝑅 = 𝐶 → ([𝑥]𝑅 ∩ [𝑦]𝑅) = ([𝑥]𝑅𝐶))
109eqeq1d 2740 . . . . . 6 ([𝑦]𝑅 = 𝐶 → (([𝑥]𝑅 ∩ [𝑦]𝑅) = ∅ ↔ ([𝑥]𝑅𝐶) = ∅))
118, 10orbi12d 916 . . . . 5 ([𝑦]𝑅 = 𝐶 → (([𝑥]𝑅 = [𝑦]𝑅 ∨ ([𝑥]𝑅 ∩ [𝑦]𝑅) = ∅) ↔ ([𝑥]𝑅 = 𝐶 ∨ ([𝑥]𝑅𝐶) = ∅)))
12 qsdisjALTV.1 . . . . . . 7 (𝜑 → EqvRel 𝑅)
1312ad2antrr 723 . . . . . 6 (((𝜑𝑥𝐴) ∧ 𝑦𝐴) → EqvRel 𝑅)
14 eqvreldisj 36727 . . . . . 6 ( EqvRel 𝑅 → ([𝑥]𝑅 = [𝑦]𝑅 ∨ ([𝑥]𝑅 ∩ [𝑦]𝑅) = ∅))
1513, 14syl 17 . . . . 5 (((𝜑𝑥𝐴) ∧ 𝑦𝐴) → ([𝑥]𝑅 = [𝑦]𝑅 ∨ ([𝑥]𝑅 ∩ [𝑦]𝑅) = ∅))
162, 11, 15ectocld 8573 . . . 4 (((𝜑𝑥𝐴) ∧ 𝐶 ∈ (𝐴 / 𝑅)) → ([𝑥]𝑅 = 𝐶 ∨ ([𝑥]𝑅𝐶) = ∅))
177, 16mpidan 686 . . 3 ((𝜑𝑥𝐴) → ([𝑥]𝑅 = 𝐶 ∨ ([𝑥]𝑅𝐶) = ∅))
182, 6, 17ectocld 8573 . 2 ((𝜑𝐵 ∈ (𝐴 / 𝑅)) → (𝐵 = 𝐶 ∨ (𝐵𝐶) = ∅))
191, 18mpdan 684 1 (𝜑 → (𝐵 = 𝐶 ∨ (𝐵𝐶) = ∅))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396  wo 844   = wceq 1539  wcel 2106  cin 3886  c0 4256  [cec 8496   / cqs 8497   EqvRel weqvrel 36350
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pr 5352
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-clab 2716  df-cleq 2730  df-clel 2816  df-ne 2944  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-sn 4562  df-pr 4564  df-op 4568  df-br 5075  df-opab 5137  df-id 5489  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-ec 8500  df-qs 8504  df-refrel 36630  df-symrel 36658  df-trrel 36688  df-eqvrel 36698
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator