Theorem disjecxrn 38610

Description: Two ways of saying that (𝑅 ⋉ 𝑆)-cosets are disjoint. (Contributed by Peter Mazsa, 19-Jun-2020.) (Revised by Peter Mazsa, 21-Aug-2023.)

Assertion

Ref	Expression
disjecxrn	⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (([𝐴](𝑅 ⋉ 𝑆) ∩ [𝐵](𝑅 ⋉ 𝑆)) = ∅ ↔ (([𝐴]𝑅 ∩ [𝐵]𝑅) = ∅ ∨ ([𝐴]𝑆 ∩ [𝐵]𝑆) = ∅)))

Proof of Theorem disjecxrn

Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ecxrn 38604	. . . . . . . . . 10 ⊢ (𝐴 ∈ 𝑉 → [𝐴](𝑅 ⋉ 𝑆) = {⟨𝑦, 𝑧⟩ ∣ (𝐴𝑅𝑦 ∧ 𝐴𝑆𝑧)})
2		ecxrn 38604	. . . . . . . . . 10 ⊢ (𝐵 ∈ 𝑊 → [𝐵](𝑅 ⋉ 𝑆) = {⟨𝑦, 𝑧⟩ ∣ (𝐵𝑅𝑦 ∧ 𝐵𝑆𝑧)})
3	1, 2	ineqan12d 4174	. . . . . . . . 9 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ([𝐴](𝑅 ⋉ 𝑆) ∩ [𝐵](𝑅 ⋉ 𝑆)) = ({⟨𝑦, 𝑧⟩ ∣ (𝐴𝑅𝑦 ∧ 𝐴𝑆𝑧)} ∩ {⟨𝑦, 𝑧⟩ ∣ (𝐵𝑅𝑦 ∧ 𝐵𝑆𝑧)}))
4		inopab 5778	. . . . . . . . 9 ⊢ ({⟨𝑦, 𝑧⟩ ∣ (𝐴𝑅𝑦 ∧ 𝐴𝑆𝑧)} ∩ {⟨𝑦, 𝑧⟩ ∣ (𝐵𝑅𝑦 ∧ 𝐵𝑆𝑧)}) = {⟨𝑦, 𝑧⟩ ∣ ((𝐴𝑅𝑦 ∧ 𝐴𝑆𝑧) ∧ (𝐵𝑅𝑦 ∧ 𝐵𝑆𝑧))}
5	3, 4	eqtrdi 2787	. . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ([𝐴](𝑅 ⋉ 𝑆) ∩ [𝐵](𝑅 ⋉ 𝑆)) = {⟨𝑦, 𝑧⟩ ∣ ((𝐴𝑅𝑦 ∧ 𝐴𝑆𝑧) ∧ (𝐵𝑅𝑦 ∧ 𝐵𝑆𝑧))})
6		an4 656	. . . . . . . . 9 ⊢ (((𝐴𝑅𝑦 ∧ 𝐴𝑆𝑧) ∧ (𝐵𝑅𝑦 ∧ 𝐵𝑆𝑧)) ↔ ((𝐴𝑅𝑦 ∧ 𝐵𝑅𝑦) ∧ (𝐴𝑆𝑧 ∧ 𝐵𝑆𝑧)))
7	6	opabbii 5165	. . . . . . . 8 ⊢ {⟨𝑦, 𝑧⟩ ∣ ((𝐴𝑅𝑦 ∧ 𝐴𝑆𝑧) ∧ (𝐵𝑅𝑦 ∧ 𝐵𝑆𝑧))} = {⟨𝑦, 𝑧⟩ ∣ ((𝐴𝑅𝑦 ∧ 𝐵𝑅𝑦) ∧ (𝐴𝑆𝑧 ∧ 𝐵𝑆𝑧))}
8	5, 7	eqtrdi 2787	. . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ([𝐴](𝑅 ⋉ 𝑆) ∩ [𝐵](𝑅 ⋉ 𝑆)) = {⟨𝑦, 𝑧⟩ ∣ ((𝐴𝑅𝑦 ∧ 𝐵𝑅𝑦) ∧ (𝐴𝑆𝑧 ∧ 𝐵𝑆𝑧))})
9	8	neeq1d 2991	. . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (([𝐴](𝑅 ⋉ 𝑆) ∩ [𝐵](𝑅 ⋉ 𝑆)) ≠ ∅ ↔ {⟨𝑦, 𝑧⟩ ∣ ((𝐴𝑅𝑦 ∧ 𝐵𝑅𝑦) ∧ (𝐴𝑆𝑧 ∧ 𝐵𝑆𝑧))} ≠ ∅))
10		opabn0 5501	. . . . . 6 ⊢ ({⟨𝑦, 𝑧⟩ ∣ ((𝐴𝑅𝑦 ∧ 𝐵𝑅𝑦) ∧ (𝐴𝑆𝑧 ∧ 𝐵𝑆𝑧))} ≠ ∅ ↔ ∃𝑦∃𝑧((𝐴𝑅𝑦 ∧ 𝐵𝑅𝑦) ∧ (𝐴𝑆𝑧 ∧ 𝐵𝑆𝑧)))
11	9, 10	bitrdi 287	. . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (([𝐴](𝑅 ⋉ 𝑆) ∩ [𝐵](𝑅 ⋉ 𝑆)) ≠ ∅ ↔ ∃𝑦∃𝑧((𝐴𝑅𝑦 ∧ 𝐵𝑅𝑦) ∧ (𝐴𝑆𝑧 ∧ 𝐵𝑆𝑧))))
12		exdistrv 1956	. . . . 5 ⊢ (∃𝑦∃𝑧((𝐴𝑅𝑦 ∧ 𝐵𝑅𝑦) ∧ (𝐴𝑆𝑧 ∧ 𝐵𝑆𝑧)) ↔ (∃𝑦(𝐴𝑅𝑦 ∧ 𝐵𝑅𝑦) ∧ ∃𝑧(𝐴𝑆𝑧 ∧ 𝐵𝑆𝑧)))
13	11, 12	bitrdi 287	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (([𝐴](𝑅 ⋉ 𝑆) ∩ [𝐵](𝑅 ⋉ 𝑆)) ≠ ∅ ↔ (∃𝑦(𝐴𝑅𝑦 ∧ 𝐵𝑅𝑦) ∧ ∃𝑧(𝐴𝑆𝑧 ∧ 𝐵𝑆𝑧))))
14		ecinn0 38551	. . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (([𝐴]𝑅 ∩ [𝐵]𝑅) ≠ ∅ ↔ ∃𝑦(𝐴𝑅𝑦 ∧ 𝐵𝑅𝑦)))
15		ecinn0 38551	. . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (([𝐴]𝑆 ∩ [𝐵]𝑆) ≠ ∅ ↔ ∃𝑧(𝐴𝑆𝑧 ∧ 𝐵𝑆𝑧)))
16	14, 15	anbi12d 632	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ((([𝐴]𝑅 ∩ [𝐵]𝑅) ≠ ∅ ∧ ([𝐴]𝑆 ∩ [𝐵]𝑆) ≠ ∅) ↔ (∃𝑦(𝐴𝑅𝑦 ∧ 𝐵𝑅𝑦) ∧ ∃𝑧(𝐴𝑆𝑧 ∧ 𝐵𝑆𝑧))))
17	13, 16	bitr4d 282	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (([𝐴](𝑅 ⋉ 𝑆) ∩ [𝐵](𝑅 ⋉ 𝑆)) ≠ ∅ ↔ (([𝐴]𝑅 ∩ [𝐵]𝑅) ≠ ∅ ∧ ([𝐴]𝑆 ∩ [𝐵]𝑆) ≠ ∅)))
18		neanior 3025	. . 3 ⊢ ((([𝐴]𝑅 ∩ [𝐵]𝑅) ≠ ∅ ∧ ([𝐴]𝑆 ∩ [𝐵]𝑆) ≠ ∅) ↔ ¬ (([𝐴]𝑅 ∩ [𝐵]𝑅) = ∅ ∨ ([𝐴]𝑆 ∩ [𝐵]𝑆) = ∅))
19	17, 18	bitrdi 287	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (([𝐴](𝑅 ⋉ 𝑆) ∩ [𝐵](𝑅 ⋉ 𝑆)) ≠ ∅ ↔ ¬ (([𝐴]𝑅 ∩ [𝐵]𝑅) = ∅ ∨ ([𝐴]𝑆 ∩ [𝐵]𝑆) = ∅)))
20	19	necon4abid 2972	1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (([𝐴](𝑅 ⋉ 𝑆) ∩ [𝐵](𝑅 ⋉ 𝑆)) = ∅ ↔ (([𝐴]𝑅 ∩ [𝐵]𝑅) = ∅ ∨ ([𝐴]𝑆 ∩ [𝐵]𝑆) = ∅)))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   ∨ wo 847   = wceq 1541  ∃wex 1780   ∈ wcel 2113   ≠ wne 2932   ∩ cin 3900  ∅c0 4285   class class class wbr 5098  {copab 5160  [cec 8633   ⋉ cxrn 38377

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 2184  ax-ext 2708  ax-sep 5241  ax-nul 5251  ax-pr 5377  ax-un 7680

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 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-rab 3400  df-v 3442  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-nul 4286  df-if 4480  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-br 5099  df-opab 5161  df-mpt 5180  df-id 5519  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-fo 6498  df-fv 6500  df-1st 7933  df-2nd 7934  df-ec 8637  df-xrn 38578

This theorem is referenced by:  disjecxrncnvep  38611