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

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

Proof of Theorem ecex2
StepHypRef Expression
1 ecexg 8748 . 2 ((𝑅𝐴) ∈ 𝑉 → [𝐵](𝑅𝐴) ∈ V)
2 ecres2 38261 . . 3 (𝐵𝐴 → [𝐵](𝑅𝐴) = [𝐵]𝑅)
32eleq1d 2824 . 2 (𝐵𝐴 → ([𝐵](𝑅𝐴) ∈ V ↔ [𝐵]𝑅 ∈ V))
41, 3syl5ibcom 245 1 ((𝑅𝐴) ∈ 𝑉 → (𝐵𝐴 → [𝐵]𝑅 ∈ V))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wcel 2106  Vcvv 3478  cres 5691  [cec 8742
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-sep 5302  ax-nul 5312  ax-pr 5438  ax-un 7754
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-clab 2713  df-cleq 2727  df-clel 2814  df-ral 3060  df-rex 3069  df-rab 3434  df-v 3480  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-nul 4340  df-if 4532  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-br 5149  df-opab 5211  df-xp 5695  df-rel 5696  df-cnv 5697  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-ec 8746
This theorem is referenced by:  uniqsALTV  38311
  Copyright terms: Public domain W3C validator