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

Theorem eldmqs1cossres 39434
Description: Elementhood in the domain quotient of the class of cosets by a restriction. (Contributed by Peter Mazsa, 4-May-2019.)
Assertion
Ref Expression
eldmqs1cossres (𝐵𝑉 → (𝐵 ∈ (dom ≀ (𝑅𝐴) / ≀ (𝑅𝐴)) ↔ ∃𝑢𝐴𝑥 ∈ [ 𝑢]𝑅𝐵 = [𝑥] ≀ (𝑅𝐴)))
Distinct variable groups:   𝑢,𝐴,𝑥   𝑢,𝐵,𝑥   𝑢,𝑅,𝑥
Allowed substitution hints:   𝑉(𝑥, 𝑢)

Proof of Theorem eldmqs1cossres
StepHypRef Expression
1 elqsg 8770 . . 3 (𝐵𝑉 → (𝐵 ∈ (dom ≀ (𝑅𝐴) / ≀ (𝑅𝐴)) ↔ ∃𝑥 ∈ dom ≀ (𝑅𝐴)𝐵 = [𝑥] ≀ (𝑅𝐴)))
2 df-rex 3093 . . . 4 (∃𝑥 ∈ dom ≀ (𝑅𝐴)𝐵 = [𝑥] ≀ (𝑅𝐴) ↔ ∃𝑥(𝑥 ∈ dom ≀ (𝑅𝐴) ∧ 𝐵 = [𝑥] ≀ (𝑅𝐴)))
3 eldm1cossres2 39241 . . . . . . 7 (𝑥 ∈ V → (𝑥 ∈ dom ≀ (𝑅𝐴) ↔ ∃𝑢𝐴 𝑥 ∈ [𝑢]𝑅))
43elv 3463 . . . . . 6 (𝑥 ∈ dom ≀ (𝑅𝐴) ↔ ∃𝑢𝐴 𝑥 ∈ [𝑢]𝑅)
54anbi1i 636 . . . . 5 ((𝑥 ∈ dom ≀ (𝑅𝐴) ∧ 𝐵 = [𝑥] ≀ (𝑅𝐴)) ↔ (∃𝑢𝐴 𝑥 ∈ [𝑢]𝑅𝐵 = [𝑥] ≀ (𝑅𝐴)))
65exbii 1881 . . . 4 (∃𝑥(𝑥 ∈ dom ≀ (𝑅𝐴) ∧ 𝐵 = [𝑥] ≀ (𝑅𝐴)) ↔ ∃𝑥(∃𝑢𝐴 𝑥 ∈ [𝑢]𝑅𝐵 = [𝑥] ≀ (𝑅𝐴)))
72, 6bitri 278 . . 3 (∃𝑥 ∈ dom ≀ (𝑅𝐴)𝐵 = [𝑥] ≀ (𝑅𝐴) ↔ ∃𝑥(∃𝑢𝐴 𝑥 ∈ [𝑢]𝑅𝐵 = [𝑥] ≀ (𝑅𝐴)))
81, 7bitrdi 290 . 2 (𝐵𝑉 → (𝐵 ∈ (dom ≀ (𝑅𝐴) / ≀ (𝑅𝐴)) ↔ ∃𝑥(∃𝑢𝐴 𝑥 ∈ [𝑢]𝑅𝐵 = [𝑥] ≀ (𝑅𝐴))))
9 df-rex 3093 . . . 4 (∃𝑥 ∈ [ 𝑢]𝑅𝐵 = [𝑥] ≀ (𝑅𝐴) ↔ ∃𝑥(𝑥 ∈ [𝑢]𝑅𝐵 = [𝑥] ≀ (𝑅𝐴)))
109rexbii 3115 . . 3 (∃𝑢𝐴𝑥 ∈ [ 𝑢]𝑅𝐵 = [𝑥] ≀ (𝑅𝐴) ↔ ∃𝑢𝐴𝑥(𝑥 ∈ [𝑢]𝑅𝐵 = [𝑥] ≀ (𝑅𝐴)))
11 rexcom4 3295 . . . 4 (∃𝑢𝐴𝑥(𝑥 ∈ [𝑢]𝑅𝐵 = [𝑥] ≀ (𝑅𝐴)) ↔ ∃𝑥𝑢𝐴 (𝑥 ∈ [𝑢]𝑅𝐵 = [𝑥] ≀ (𝑅𝐴)))
12 r19.41v 3198 . . . . 5 (∃𝑢𝐴 (𝑥 ∈ [𝑢]𝑅𝐵 = [𝑥] ≀ (𝑅𝐴)) ↔ (∃𝑢𝐴 𝑥 ∈ [𝑢]𝑅𝐵 = [𝑥] ≀ (𝑅𝐴)))
1312exbii 1881 . . . 4 (∃𝑥𝑢𝐴 (𝑥 ∈ [𝑢]𝑅𝐵 = [𝑥] ≀ (𝑅𝐴)) ↔ ∃𝑥(∃𝑢𝐴 𝑥 ∈ [𝑢]𝑅𝐵 = [𝑥] ≀ (𝑅𝐴)))
1411, 13bitri 278 . . 3 (∃𝑢𝐴𝑥(𝑥 ∈ [𝑢]𝑅𝐵 = [𝑥] ≀ (𝑅𝐴)) ↔ ∃𝑥(∃𝑢𝐴 𝑥 ∈ [𝑢]𝑅𝐵 = [𝑥] ≀ (𝑅𝐴)))
1510, 14bitri 278 . 2 (∃𝑢𝐴𝑥 ∈ [ 𝑢]𝑅𝐵 = [𝑥] ≀ (𝑅𝐴) ↔ ∃𝑥(∃𝑢𝐴 𝑥 ∈ [𝑢]𝑅𝐵 = [𝑥] ≀ (𝑅𝐴)))
168, 15bitr4di 292 1 (𝐵𝑉 → (𝐵 ∈ (dom ≀ (𝑅𝐴) / ≀ (𝑅𝐴)) ↔ ∃𝑢𝐴𝑥 ∈ [ 𝑢]𝑅𝐵 = [𝑥] ≀ (𝑅𝐴)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 401   = wceq 1570  wex 1812  wcel 2146  wrex 3092  Vcvv 3458  dom cdm 5666  cres 5668  [cec 8701   / cqs 8702  ccoss 38873
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 2148  ax-9 2156  ax-11 2195  ax-ext 2738  ax-sep 5262  ax-pr 5409
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 2745  df-cleq 2758  df-clel 2841  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-br 5115  df-opab 5179  df-xp 5672  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-ec 8705  df-qs 8709  df-coss 39191
This theorem is used by:  releldmqscoss  39435
  Copyright terms: Public domain W3C validator