Theorem disjdmqscossss 39244

Description: Lemma for disjdmqseq 39246 via disjdmqs 39245. (Contributed by Peter Mazsa, 16-Sep-2021.)

Assertion

Ref	Expression
disjdmqscossss	⊢ ( Disj 𝑅 → (dom ≀ 𝑅 / ≀ 𝑅) ⊆ (dom 𝑅 / 𝑅))

Proof of Theorem disjdmqscossss

Dummy variables 𝑢 𝑣 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		disjrel 39168	. . . . . . . 8 ⊢ ( Disj 𝑅 → Rel 𝑅)
2		releldmqscoss 39083	. . . . . . . . 9 ⊢ (𝑣 ∈ V → (Rel 𝑅 → (𝑣 ∈ (dom ≀ 𝑅 / ≀ 𝑅) ↔ ∃𝑢 ∈ dom 𝑅∃𝑥 ∈ [ 𝑢]𝑅𝑣 = [𝑥] ≀ 𝑅)))
3	2	elv 3435	. . . . . . . 8 ⊢ (Rel 𝑅 → (𝑣 ∈ (dom ≀ 𝑅 / ≀ 𝑅) ↔ ∃𝑢 ∈ dom 𝑅∃𝑥 ∈ [ 𝑢]𝑅𝑣 = [𝑥] ≀ 𝑅))
4	1, 3	syl 17	. . . . . . 7 ⊢ ( Disj 𝑅 → (𝑣 ∈ (dom ≀ 𝑅 / ≀ 𝑅) ↔ ∃𝑢 ∈ dom 𝑅∃𝑥 ∈ [ 𝑢]𝑅𝑣 = [𝑥] ≀ 𝑅))
5		disjlem19 39242	. . . . . . . . . 10 ⊢ (𝑥 ∈ V → ( Disj 𝑅 → ((𝑢 ∈ dom 𝑅 ∧ 𝑥 ∈ [𝑢]𝑅) → [𝑢]𝑅 = [𝑥] ≀ 𝑅)))
6	5	elv 3435	. . . . . . . . 9 ⊢ ( Disj 𝑅 → ((𝑢 ∈ dom 𝑅 ∧ 𝑥 ∈ [𝑢]𝑅) → [𝑢]𝑅 = [𝑥] ≀ 𝑅))
7	6	ralrimivv 3179	. . . . . . . 8 ⊢ ( Disj 𝑅 → ∀𝑢 ∈ dom 𝑅∀𝑥 ∈ [ 𝑢]𝑅[𝑢]𝑅 = [𝑥] ≀ 𝑅)
8		2r19.29 3124	. . . . . . . . 9 ⊢ ((∀𝑢 ∈ dom 𝑅∀𝑥 ∈ [ 𝑢]𝑅[𝑢]𝑅 = [𝑥] ≀ 𝑅 ∧ ∃𝑢 ∈ dom 𝑅∃𝑥 ∈ [ 𝑢]𝑅𝑣 = [𝑥] ≀ 𝑅) → ∃𝑢 ∈ dom 𝑅∃𝑥 ∈ [ 𝑢]𝑅([𝑢]𝑅 = [𝑥] ≀ 𝑅 ∧ 𝑣 = [𝑥] ≀ 𝑅))
9	8	ex 412	. . . . . . . 8 ⊢ (∀𝑢 ∈ dom 𝑅∀𝑥 ∈ [ 𝑢]𝑅[𝑢]𝑅 = [𝑥] ≀ 𝑅 → (∃𝑢 ∈ dom 𝑅∃𝑥 ∈ [ 𝑢]𝑅𝑣 = [𝑥] ≀ 𝑅 → ∃𝑢 ∈ dom 𝑅∃𝑥 ∈ [ 𝑢]𝑅([𝑢]𝑅 = [𝑥] ≀ 𝑅 ∧ 𝑣 = [𝑥] ≀ 𝑅)))
10	7, 9	syl 17	. . . . . . 7 ⊢ ( Disj 𝑅 → (∃𝑢 ∈ dom 𝑅∃𝑥 ∈ [ 𝑢]𝑅𝑣 = [𝑥] ≀ 𝑅 → ∃𝑢 ∈ dom 𝑅∃𝑥 ∈ [ 𝑢]𝑅([𝑢]𝑅 = [𝑥] ≀ 𝑅 ∧ 𝑣 = [𝑥] ≀ 𝑅)))
11	4, 10	sylbid 240	. . . . . 6 ⊢ ( Disj 𝑅 → (𝑣 ∈ (dom ≀ 𝑅 / ≀ 𝑅) → ∃𝑢 ∈ dom 𝑅∃𝑥 ∈ [ 𝑢]𝑅([𝑢]𝑅 = [𝑥] ≀ 𝑅 ∧ 𝑣 = [𝑥] ≀ 𝑅)))
12		eqtr3 2759	. . . . . . . 8 ⊢ (([𝑢]𝑅 = [𝑥] ≀ 𝑅 ∧ 𝑣 = [𝑥] ≀ 𝑅) → [𝑢]𝑅 = 𝑣)
13	12	reximi 3076	. . . . . . 7 ⊢ (∃𝑥 ∈ [ 𝑢]𝑅([𝑢]𝑅 = [𝑥] ≀ 𝑅 ∧ 𝑣 = [𝑥] ≀ 𝑅) → ∃𝑥 ∈ [ 𝑢]𝑅[𝑢]𝑅 = 𝑣)
14	13	reximi 3076	. . . . . 6 ⊢ (∃𝑢 ∈ dom 𝑅∃𝑥 ∈ [ 𝑢]𝑅([𝑢]𝑅 = [𝑥] ≀ 𝑅 ∧ 𝑣 = [𝑥] ≀ 𝑅) → ∃𝑢 ∈ dom 𝑅∃𝑥 ∈ [ 𝑢]𝑅[𝑢]𝑅 = 𝑣)
15	11, 14	syl6 35	. . . . 5 ⊢ ( Disj 𝑅 → (𝑣 ∈ (dom ≀ 𝑅 / ≀ 𝑅) → ∃𝑢 ∈ dom 𝑅∃𝑥 ∈ [ 𝑢]𝑅[𝑢]𝑅 = 𝑣))
16		df-rex 3063	. . . . . . . 8 ⊢ (∃𝑥 ∈ [ 𝑢]𝑅[𝑢]𝑅 = 𝑣 ↔ ∃𝑥(𝑥 ∈ [𝑢]𝑅 ∧ [𝑢]𝑅 = 𝑣))
17		19.41v 1951	. . . . . . . 8 ⊢ (∃𝑥(𝑥 ∈ [𝑢]𝑅 ∧ [𝑢]𝑅 = 𝑣) ↔ (∃𝑥 𝑥 ∈ [𝑢]𝑅 ∧ [𝑢]𝑅 = 𝑣))
18	16, 17	bitri 275	. . . . . . 7 ⊢ (∃𝑥 ∈ [ 𝑢]𝑅[𝑢]𝑅 = 𝑣 ↔ (∃𝑥 𝑥 ∈ [𝑢]𝑅 ∧ [𝑢]𝑅 = 𝑣))
19	18	simprbi 497	. . . . . 6 ⊢ (∃𝑥 ∈ [ 𝑢]𝑅[𝑢]𝑅 = 𝑣 → [𝑢]𝑅 = 𝑣)
20	19	reximi 3076	. . . . 5 ⊢ (∃𝑢 ∈ dom 𝑅∃𝑥 ∈ [ 𝑢]𝑅[𝑢]𝑅 = 𝑣 → ∃𝑢 ∈ dom 𝑅[𝑢]𝑅 = 𝑣)
21	15, 20	syl6 35	. . . 4 ⊢ ( Disj 𝑅 → (𝑣 ∈ (dom ≀ 𝑅 / ≀ 𝑅) → ∃𝑢 ∈ dom 𝑅[𝑢]𝑅 = 𝑣))
22		eqcom 2744	. . . . 5 ⊢ ([𝑢]𝑅 = 𝑣 ↔ 𝑣 = [𝑢]𝑅)
23	22	rexbii 3085	. . . 4 ⊢ (∃𝑢 ∈ dom 𝑅[𝑢]𝑅 = 𝑣 ↔ ∃𝑢 ∈ dom 𝑅 𝑣 = [𝑢]𝑅)
24	21, 23	imbitrdi 251	. . 3 ⊢ ( Disj 𝑅 → (𝑣 ∈ (dom ≀ 𝑅 / ≀ 𝑅) → ∃𝑢 ∈ dom 𝑅 𝑣 = [𝑢]𝑅))
25	24	ss2abdv 4006	. 2 ⊢ ( Disj 𝑅 → {𝑣 ∣ 𝑣 ∈ (dom ≀ 𝑅 / ≀ 𝑅)} ⊆ {𝑣 ∣ ∃𝑢 ∈ dom 𝑅 𝑣 = [𝑢]𝑅})
26		abid1 2873	. 2 ⊢ (dom ≀ 𝑅 / ≀ 𝑅) = {𝑣 ∣ 𝑣 ∈ (dom ≀ 𝑅 / ≀ 𝑅)}
27		df-qs 8643	. 2 ⊢ (dom 𝑅 / 𝑅) = {𝑣 ∣ ∃𝑢 ∈ dom 𝑅 𝑣 = [𝑢]𝑅}
28	25, 26, 27	3sstr4g 3976	1 ⊢ ( Disj 𝑅 → (dom ≀ 𝑅 / ≀ 𝑅) ⊆ (dom 𝑅 / 𝑅))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1542  ∃wex 1781   ∈ wcel 2114  {cab 2715  ∀wral 3052  ∃wrex 3062  Vcvv 3430   ⊆ wss 3890  dom cdm 5625  Rel wrel 5630  [cec 8635   / cqs 8636   ≀ ccoss 38521   Disj wdisjALTV 38557

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 5232  ax-pr 5371

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 3063  df-rmo 3343  df-rab 3391  df-v 3432  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-sn 4569  df-pr 4571  df-op 4575  df-br 5087  df-opab 5149  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 38839  df-cnvrefrel 38945  df-disjALTV 39128

This theorem is referenced by:  disjdmqs  39245