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

Theorem elecex 8694
Description: Condition for a coset to be a set. (Contributed by Peter Mazsa, 4-May-2019.)
Assertion
Ref Expression
elecex ((𝑅𝐴) ∈ 𝑉 → (𝐵𝐴 → [𝐵]𝑅 ∈ V))

Proof of Theorem elecex
StepHypRef Expression
1 ecexg 8647 . 2 ((𝑅𝐴) ∈ 𝑉 → [𝐵](𝑅𝐴) ∈ V)
2 elecreseq 8693 . . 3 (𝐵𝐴 → [𝐵](𝑅𝐴) = [𝐵]𝑅)
32eleq1d 2821 . 2 (𝐵𝐴 → ([𝐵](𝑅𝐴) ∈ V ↔ [𝐵]𝑅 ∈ V))
41, 3syl5ibcom 245 1 ((𝑅𝐴) ∈ 𝑉 → (𝐵𝐴 → [𝐵]𝑅 ∈ V))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wcel 2114  Vcvv 3429  cres 5633  [cec 8641
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-ext 2708  ax-sep 5231  ax-pr 5375  ax-un 7689
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 2715  df-cleq 2728  df-clel 2811  df-ral 3052  df-rex 3062  df-rab 3390  df-v 3431  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-br 5086  df-opab 5148  df-xp 5637  df-rel 5638  df-cnv 5639  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-ec 8645
This theorem is referenced by:  ecelqs  8714  uniqs  8720  disjqmap2  39147
  Copyright terms: Public domain W3C validator