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

Theorem uniqs 8767
Description: The union of a quotient set, like uniqsw 8768 but with a weaker antecedent: only the restriction of 𝑅 by 𝐴 needs to be a set, not 𝑅 itself, see e.g. cnvepima 38871. (Contributed by NM, 9-Dec-2008.) (Revised by Peter Mazsa, 20-Jun-2019.)
Assertion
Ref Expression
uniqs ((𝑅𝐴) ∈ 𝑉 (𝐴 / 𝑅) = (𝑅𝐴))

Proof of Theorem uniqs
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elecex 8741 . . . . 5 ((𝑅𝐴) ∈ 𝑉 → (𝑥𝐴 → [𝑥]𝑅 ∈ V))
21ralrimiv 3162 . . . 4 ((𝑅𝐴) ∈ 𝑉 → ∀𝑥𝐴 [𝑥]𝑅 ∈ V)
3 dfiun2g 4995 . . . 4 (∀𝑥𝐴 [𝑥]𝑅 ∈ V → 𝑥𝐴 [𝑥]𝑅 = {𝑦 ∣ ∃𝑥𝐴 𝑦 = [𝑥]𝑅})
42, 3syl 18 . . 3 ((𝑅𝐴) ∈ 𝑉 𝑥𝐴 [𝑥]𝑅 = {𝑦 ∣ ∃𝑥𝐴 𝑦 = [𝑥]𝑅})
54eqcomd 2775 . 2 ((𝑅𝐴) ∈ 𝑉 {𝑦 ∣ ∃𝑥𝐴 𝑦 = [𝑥]𝑅} = 𝑥𝐴 [𝑥]𝑅)
6 df-qs 8696 . . 3 (𝐴 / 𝑅) = {𝑦 ∣ ∃𝑥𝐴 𝑦 = [𝑥]𝑅}
76unieqi 4885 . 2 (𝐴 / 𝑅) = {𝑦 ∣ ∃𝑥𝐴 𝑦 = [𝑥]𝑅}
8 df-ec 8692 . . . . 5 [𝑥]𝑅 = (𝑅 “ {𝑥})
98a1i 11 . . . 4 (𝑥𝐴 → [𝑥]𝑅 = (𝑅 “ {𝑥}))
109iuneq2i 4979 . . 3 𝑥𝐴 [𝑥]𝑅 = 𝑥𝐴 (𝑅 “ {𝑥})
11 imaiun 7241 . . 3 (𝑅 𝑥𝐴 {𝑥}) = 𝑥𝐴 (𝑅 “ {𝑥})
12 iunid 5026 . . . 4 𝑥𝐴 {𝑥} = 𝐴
1312imaeq2i 6058 . . 3 (𝑅 𝑥𝐴 {𝑥}) = (𝑅𝐴)
1410, 11, 133eqtr2ri 2799 . 2 (𝑅𝐴) = 𝑥𝐴 [𝑥]𝑅
155, 7, 143eqtr4g 2829 1 ((𝑅𝐴) ∈ 𝑉 (𝐴 / 𝑅) = (𝑅𝐴))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1567  wcel 2149  {cab 2747  wral 3085  wrex 3095  Vcvv 3463  {csn 4591   cuni 4873   ciun 4957  cres 5661  cima 5662  [cec 8688   / cqs 8689
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-11 2198  ax-ext 2741  ax-sep 5258  ax-pr 5402  ax-un 7730
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-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 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4874  df-iun 4959  df-br 5111  df-opab 5175  df-xp 5665  df-rel 5666  df-cnv 5667  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-ec 8692  df-qs 8696
This theorem is referenced by:  uniqsw  8768  rnresequniqs  38868  cnvepima  38871
  Copyright terms: Public domain W3C validator