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 39077
Description: Lemma for disjdmqseq 39080 via disjdmqs 39079. (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 39002 . . . . . 6 ( Disj 𝑅 → Rel 𝑅)
2 releldmqs 38915 . . . . . . 7 (𝑣 ∈ V → (Rel 𝑅 → (𝑣 ∈ (dom 𝑅 / 𝑅) ↔ ∃𝑢 ∈ dom 𝑅𝑥 ∈ [ 𝑢]𝑅𝑣 = [𝑢]𝑅)))
32elv 3446 . . . . . 6 (Rel 𝑅 → (𝑣 ∈ (dom 𝑅 / 𝑅) ↔ ∃𝑢 ∈ dom 𝑅𝑥 ∈ [ 𝑢]𝑅𝑣 = [𝑢]𝑅))
41, 3syl 17 . . . . 5 ( Disj 𝑅 → (𝑣 ∈ (dom 𝑅 / 𝑅) ↔ ∃𝑢 ∈ dom 𝑅𝑥 ∈ [ 𝑢]𝑅𝑣 = [𝑢]𝑅))
5 disjlem19 39076 . . . . . . . 8 (𝑥 ∈ V → ( Disj 𝑅 → ((𝑢 ∈ dom 𝑅𝑥 ∈ [𝑢]𝑅) → [𝑢]𝑅 = [𝑥] ≀ 𝑅)))
65elv 3446 . . . . . . 7 ( Disj 𝑅 → ((𝑢 ∈ dom 𝑅𝑥 ∈ [𝑢]𝑅) → [𝑢]𝑅 = [𝑥] ≀ 𝑅))
76ralrimivv 3178 . . . . . 6 ( Disj 𝑅 → ∀𝑢 ∈ dom 𝑅𝑥 ∈ [ 𝑢]𝑅[𝑢]𝑅 = [𝑥] ≀ 𝑅)
8 2r19.29 3123 . . . . . . 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 2757 . . . . . . 7 ((𝑣 = [𝑢]𝑅 ∧ [𝑢]𝑅 = [𝑥] ≀ 𝑅) → 𝑣 = [𝑥] ≀ 𝑅)
1312ancoms 458 . . . . . 6 (([𝑢]𝑅 = [𝑥] ≀ 𝑅𝑣 = [𝑢]𝑅) → 𝑣 = [𝑥] ≀ 𝑅)
1413reximi 3075 . . . . 5 (∃𝑥 ∈ [ 𝑢]𝑅([𝑢]𝑅 = [𝑥] ≀ 𝑅𝑣 = [𝑢]𝑅) → ∃𝑥 ∈ [ 𝑢]𝑅𝑣 = [𝑥] ≀ 𝑅)
1514reximi 3075 . . . 4 (∃𝑢 ∈ dom 𝑅𝑥 ∈ [ 𝑢]𝑅([𝑢]𝑅 = [𝑥] ≀ 𝑅𝑣 = [𝑢]𝑅) → ∃𝑢 ∈ dom 𝑅𝑥 ∈ [ 𝑢]𝑅𝑣 = [𝑥] ≀ 𝑅)
1611, 15syl6 35 . . 3 ( Disj 𝑅 → (𝑣 ∈ (dom 𝑅 / 𝑅) → ∃𝑢 ∈ dom 𝑅𝑥 ∈ [ 𝑢]𝑅𝑣 = [𝑥] ≀ 𝑅))
17 releldmqscoss 38917 . . . . 5 (𝑣 ∈ V → (Rel 𝑅 → (𝑣 ∈ (dom ≀ 𝑅 /𝑅) ↔ ∃𝑢 ∈ dom 𝑅𝑥 ∈ [ 𝑢]𝑅𝑣 = [𝑥] ≀ 𝑅)))
1817elv 3446 . . . 4 (Rel 𝑅 → (𝑣 ∈ (dom ≀ 𝑅 /𝑅) ↔ ∃𝑢 ∈ dom 𝑅𝑥 ∈ [ 𝑢]𝑅𝑣 = [𝑥] ≀ 𝑅))
191, 18syl 17 . . 3 ( Disj 𝑅 → (𝑣 ∈ (dom ≀ 𝑅 /𝑅) ↔ ∃𝑢 ∈ dom 𝑅𝑥 ∈ [ 𝑢]𝑅𝑣 = [𝑥] ≀ 𝑅))
2016, 19sylibrd 259 . 2 ( Disj 𝑅 → (𝑣 ∈ (dom 𝑅 / 𝑅) → 𝑣 ∈ (dom ≀ 𝑅 /𝑅)))
2120ssrdv 3940 1 ( Disj 𝑅 → (dom 𝑅 / 𝑅) ⊆ (dom ≀ 𝑅 /𝑅))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1542  wcel 2114  wral 3052  wrex 3061  Vcvv 3441  wss 3902  dom cdm 5625  Rel wrel 5630  [cec 8635   / cqs 8636  ccoss 38355   Disj wdisjALTV 38391
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5242  ax-nul 5252  ax-pr 5378
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ral 3053  df-rex 3062  df-rmo 3351  df-rab 3401  df-v 3443  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4287  df-if 4481  df-sn 4582  df-pr 4584  df-op 4588  df-br 5100  df-opab 5162  df-id 5520  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-ec 8639  df-qs 8643  df-coss 38673  df-cnvrefrel 38779  df-disjALTV 38962
This theorem is referenced by:  disjdmqs  39079
  Copyright terms: Public domain W3C validator