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

Theorem uniqs 8713
Description: The union of a quotient set, like uniqsw 8714 but with a weaker antecedent: only the restriction of 𝑅 by 𝐴 needs to be a set, not 𝑅 itself, see e.g. cnvepima 38672. (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 8687 . . . . 5 ((𝑅𝐴) ∈ 𝑉 → (𝑥𝐴 → [𝑥]𝑅 ∈ V))
21ralrimiv 3129 . . . 4 ((𝑅𝐴) ∈ 𝑉 → ∀𝑥𝐴 [𝑥]𝑅 ∈ V)
3 dfiun2g 4973 . . . 4 (∀𝑥𝐴 [𝑥]𝑅 ∈ V → 𝑥𝐴 [𝑥]𝑅 = {𝑦 ∣ ∃𝑥𝐴 𝑦 = [𝑥]𝑅})
42, 3syl 17 . . 3 ((𝑅𝐴) ∈ 𝑉 𝑥𝐴 [𝑥]𝑅 = {𝑦 ∣ ∃𝑥𝐴 𝑦 = [𝑥]𝑅})
54eqcomd 2743 . 2 ((𝑅𝐴) ∈ 𝑉 {𝑦 ∣ ∃𝑥𝐴 𝑦 = [𝑥]𝑅} = 𝑥𝐴 [𝑥]𝑅)
6 df-qs 8642 . . 3 (𝐴 / 𝑅) = {𝑦 ∣ ∃𝑥𝐴 𝑦 = [𝑥]𝑅}
76unieqi 4863 . 2 (𝐴 / 𝑅) = {𝑦 ∣ ∃𝑥𝐴 𝑦 = [𝑥]𝑅}
8 df-ec 8638 . . . . 5 [𝑥]𝑅 = (𝑅 “ {𝑥})
98a1i 11 . . . 4 (𝑥𝐴 → [𝑥]𝑅 = (𝑅 “ {𝑥}))
109iuneq2i 4956 . . 3 𝑥𝐴 [𝑥]𝑅 = 𝑥𝐴 (𝑅 “ {𝑥})
11 imaiun 7193 . . 3 (𝑅 𝑥𝐴 {𝑥}) = 𝑥𝐴 (𝑅 “ {𝑥})
12 iunid 5004 . . . 4 𝑥𝐴 {𝑥} = 𝐴
1312imaeq2i 6017 . . 3 (𝑅 𝑥𝐴 {𝑥}) = (𝑅𝐴)
1410, 11, 133eqtr2ri 2767 . 2 (𝑅𝐴) = 𝑥𝐴 [𝑥]𝑅
155, 7, 143eqtr4g 2797 1 ((𝑅𝐴) ∈ 𝑉 (𝐴 / 𝑅) = (𝑅𝐴))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1542  wcel 2114  {cab 2715  wral 3052  wrex 3062  Vcvv 3430  {csn 4568   cuni 4851   ciun 4934  cres 5626  cima 5627  [cec 8634   / cqs 8635
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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-11 2163  ax-ext 2709  ax-sep 5231  ax-pr 5370  ax-un 7682
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-ral 3053  df-rex 3063  df-rab 3391  df-v 3432  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-iun 4936  df-br 5087  df-opab 5149  df-xp 5630  df-rel 5631  df-cnv 5632  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-ec 8638  df-qs 8642
This theorem is referenced by:  uniqsw  8714  rnresequniqs  38669  cnvepima  38672
  Copyright terms: Public domain W3C validator