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 39500
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 8767 . . 3 (𝐵𝑉 → (𝐵 ∈ (dom ≀ (𝑅𝐴) / ≀ (𝑅𝐴)) ↔ ∃𝑥 ∈ dom ≀ (𝑅𝐴)𝐵 = [𝑥] ≀ (𝑅𝐴)))
2 df-rex 3089 . . . 4 (∃𝑥 ∈ dom ≀ (𝑅𝐴)𝐵 = [𝑥] ≀ (𝑅𝐴) ↔ ∃𝑥(𝑥 ∈ dom ≀ (𝑅𝐴) ∧ 𝐵 = [𝑥] ≀ (𝑅𝐴)))
3 eldm1cossres2 39307 . . . . . . 7 (𝑥 ∈ V → (𝑥 ∈ dom ≀ (𝑅𝐴) ↔ ∃𝑢𝐴 𝑥 ∈ [𝑢]𝑅))
43elv 3458 . . . . . 6 (𝑥 ∈ dom ≀ (𝑅𝐴) ↔ ∃𝑢𝐴 𝑥 ∈ [𝑢]𝑅)
54anbi1i 636 . . . . 5 ((𝑥 ∈ dom ≀ (𝑅𝐴) ∧ 𝐵 = [𝑥] ≀ (𝑅𝐴)) ↔ (∃𝑢𝐴 𝑥 ∈ [𝑢]𝑅𝐵 = [𝑥] ≀ (𝑅𝐴)))
65exbii 1881 . . . 4 (∃𝑥(𝑥 ∈ dom ≀ (𝑅𝐴) ∧ 𝐵 = [𝑥] ≀ (𝑅𝐴)) ↔ ∃𝑥(∃𝑢𝐴 𝑥 ∈ [𝑢]𝑅𝐵 = [𝑥] ≀ (𝑅𝐴)))
72, 6bitri 278 . . 3 (∃𝑥 ∈ dom ≀ (𝑅𝐴)𝐵 = [𝑥] ≀ (𝑅𝐴) ↔ ∃𝑥(∃𝑢𝐴 𝑥 ∈ [𝑢]𝑅𝐵 = [𝑥] ≀ (𝑅𝐴)))
81, 7bitrdi 290 . 2 (𝐵𝑉 → (𝐵 ∈ (dom ≀ (𝑅𝐴) / ≀ (𝑅𝐴)) ↔ ∃𝑥(∃𝑢𝐴 𝑥 ∈ [𝑢]𝑅𝐵 = [𝑥] ≀ (𝑅𝐴))))
9 df-rex 3089 . . . 4 (∃𝑥 ∈ [ 𝑢]𝑅𝐵 = [𝑥] ≀ (𝑅𝐴) ↔ ∃𝑥(𝑥 ∈ [𝑢]𝑅𝐵 = [𝑥] ≀ (𝑅𝐴)))
109rexbii 3111 . . 3 (∃𝑢𝐴𝑥 ∈ [ 𝑢]𝑅𝐵 = [𝑥] ≀ (𝑅𝐴) ↔ ∃𝑢𝐴𝑥(𝑥 ∈ [𝑢]𝑅𝐵 = [𝑥] ≀ (𝑅𝐴)))
11 rexcom4 3291 . . . 4 (∃𝑢𝐴𝑥(𝑥 ∈ [𝑢]𝑅𝐵 = [𝑥] ≀ (𝑅𝐴)) ↔ ∃𝑥𝑢𝐴 (𝑥 ∈ [𝑢]𝑅𝐵 = [𝑥] ≀ (𝑅𝐴)))
12 r19.41v 3194 . . . . 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 2145  wrex 3088  Vcvv 3453  dom cdm 5659  cres 5661  [cec 8698   / cqs 8699  ccoss 38939
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-11 2194  ax-ext 2734  ax-sep 5255  ax-pr 5402
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 2741  df-cleq 2754  df-clel 2837  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-br 5108  df-opab 5172  df-xp 5665  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-ec 8702  df-qs 8706  df-coss 39257
This theorem is used by:  releldmqscoss  39501
  Copyright terms: Public domain W3C validator