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

Theorem disjdmqsss 38910
Description: Lemma for disjdmqseq 38913 via disjdmqs 38912. (Contributed by Peter Mazsa, 16-Sep-2021.)
Assertion
Ref Expression
disjdmqsss ( Disj 𝑅 → (dom 𝑅 / 𝑅) ⊆ (dom ≀ 𝑅 /𝑅))

Proof of Theorem disjdmqsss
Dummy variables 𝑢 𝑣 𝑥 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 disjrel 38838 . . . . . 6 ( Disj 𝑅 → Rel 𝑅)
2 releldmqs 38766 . . . . . . 7 (𝑣 ∈ V → (Rel 𝑅 → (𝑣 ∈ (dom 𝑅 / 𝑅) ↔ ∃𝑢 ∈ dom 𝑅𝑥 ∈ [ 𝑢]𝑅𝑣 = [𝑢]𝑅)))
32elv 3443 . . . . . 6 (Rel 𝑅 → (𝑣 ∈ (dom 𝑅 / 𝑅) ↔ ∃𝑢 ∈ dom 𝑅𝑥 ∈ [ 𝑢]𝑅𝑣 = [𝑢]𝑅))
41, 3syl 17 . . . . 5 ( Disj 𝑅 → (𝑣 ∈ (dom 𝑅 / 𝑅) ↔ ∃𝑢 ∈ dom 𝑅𝑥 ∈ [ 𝑢]𝑅𝑣 = [𝑢]𝑅))
5 disjlem19 38909 . . . . . . . 8 (𝑥 ∈ V → ( Disj 𝑅 → ((𝑢 ∈ dom 𝑅𝑥 ∈ [𝑢]𝑅) → [𝑢]𝑅 = [𝑥] ≀ 𝑅)))
65elv 3443 . . . . . . 7 ( Disj 𝑅 → ((𝑢 ∈ dom 𝑅𝑥 ∈ [𝑢]𝑅) → [𝑢]𝑅 = [𝑥] ≀ 𝑅))
76ralrimivv 3175 . . . . . 6 ( Disj 𝑅 → ∀𝑢 ∈ dom 𝑅𝑥 ∈ [ 𝑢]𝑅[𝑢]𝑅 = [𝑥] ≀ 𝑅)
8 2r19.29 3120 . . . . . . 7 ((∀𝑢 ∈ dom 𝑅𝑥 ∈ [ 𝑢]𝑅[𝑢]𝑅 = [𝑥] ≀ 𝑅 ∧ ∃𝑢 ∈ dom 𝑅𝑥 ∈ [ 𝑢]𝑅𝑣 = [𝑢]𝑅) → ∃𝑢 ∈ dom 𝑅𝑥 ∈ [ 𝑢]𝑅([𝑢]𝑅 = [𝑥] ≀ 𝑅𝑣 = [𝑢]𝑅))
98ex 412 . . . . . 6 (∀𝑢 ∈ dom 𝑅𝑥 ∈ [ 𝑢]𝑅[𝑢]𝑅 = [𝑥] ≀ 𝑅 → (∃𝑢 ∈ dom 𝑅𝑥 ∈ [ 𝑢]𝑅𝑣 = [𝑢]𝑅 → ∃𝑢 ∈ dom 𝑅𝑥 ∈ [ 𝑢]𝑅([𝑢]𝑅 = [𝑥] ≀ 𝑅𝑣 = [𝑢]𝑅)))
107, 9syl 17 . . . . 5 ( Disj 𝑅 → (∃𝑢 ∈ dom 𝑅𝑥 ∈ [ 𝑢]𝑅𝑣 = [𝑢]𝑅 → ∃𝑢 ∈ dom 𝑅𝑥 ∈ [ 𝑢]𝑅([𝑢]𝑅 = [𝑥] ≀ 𝑅𝑣 = [𝑢]𝑅)))
114, 10sylbid 240 . . . 4 ( Disj 𝑅 → (𝑣 ∈ (dom 𝑅 / 𝑅) → ∃𝑢 ∈ dom 𝑅𝑥 ∈ [ 𝑢]𝑅([𝑢]𝑅 = [𝑥] ≀ 𝑅𝑣 = [𝑢]𝑅)))
12 eqtr 2753 . . . . . . 7 ((𝑣 = [𝑢]𝑅 ∧ [𝑢]𝑅 = [𝑥] ≀ 𝑅) → 𝑣 = [𝑥] ≀ 𝑅)
1312ancoms 458 . . . . . 6 (([𝑢]𝑅 = [𝑥] ≀ 𝑅𝑣 = [𝑢]𝑅) → 𝑣 = [𝑥] ≀ 𝑅)
1413reximi 3072 . . . . 5 (∃𝑥 ∈ [ 𝑢]𝑅([𝑢]𝑅 = [𝑥] ≀ 𝑅𝑣 = [𝑢]𝑅) → ∃𝑥 ∈ [ 𝑢]𝑅𝑣 = [𝑥] ≀ 𝑅)
1514reximi 3072 . . . 4 (∃𝑢 ∈ dom 𝑅𝑥 ∈ [ 𝑢]𝑅([𝑢]𝑅 = [𝑥] ≀ 𝑅𝑣 = [𝑢]𝑅) → ∃𝑢 ∈ dom 𝑅𝑥 ∈ [ 𝑢]𝑅𝑣 = [𝑥] ≀ 𝑅)
1611, 15syl6 35 . . 3 ( Disj 𝑅 → (𝑣 ∈ (dom 𝑅 / 𝑅) → ∃𝑢 ∈ dom 𝑅𝑥 ∈ [ 𝑢]𝑅𝑣 = [𝑥] ≀ 𝑅))
17 releldmqscoss 38768 . . . . 5 (𝑣 ∈ V → (Rel 𝑅 → (𝑣 ∈ (dom ≀ 𝑅 /𝑅) ↔ ∃𝑢 ∈ dom 𝑅𝑥 ∈ [ 𝑢]𝑅𝑣 = [𝑥] ≀ 𝑅)))
1817elv 3443 . . . 4 (Rel 𝑅 → (𝑣 ∈ (dom ≀ 𝑅 /𝑅) ↔ ∃𝑢 ∈ dom 𝑅𝑥 ∈ [ 𝑢]𝑅𝑣 = [𝑥] ≀ 𝑅))
191, 18syl 17 . . 3 ( Disj 𝑅 → (𝑣 ∈ (dom ≀ 𝑅 /𝑅) ↔ ∃𝑢 ∈ dom 𝑅𝑥 ∈ [ 𝑢]𝑅𝑣 = [𝑥] ≀ 𝑅))
2016, 19sylibrd 259 . 2 ( Disj 𝑅 → (𝑣 ∈ (dom 𝑅 / 𝑅) → 𝑣 ∈ (dom ≀ 𝑅 /𝑅)))
2120ssrdv 3937 1 ( Disj 𝑅 → (dom 𝑅 / 𝑅) ⊆ (dom ≀ 𝑅 /𝑅))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1541  wcel 2113  wral 3049  wrex 3058  Vcvv 3438  wss 3899  dom cdm 5621  Rel wrel 5626  [cec 8629   / cqs 8630  ccoss 38232   Disj wdisjALTV 38266
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2705  ax-sep 5238  ax-nul 5248  ax-pr 5374
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2725  df-clel 2808  df-nfc 2883  df-ral 3050  df-rex 3059  df-rmo 3348  df-rab 3398  df-v 3440  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4285  df-if 4477  df-sn 4578  df-pr 4580  df-op 4584  df-br 5096  df-opab 5158  df-id 5516  df-xp 5627  df-rel 5628  df-cnv 5629  df-co 5630  df-dm 5631  df-rn 5632  df-res 5633  df-ima 5634  df-ec 8633  df-qs 8637  df-coss 38523  df-cnvrefrel 38629  df-disjALTV 38813
This theorem is referenced by:  disjdmqs  38912
  Copyright terms: Public domain W3C validator