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

Theorem qsdisjALTV 36029
 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 2798 . . 3 (𝐴 / 𝑅) = (𝐴 / 𝑅)
3 eqeq1 2802 . . . 4 ([𝑥]𝑅 = 𝐵 → ([𝑥]𝑅 = 𝐶𝐵 = 𝐶))
4 ineq1 4131 . . . . 5 ([𝑥]𝑅 = 𝐵 → ([𝑥]𝑅𝐶) = (𝐵𝐶))
54eqeq1d 2800 . . . 4 ([𝑥]𝑅 = 𝐵 → (([𝑥]𝑅𝐶) = ∅ ↔ (𝐵𝐶) = ∅))
63, 5orbi12d 916 . . 3 ([𝑥]𝑅 = 𝐵 → (([𝑥]𝑅 = 𝐶 ∨ ([𝑥]𝑅𝐶) = ∅) ↔ (𝐵 = 𝐶 ∨ (𝐵𝐶) = ∅)))
7 qsdisjALTV.3 . . . 4 (𝜑𝐶 ∈ (𝐴 / 𝑅))
8 eqeq2 2810 . . . . . 6 ([𝑦]𝑅 = 𝐶 → ([𝑥]𝑅 = [𝑦]𝑅 ↔ [𝑥]𝑅 = 𝐶))
9 ineq2 4133 . . . . . . 7 ([𝑦]𝑅 = 𝐶 → ([𝑥]𝑅 ∩ [𝑦]𝑅) = ([𝑥]𝑅𝐶))
109eqeq1d 2800 . . . . . 6 ([𝑦]𝑅 = 𝐶 → (([𝑥]𝑅 ∩ [𝑦]𝑅) = ∅ ↔ ([𝑥]𝑅𝐶) = ∅))
118, 10orbi12d 916 . . . . 5 ([𝑦]𝑅 = 𝐶 → (([𝑥]𝑅 = [𝑦]𝑅 ∨ ([𝑥]𝑅 ∩ [𝑦]𝑅) = ∅) ↔ ([𝑥]𝑅 = 𝐶 ∨ ([𝑥]𝑅𝐶) = ∅)))
12 qsdisjALTV.1 . . . . . . 7 (𝜑 → EqvRel 𝑅)
1312ad2antrr 725 . . . . . 6 (((𝜑𝑥𝐴) ∧ 𝑦𝐴) → EqvRel 𝑅)
14 eqvreldisj 36028 . . . . . 6 ( EqvRel 𝑅 → ([𝑥]𝑅 = [𝑦]𝑅 ∨ ([𝑥]𝑅 ∩ [𝑦]𝑅) = ∅))
1513, 14syl 17 . . . . 5 (((𝜑𝑥𝐴) ∧ 𝑦𝐴) → ([𝑥]𝑅 = [𝑦]𝑅 ∨ ([𝑥]𝑅 ∩ [𝑦]𝑅) = ∅))
162, 11, 15ectocld 8350 . . . 4 (((𝜑𝑥𝐴) ∧ 𝐶 ∈ (𝐴 / 𝑅)) → ([𝑥]𝑅 = 𝐶 ∨ ([𝑥]𝑅𝐶) = ∅))
177, 16mpidan 688 . . 3 ((𝜑𝑥𝐴) → ([𝑥]𝑅 = 𝐶 ∨ ([𝑥]𝑅𝐶) = ∅))
182, 6, 17ectocld 8350 . 2 ((𝜑𝐵 ∈ (𝐴 / 𝑅)) → (𝐵 = 𝐶 ∨ (𝐵𝐶) = ∅))
191, 18mpdan 686 1 (𝜑 → (𝐵 = 𝐶 ∨ (𝐵𝐶) = ∅))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 399   ∨ wo 844   = wceq 1538   ∈ wcel 2111   ∩ cin 3880  ∅c0 4243  [cec 8273   / cqs 8274   EqvRel weqvrel 35649 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 2770  ax-sep 5168  ax-nul 5175  ax-pr 5296 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-ral 3111  df-rex 3112  df-rab 3115  df-v 3443  df-sbc 3721  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-sn 4526  df-pr 4528  df-op 4532  df-br 5032  df-opab 5094  df-id 5426  df-xp 5526  df-rel 5527  df-cnv 5528  df-co 5529  df-dm 5530  df-rn 5531  df-res 5532  df-ima 5533  df-ec 8277  df-qs 8281  df-refrel 35931  df-symrel 35959  df-trrel 35989  df-eqvrel 35999 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator