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

Theorem ecelqs 8767
Description: Membership of an equivalence class in a quotient set. (Contributed by Jeff Madsen, 10-Jun-2010.) (Revised by Mario Carneiro, 9-Jul-2014.) (Revised by Peter Mazsa, 22-Nov-2025.)
Assertion
Ref Expression
ecelqs (((𝑅𝐴) ∈ 𝑉𝐵𝐴) → [𝐵]𝑅 ∈ (𝐴 / 𝑅))

Proof of Theorem ecelqs
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 eqid 2760 . . . 4 [𝐵]𝑅 = [𝐵]𝑅
2 eceq1 8736 . . . . 5 (𝑥 = 𝐵 → [𝑥]𝑅 = [𝐵]𝑅)
32rspceeqv 3599 . . . 4 ((𝐵𝐴 ∧ [𝐵]𝑅 = [𝐵]𝑅) → ∃𝑥𝐴 [𝐵]𝑅 = [𝑥]𝑅)
41, 3mpan2 704 . . 3 (𝐵𝐴 → ∃𝑥𝐴 [𝐵]𝑅 = [𝑥]𝑅)
54adantl 487 . 2 (((𝑅𝐴) ∈ 𝑉𝐵𝐴) → ∃𝑥𝐴 [𝐵]𝑅 = [𝑥]𝑅)
6 elecex 8747 . . . 4 ((𝑅𝐴) ∈ 𝑉 → (𝐵𝐴 → [𝐵]𝑅 ∈ V))
76imp 412 . . 3 (((𝑅𝐴) ∈ 𝑉𝐵𝐴) → [𝐵]𝑅 ∈ V)
8 elqsg 8763 . . 3 ([𝐵]𝑅 ∈ V → ([𝐵]𝑅 ∈ (𝐴 / 𝑅) ↔ ∃𝑥𝐴 [𝐵]𝑅 = [𝑥]𝑅))
97, 8syl 18 . 2 (((𝑅𝐴) ∈ 𝑉𝐵𝐴) → ([𝐵]𝑅 ∈ (𝐴 / 𝑅) ↔ ∃𝑥𝐴 [𝐵]𝑅 = [𝑥]𝑅))
105, 9mpbird 260 1 (((𝑅𝐴) ∈ 𝑉𝐵𝐴) → [𝐵]𝑅 ∈ (𝐴 / 𝑅))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 401   = wceq 1570  wcel 2145  wrex 3086  Vcvv 3450  cres 5657  [cec 8694   / cqs 8695
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2732  ax-sep 5251  ax-pr 5398  ax-un 7736
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-xp 5661  df-rel 5662  df-cnv 5663  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-ec 8698  df-qs 8702
This theorem is used by:  ecelqsw  8768  ecelqsdmb  8786
  Copyright terms: Public domain W3C validator