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 39522
Description: Lemma for disjdmqseq 39525 via disjdmqs 39524. (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 39447 . . . . . 6 ( Disj 𝑅 → Rel 𝑅)
2 releldmqs 39360 . . . . . . 7 (𝑣 ∈ V → (Rel 𝑅 → (𝑣 ∈ (dom 𝑅 / 𝑅) ↔ ∃𝑢 ∈ dom 𝑅𝑥 ∈ [ 𝑢]𝑅𝑣 = [𝑢]𝑅)))
32elv 3458 . . . . . 6 (Rel 𝑅 → (𝑣 ∈ (dom 𝑅 / 𝑅) ↔ ∃𝑢 ∈ dom 𝑅𝑥 ∈ [ 𝑢]𝑅𝑣 = [𝑢]𝑅))
41, 3syl 18 . . . . 5 ( Disj 𝑅 → (𝑣 ∈ (dom 𝑅 / 𝑅) ↔ ∃𝑢 ∈ dom 𝑅𝑥 ∈ [ 𝑢]𝑅𝑣 = [𝑢]𝑅))
5 disjlem19 39521 . . . . . . . 8 (𝑥 ∈ V → ( Disj 𝑅 → ((𝑢 ∈ dom 𝑅𝑥 ∈ [𝑢]𝑅) → [𝑢]𝑅 = [𝑥] ≀ 𝑅)))
65elv 3458 . . . . . . 7 ( Disj 𝑅 → ((𝑢 ∈ dom 𝑅𝑥 ∈ [𝑢]𝑅) → [𝑢]𝑅 = [𝑥] ≀ 𝑅))
76ralrimivv 3204 . . . . . 6 ( Disj 𝑅 → ∀𝑢 ∈ dom 𝑅𝑥 ∈ [ 𝑢]𝑅[𝑢]𝑅 = [𝑥] ≀ 𝑅)
8 2r19.29 3149 . . . . . . 7 ((∀𝑢 ∈ dom 𝑅𝑥 ∈ [ 𝑢]𝑅[𝑢]𝑅 = [𝑥] ≀ 𝑅 ∧ ∃𝑢 ∈ dom 𝑅𝑥 ∈ [ 𝑢]𝑅𝑣 = [𝑢]𝑅) → ∃𝑢 ∈ dom 𝑅𝑥 ∈ [ 𝑢]𝑅([𝑢]𝑅 = [𝑥] ≀ 𝑅𝑣 = [𝑢]𝑅))
98ex 417 . . . . . 6 (∀𝑢 ∈ dom 𝑅𝑥 ∈ [ 𝑢]𝑅[𝑢]𝑅 = [𝑥] ≀ 𝑅 → (∃𝑢 ∈ dom 𝑅𝑥 ∈ [ 𝑢]𝑅𝑣 = [𝑢]𝑅 → ∃𝑢 ∈ dom 𝑅𝑥 ∈ [ 𝑢]𝑅([𝑢]𝑅 = [𝑥] ≀ 𝑅𝑣 = [𝑢]𝑅)))
107, 9syl 18 . . . . 5 ( Disj 𝑅 → (∃𝑢 ∈ dom 𝑅𝑥 ∈ [ 𝑢]𝑅𝑣 = [𝑢]𝑅 → ∃𝑢 ∈ dom 𝑅𝑥 ∈ [ 𝑢]𝑅([𝑢]𝑅 = [𝑥] ≀ 𝑅𝑣 = [𝑢]𝑅)))
114, 10sylbid 243 . . . 4 ( Disj 𝑅 → (𝑣 ∈ (dom 𝑅 / 𝑅) → ∃𝑢 ∈ dom 𝑅𝑥 ∈ [ 𝑢]𝑅([𝑢]𝑅 = [𝑥] ≀ 𝑅𝑣 = [𝑢]𝑅)))
12 eqtr 2781 . . . . . . 7 ((𝑣 = [𝑢]𝑅 ∧ [𝑢]𝑅 = [𝑥] ≀ 𝑅) → 𝑣 = [𝑥] ≀ 𝑅)
1312ancoms 463 . . . . . 6 (([𝑢]𝑅 = [𝑥] ≀ 𝑅𝑣 = [𝑢]𝑅) → 𝑣 = [𝑥] ≀ 𝑅)
1413reximi 3101 . . . . 5 (∃𝑥 ∈ [ 𝑢]𝑅([𝑢]𝑅 = [𝑥] ≀ 𝑅𝑣 = [𝑢]𝑅) → ∃𝑥 ∈ [ 𝑢]𝑅𝑣 = [𝑥] ≀ 𝑅)
1514reximi 3101 . . . 4 (∃𝑢 ∈ dom 𝑅𝑥 ∈ [ 𝑢]𝑅([𝑢]𝑅 = [𝑥] ≀ 𝑅𝑣 = [𝑢]𝑅) → ∃𝑢 ∈ dom 𝑅𝑥 ∈ [ 𝑢]𝑅𝑣 = [𝑥] ≀ 𝑅)
1611, 15syl6 36 . . 3 ( Disj 𝑅 → (𝑣 ∈ (dom 𝑅 / 𝑅) → ∃𝑢 ∈ dom 𝑅𝑥 ∈ [ 𝑢]𝑅𝑣 = [𝑥] ≀ 𝑅))
17 releldmqscoss 39362 . . . . 5 (𝑣 ∈ V → (Rel 𝑅 → (𝑣 ∈ (dom ≀ 𝑅 /𝑅) ↔ ∃𝑢 ∈ dom 𝑅𝑥 ∈ [ 𝑢]𝑅𝑣 = [𝑥] ≀ 𝑅)))
1817elv 3458 . . . 4 (Rel 𝑅 → (𝑣 ∈ (dom ≀ 𝑅 /𝑅) ↔ ∃𝑢 ∈ dom 𝑅𝑥 ∈ [ 𝑢]𝑅𝑣 = [𝑥] ≀ 𝑅))
191, 18syl 18 . . 3 ( Disj 𝑅 → (𝑣 ∈ (dom ≀ 𝑅 /𝑅) ↔ ∃𝑢 ∈ dom 𝑅𝑥 ∈ [ 𝑢]𝑅𝑣 = [𝑥] ≀ 𝑅))
2016, 19sylibrd 262 . 2 ( Disj 𝑅 → (𝑣 ∈ (dom 𝑅 / 𝑅) → 𝑣 ∈ (dom ≀ 𝑅 /𝑅)))
2120ssrdv 3942 1 ( Disj 𝑅 → (dom 𝑅 / 𝑅) ⊆ (dom ≀ 𝑅 /𝑅))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400   = wceq 1568  wcel 2141  wral 3077  wrex 3087  Vcvv 3453  wss 3904  dom cdm 5661  Rel wrel 5666  [cec 8691   / cqs 8692  ccoss 38800   Disj wdisjALTV 38836
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1823  ax-4 1837  ax-5 1938  ax-6 1995  ax-7 2036  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-sep 5256  ax-pr 5404
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1571  df-fal 1581  df-ex 1808  df-nf 1812  df-sb 2095  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ral 3078  df-rex 3088  df-rmo 3367  df-rab 3415  df-v 3455  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-sn 4589  df-pr 4591  df-op 4595  df-br 5109  df-opab 5173  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-ec 8695  df-qs 8699  df-coss 39118  df-cnvrefrel 39224  df-disjALTV 39407
This theorem is referenced by:  disjdmqs  39524
  Copyright terms: Public domain W3C validator