dvdsruasso - Mathbox for Thierry Arnoux

	Mathbox for Thierry Arnoux		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > dvdsruasso		Structured version Visualization version GIF version

Theorem dvdsruasso 32485

Description: Two elements 𝑋 and 𝑌 of a ring 𝑅 are associates, i.e. each divides the other, iff they are unit multiples of each other. (Contributed by Thierry Arnoux, 22-Mar-2025.)

**Hypotheses**
Ref	Expression
dvdsrspss.b	⊢ 𝐵 = (Base‘𝑅)
dvdsrspss.k	⊢ 𝐾 = (RSpan‘𝑅)
dvdsrspss.d	⊢ ∥ = (∥_r‘𝑅)
dvdsrspss.x	⊢ (𝜑 → 𝑋 ∈ 𝐵)
dvdsrspss.y	⊢ (𝜑 → 𝑌 ∈ 𝐵)
dvdsruassoi.1	⊢ 𝑈 = (Unit‘𝑅)
dvdsruassoi.2	⊢ · = (._r‘𝑅)
dvdsruasso.r	⊢ (𝜑 → 𝑅 ∈ IDomn)

**Assertion**
Ref	Expression
dvdsruasso	⊢ (𝜑 → ((𝑋 ∥ 𝑌 ∧ 𝑌 ∥ 𝑋) ↔ ∃𝑢 ∈ 𝑈 (𝑢 · 𝑋) = 𝑌))

Distinct variable groups: 𝑢, · 𝑢, ∥ 𝑢,𝐵 𝑢,𝑅 𝑢,𝑈 𝑢,𝑋 𝑢,𝑌 𝜑,𝑢 Allowed substitution hint: 𝐾(𝑢)

Proof of Theorem dvdsruasso Dummy variables 𝑠 𝑡 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		dvdsrspss.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝑅)
2		dvdsrspss.d	. . . . . 6 ⊢ ∥ = (∥_r‘𝑅)
3		dvdsruassoi.2	. . . . . 6 ⊢ · = (._r‘𝑅)
4	1, 2, 3	dvdsr 20175	. . . . 5 ⊢ (𝑋 ∥ 𝑌 ↔ (𝑋 ∈ 𝐵 ∧ ∃𝑡 ∈ 𝐵 (𝑡 · 𝑋) = 𝑌))
5		dvdsrspss.x	. . . . . 6 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
6	5	biantrurd 533	. . . . 5 ⊢ (𝜑 → (∃𝑡 ∈ 𝐵 (𝑡 · 𝑋) = 𝑌 ↔ (𝑋 ∈ 𝐵 ∧ ∃𝑡 ∈ 𝐵 (𝑡 · 𝑋) = 𝑌)))
7	4, 6	bitr4id 289	. . . 4 ⊢ (𝜑 → (𝑋 ∥ 𝑌 ↔ ∃𝑡 ∈ 𝐵 (𝑡 · 𝑋) = 𝑌))
8	1, 2, 3	dvdsr 20175	. . . . 5 ⊢ (𝑌 ∥ 𝑋 ↔ (𝑌 ∈ 𝐵 ∧ ∃𝑠 ∈ 𝐵 (𝑠 · 𝑌) = 𝑋))
9		dvdsrspss.y	. . . . . 6 ⊢ (𝜑 → 𝑌 ∈ 𝐵)
10	9	biantrurd 533	. . . . 5 ⊢ (𝜑 → (∃𝑠 ∈ 𝐵 (𝑠 · 𝑌) = 𝑋 ↔ (𝑌 ∈ 𝐵 ∧ ∃𝑠 ∈ 𝐵 (𝑠 · 𝑌) = 𝑋)))
11	8, 10	bitr4id 289	. . . 4 ⊢ (𝜑 → (𝑌 ∥ 𝑋 ↔ ∃𝑠 ∈ 𝐵 (𝑠 · 𝑌) = 𝑋))
12	7, 11	anbi12d 631	. . 3 ⊢ (𝜑 → ((𝑋 ∥ 𝑌 ∧ 𝑌 ∥ 𝑋) ↔ (∃𝑡 ∈ 𝐵 (𝑡 · 𝑋) = 𝑌 ∧ ∃𝑠 ∈ 𝐵 (𝑠 · 𝑌) = 𝑋)))
13		dvdsruasso.r	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝑅 ∈ IDomn)
14	13	idomringd 32370	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑅 ∈ Ring)
15		dvdsruassoi.1	. . . . . . . . . . . . . . 15 ⊢ 𝑈 = (Unit‘𝑅)
16		eqid 2732	. . . . . . . . . . . . . . 15 ⊢ (1_r‘𝑅) = (1_r‘𝑅)
17	15, 16	1unit 20187	. . . . . . . . . . . . . 14 ⊢ (𝑅 ∈ Ring → (1_r‘𝑅) ∈ 𝑈)
18	14, 17	syl 17	. . . . . . . . . . . . 13 ⊢ (𝜑 → (1_r‘𝑅) ∈ 𝑈)
19	18	ad5antr 732	. . . . . . . . . . . 12 ⊢ ((((((𝜑 ∧ 𝑠 ∈ 𝐵) ∧ (𝑠 · 𝑌) = 𝑋) ∧ 𝑡 ∈ 𝐵) ∧ (𝑡 · 𝑋) = 𝑌) ∧ 𝑋 = (0_g‘𝑅)) → (1_r‘𝑅) ∈ 𝑈)
20		oveq1 7415	. . . . . . . . . . . . . 14 ⊢ (𝑢 = (1_r‘𝑅) → (𝑢 · 𝑋) = ((1_r‘𝑅) · 𝑋))
21	20	eqeq1d 2734	. . . . . . . . . . . . 13 ⊢ (𝑢 = (1_r‘𝑅) → ((𝑢 · 𝑋) = 𝑌 ↔ ((1_r‘𝑅) · 𝑋) = 𝑌))
22	21	adantl 482	. . . . . . . . . . . 12 ⊢ (((((((𝜑 ∧ 𝑠 ∈ 𝐵) ∧ (𝑠 · 𝑌) = 𝑋) ∧ 𝑡 ∈ 𝐵) ∧ (𝑡 · 𝑋) = 𝑌) ∧ 𝑋 = (0_g‘𝑅)) ∧ 𝑢 = (1_r‘𝑅)) → ((𝑢 · 𝑋) = 𝑌 ↔ ((1_r‘𝑅) · 𝑋) = 𝑌))
23	14	ad5antr 732	. . . . . . . . . . . . . 14 ⊢ ((((((𝜑 ∧ 𝑠 ∈ 𝐵) ∧ (𝑠 · 𝑌) = 𝑋) ∧ 𝑡 ∈ 𝐵) ∧ (𝑡 · 𝑋) = 𝑌) ∧ 𝑋 = (0_g‘𝑅)) → 𝑅 ∈ Ring)
24	5	ad5antr 732	. . . . . . . . . . . . . 14 ⊢ ((((((𝜑 ∧ 𝑠 ∈ 𝐵) ∧ (𝑠 · 𝑌) = 𝑋) ∧ 𝑡 ∈ 𝐵) ∧ (𝑡 · 𝑋) = 𝑌) ∧ 𝑋 = (0_g‘𝑅)) → 𝑋 ∈ 𝐵)
25	1, 3, 16, 23, 24	ringlidmd 20088	. . . . . . . . . . . . 13 ⊢ ((((((𝜑 ∧ 𝑠 ∈ 𝐵) ∧ (𝑠 · 𝑌) = 𝑋) ∧ 𝑡 ∈ 𝐵) ∧ (𝑡 · 𝑋) = 𝑌) ∧ 𝑋 = (0_g‘𝑅)) → ((1_r‘𝑅) · 𝑋) = 𝑋)
26		simpr 485	. . . . . . . . . . . . 13 ⊢ ((((((𝜑 ∧ 𝑠 ∈ 𝐵) ∧ (𝑠 · 𝑌) = 𝑋) ∧ 𝑡 ∈ 𝐵) ∧ (𝑡 · 𝑋) = 𝑌) ∧ 𝑋 = (0_g‘𝑅)) → 𝑋 = (0_g‘𝑅))
27	26	oveq2d 7424	. . . . . . . . . . . . . 14 ⊢ ((((((𝜑 ∧ 𝑠 ∈ 𝐵) ∧ (𝑠 · 𝑌) = 𝑋) ∧ 𝑡 ∈ 𝐵) ∧ (𝑡 · 𝑋) = 𝑌) ∧ 𝑋 = (0_g‘𝑅)) → (𝑡 · 𝑋) = (𝑡 · (0_g‘𝑅)))
28		simplr 767	. . . . . . . . . . . . . 14 ⊢ ((((((𝜑 ∧ 𝑠 ∈ 𝐵) ∧ (𝑠 · 𝑌) = 𝑋) ∧ 𝑡 ∈ 𝐵) ∧ (𝑡 · 𝑋) = 𝑌) ∧ 𝑋 = (0_g‘𝑅)) → (𝑡 · 𝑋) = 𝑌)
29		simpllr 774	. . . . . . . . . . . . . . 15 ⊢ ((((((𝜑 ∧ 𝑠 ∈ 𝐵) ∧ (𝑠 · 𝑌) = 𝑋) ∧ 𝑡 ∈ 𝐵) ∧ (𝑡 · 𝑋) = 𝑌) ∧ 𝑋 = (0_g‘𝑅)) → 𝑡 ∈ 𝐵)
30		eqid 2732	. . . . . . . . . . . . . . . 16 ⊢ (0_g‘𝑅) = (0_g‘𝑅)
31	1, 3, 30	ringrz 20107	. . . . . . . . . . . . . . 15 ⊢ ((𝑅 ∈ Ring ∧ 𝑡 ∈ 𝐵) → (𝑡 · (0_g‘𝑅)) = (0_g‘𝑅))
32	23, 29, 31	syl2anc 584	. . . . . . . . . . . . . 14 ⊢ ((((((𝜑 ∧ 𝑠 ∈ 𝐵) ∧ (𝑠 · 𝑌) = 𝑋) ∧ 𝑡 ∈ 𝐵) ∧ (𝑡 · 𝑋) = 𝑌) ∧ 𝑋 = (0_g‘𝑅)) → (𝑡 · (0_g‘𝑅)) = (0_g‘𝑅))
33	27, 28, 32	3eqtr3rd 2781	. . . . . . . . . . . . 13 ⊢ ((((((𝜑 ∧ 𝑠 ∈ 𝐵) ∧ (𝑠 · 𝑌) = 𝑋) ∧ 𝑡 ∈ 𝐵) ∧ (𝑡 · 𝑋) = 𝑌) ∧ 𝑋 = (0_g‘𝑅)) → (0_g‘𝑅) = 𝑌)
34	25, 26, 33	3eqtrd 2776	. . . . . . . . . . . 12 ⊢ ((((((𝜑 ∧ 𝑠 ∈ 𝐵) ∧ (𝑠 · 𝑌) = 𝑋) ∧ 𝑡 ∈ 𝐵) ∧ (𝑡 · 𝑋) = 𝑌) ∧ 𝑋 = (0_g‘𝑅)) → ((1_r‘𝑅) · 𝑋) = 𝑌)
35	19, 22, 34	rspcedvd 3614	. . . . . . . . . . 11 ⊢ ((((((𝜑 ∧ 𝑠 ∈ 𝐵) ∧ (𝑠 · 𝑌) = 𝑋) ∧ 𝑡 ∈ 𝐵) ∧ (𝑡 · 𝑋) = 𝑌) ∧ 𝑋 = (0_g‘𝑅)) → ∃𝑢 ∈ 𝑈 (𝑢 · 𝑋) = 𝑌)
36		isidom 20921	. . . . . . . . . . . . . . . 16 ⊢ (𝑅 ∈ IDomn ↔ (𝑅 ∈ CRing ∧ 𝑅 ∈ Domn))
37	13, 36	sylib 217	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (𝑅 ∈ CRing ∧ 𝑅 ∈ Domn))
38	37	simpld 495	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑅 ∈ CRing)
39	38	ad5antr 732	. . . . . . . . . . . . 13 ⊢ ((((((𝜑 ∧ 𝑠 ∈ 𝐵) ∧ (𝑠 · 𝑌) = 𝑋) ∧ 𝑡 ∈ 𝐵) ∧ (𝑡 · 𝑋) = 𝑌) ∧ 𝑋 ≠ (0_g‘𝑅)) → 𝑅 ∈ CRing)
40		simp-5r 784	. . . . . . . . . . . . 13 ⊢ ((((((𝜑 ∧ 𝑠 ∈ 𝐵) ∧ (𝑠 · 𝑌) = 𝑋) ∧ 𝑡 ∈ 𝐵) ∧ (𝑡 · 𝑋) = 𝑌) ∧ 𝑋 ≠ (0_g‘𝑅)) → 𝑠 ∈ 𝐵)
41		simpllr 774	. . . . . . . . . . . . 13 ⊢ ((((((𝜑 ∧ 𝑠 ∈ 𝐵) ∧ (𝑠 · 𝑌) = 𝑋) ∧ 𝑡 ∈ 𝐵) ∧ (𝑡 · 𝑋) = 𝑌) ∧ 𝑋 ≠ (0_g‘𝑅)) → 𝑡 ∈ 𝐵)
42	5	ad5antr 732	. . . . . . . . . . . . . . . 16 ⊢ ((((((𝜑 ∧ 𝑠 ∈ 𝐵) ∧ (𝑠 · 𝑌) = 𝑋) ∧ 𝑡 ∈ 𝐵) ∧ (𝑡 · 𝑋) = 𝑌) ∧ 𝑋 ≠ (0_g‘𝑅)) → 𝑋 ∈ 𝐵)
43		simpr 485	. . . . . . . . . . . . . . . 16 ⊢ ((((((𝜑 ∧ 𝑠 ∈ 𝐵) ∧ (𝑠 · 𝑌) = 𝑋) ∧ 𝑡 ∈ 𝐵) ∧ (𝑡 · 𝑋) = 𝑌) ∧ 𝑋 ≠ (0_g‘𝑅)) → 𝑋 ≠ (0_g‘𝑅))
44		eldifsn 4790	. . . . . . . . . . . . . . . 16 ⊢ (𝑋 ∈ (𝐵 ∖ {(0_g‘𝑅)}) ↔ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ (0_g‘𝑅)))
45	42, 43, 44	sylanbrc 583	. . . . . . . . . . . . . . 15 ⊢ ((((((𝜑 ∧ 𝑠 ∈ 𝐵) ∧ (𝑠 · 𝑌) = 𝑋) ∧ 𝑡 ∈ 𝐵) ∧ (𝑡 · 𝑋) = 𝑌) ∧ 𝑋 ≠ (0_g‘𝑅)) → 𝑋 ∈ (𝐵 ∖ {(0_g‘𝑅)}))
46	14	ad5antr 732	. . . . . . . . . . . . . . . 16 ⊢ ((((((𝜑 ∧ 𝑠 ∈ 𝐵) ∧ (𝑠 · 𝑌) = 𝑋) ∧ 𝑡 ∈ 𝐵) ∧ (𝑡 · 𝑋) = 𝑌) ∧ 𝑋 ≠ (0_g‘𝑅)) → 𝑅 ∈ Ring)
47	1, 3, 46, 40, 41	ringcld 20079	. . . . . . . . . . . . . . 15 ⊢ ((((((𝜑 ∧ 𝑠 ∈ 𝐵) ∧ (𝑠 · 𝑌) = 𝑋) ∧ 𝑡 ∈ 𝐵) ∧ (𝑡 · 𝑋) = 𝑌) ∧ 𝑋 ≠ (0_g‘𝑅)) → (𝑠 · 𝑡) ∈ 𝐵)
48	1, 16	ringidcl 20082	. . . . . . . . . . . . . . . 16 ⊢ (𝑅 ∈ Ring → (1_r‘𝑅) ∈ 𝐵)
49	46, 48	syl 17	. . . . . . . . . . . . . . 15 ⊢ ((((((𝜑 ∧ 𝑠 ∈ 𝐵) ∧ (𝑠 · 𝑌) = 𝑋) ∧ 𝑡 ∈ 𝐵) ∧ (𝑡 · 𝑋) = 𝑌) ∧ 𝑋 ≠ (0_g‘𝑅)) → (1_r‘𝑅) ∈ 𝐵)
50	13	ad5antr 732	. . . . . . . . . . . . . . 15 ⊢ ((((((𝜑 ∧ 𝑠 ∈ 𝐵) ∧ (𝑠 · 𝑌) = 𝑋) ∧ 𝑡 ∈ 𝐵) ∧ (𝑡 · 𝑋) = 𝑌) ∧ 𝑋 ≠ (0_g‘𝑅)) → 𝑅 ∈ IDomn)
51		simplr 767	. . . . . . . . . . . . . . . . . 18 ⊢ ((((((𝜑 ∧ 𝑠 ∈ 𝐵) ∧ (𝑠 · 𝑌) = 𝑋) ∧ 𝑡 ∈ 𝐵) ∧ (𝑡 · 𝑋) = 𝑌) ∧ 𝑋 ≠ (0_g‘𝑅)) → (𝑡 · 𝑋) = 𝑌)
52	51	oveq2d 7424	. . . . . . . . . . . . . . . . 17 ⊢ ((((((𝜑 ∧ 𝑠 ∈ 𝐵) ∧ (𝑠 · 𝑌) = 𝑋) ∧ 𝑡 ∈ 𝐵) ∧ (𝑡 · 𝑋) = 𝑌) ∧ 𝑋 ≠ (0_g‘𝑅)) → (𝑠 · (𝑡 · 𝑋)) = (𝑠 · 𝑌))
53		simp-4r 782	. . . . . . . . . . . . . . . . 17 ⊢ ((((((𝜑 ∧ 𝑠 ∈ 𝐵) ∧ (𝑠 · 𝑌) = 𝑋) ∧ 𝑡 ∈ 𝐵) ∧ (𝑡 · 𝑋) = 𝑌) ∧ 𝑋 ≠ (0_g‘𝑅)) → (𝑠 · 𝑌) = 𝑋)
54	52, 53	eqtrd 2772	. . . . . . . . . . . . . . . 16 ⊢ ((((((𝜑 ∧ 𝑠 ∈ 𝐵) ∧ (𝑠 · 𝑌) = 𝑋) ∧ 𝑡 ∈ 𝐵) ∧ (𝑡 · 𝑋) = 𝑌) ∧ 𝑋 ≠ (0_g‘𝑅)) → (𝑠 · (𝑡 · 𝑋)) = 𝑋)
55	1, 3, 46, 40, 41, 42	ringassd 20078	. . . . . . . . . . . . . . . 16 ⊢ ((((((𝜑 ∧ 𝑠 ∈ 𝐵) ∧ (𝑠 · 𝑌) = 𝑋) ∧ 𝑡 ∈ 𝐵) ∧ (𝑡 · 𝑋) = 𝑌) ∧ 𝑋 ≠ (0_g‘𝑅)) → ((𝑠 · 𝑡) · 𝑋) = (𝑠 · (𝑡 · 𝑋)))
56	1, 3, 16, 46, 42	ringlidmd 20088	. . . . . . . . . . . . . . . 16 ⊢ ((((((𝜑 ∧ 𝑠 ∈ 𝐵) ∧ (𝑠 · 𝑌) = 𝑋) ∧ 𝑡 ∈ 𝐵) ∧ (𝑡 · 𝑋) = 𝑌) ∧ 𝑋 ≠ (0_g‘𝑅)) → ((1_r‘𝑅) · 𝑋) = 𝑋)
57	54, 55, 56	3eqtr4d 2782	. . . . . . . . . . . . . . 15 ⊢ ((((((𝜑 ∧ 𝑠 ∈ 𝐵) ∧ (𝑠 · 𝑌) = 𝑋) ∧ 𝑡 ∈ 𝐵) ∧ (𝑡 · 𝑋) = 𝑌) ∧ 𝑋 ≠ (0_g‘𝑅)) → ((𝑠 · 𝑡) · 𝑋) = ((1_r‘𝑅) · 𝑋))
58	1, 30, 3, 45, 47, 49, 50, 57	idomrcan 32372	. . . . . . . . . . . . . 14 ⊢ ((((((𝜑 ∧ 𝑠 ∈ 𝐵) ∧ (𝑠 · 𝑌) = 𝑋) ∧ 𝑡 ∈ 𝐵) ∧ (𝑡 · 𝑋) = 𝑌) ∧ 𝑋 ≠ (0_g‘𝑅)) → (𝑠 · 𝑡) = (1_r‘𝑅))
59	46, 17	syl 17	. . . . . . . . . . . . . 14 ⊢ ((((((𝜑 ∧ 𝑠 ∈ 𝐵) ∧ (𝑠 · 𝑌) = 𝑋) ∧ 𝑡 ∈ 𝐵) ∧ (𝑡 · 𝑋) = 𝑌) ∧ 𝑋 ≠ (0_g‘𝑅)) → (1_r‘𝑅) ∈ 𝑈)
60	58, 59	eqeltrd 2833	. . . . . . . . . . . . 13 ⊢ ((((((𝜑 ∧ 𝑠 ∈ 𝐵) ∧ (𝑠 · 𝑌) = 𝑋) ∧ 𝑡 ∈ 𝐵) ∧ (𝑡 · 𝑋) = 𝑌) ∧ 𝑋 ≠ (0_g‘𝑅)) → (𝑠 · 𝑡) ∈ 𝑈)
61	15, 3, 1	unitmulclb 20194	. . . . . . . . . . . . . 14 ⊢ ((𝑅 ∈ CRing ∧ 𝑠 ∈ 𝐵 ∧ 𝑡 ∈ 𝐵) → ((𝑠 · 𝑡) ∈ 𝑈 ↔ (𝑠 ∈ 𝑈 ∧ 𝑡 ∈ 𝑈)))
62	61	simplbda 500	. . . . . . . . . . . . 13 ⊢ (((𝑅 ∈ CRing ∧ 𝑠 ∈ 𝐵 ∧ 𝑡 ∈ 𝐵) ∧ (𝑠 · 𝑡) ∈ 𝑈) → 𝑡 ∈ 𝑈)
63	39, 40, 41, 60, 62	syl31anc 1373	. . . . . . . . . . . 12 ⊢ ((((((𝜑 ∧ 𝑠 ∈ 𝐵) ∧ (𝑠 · 𝑌) = 𝑋) ∧ 𝑡 ∈ 𝐵) ∧ (𝑡 · 𝑋) = 𝑌) ∧ 𝑋 ≠ (0_g‘𝑅)) → 𝑡 ∈ 𝑈)
64		oveq1 7415	. . . . . . . . . . . . . 14 ⊢ (𝑢 = 𝑡 → (𝑢 · 𝑋) = (𝑡 · 𝑋))
65	64	eqeq1d 2734	. . . . . . . . . . . . 13 ⊢ (𝑢 = 𝑡 → ((𝑢 · 𝑋) = 𝑌 ↔ (𝑡 · 𝑋) = 𝑌))
66	65	adantl 482	. . . . . . . . . . . 12 ⊢ (((((((𝜑 ∧ 𝑠 ∈ 𝐵) ∧ (𝑠 · 𝑌) = 𝑋) ∧ 𝑡 ∈ 𝐵) ∧ (𝑡 · 𝑋) = 𝑌) ∧ 𝑋 ≠ (0_g‘𝑅)) ∧ 𝑢 = 𝑡) → ((𝑢 · 𝑋) = 𝑌 ↔ (𝑡 · 𝑋) = 𝑌))
67	63, 66, 51	rspcedvd 3614	. . . . . . . . . . 11 ⊢ ((((((𝜑 ∧ 𝑠 ∈ 𝐵) ∧ (𝑠 · 𝑌) = 𝑋) ∧ 𝑡 ∈ 𝐵) ∧ (𝑡 · 𝑋) = 𝑌) ∧ 𝑋 ≠ (0_g‘𝑅)) → ∃𝑢 ∈ 𝑈 (𝑢 · 𝑋) = 𝑌)
68	35, 67	pm2.61dane 3029	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑠 ∈ 𝐵) ∧ (𝑠 · 𝑌) = 𝑋) ∧ 𝑡 ∈ 𝐵) ∧ (𝑡 · 𝑋) = 𝑌) → ∃𝑢 ∈ 𝑈 (𝑢 · 𝑋) = 𝑌)
69	68	r19.29an 3158	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑠 ∈ 𝐵) ∧ (𝑠 · 𝑌) = 𝑋) ∧ ∃𝑡 ∈ 𝐵 (𝑡 · 𝑋) = 𝑌) → ∃𝑢 ∈ 𝑈 (𝑢 · 𝑋) = 𝑌)
70	69	an32s 650	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑠 ∈ 𝐵) ∧ ∃𝑡 ∈ 𝐵 (𝑡 · 𝑋) = 𝑌) ∧ (𝑠 · 𝑌) = 𝑋) → ∃𝑢 ∈ 𝑈 (𝑢 · 𝑋) = 𝑌)
71	70	ex 413	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑠 ∈ 𝐵) ∧ ∃𝑡 ∈ 𝐵 (𝑡 · 𝑋) = 𝑌) → ((𝑠 · 𝑌) = 𝑋 → ∃𝑢 ∈ 𝑈 (𝑢 · 𝑋) = 𝑌))
72	71	an32s 650	. . . . . 6 ⊢ (((𝜑 ∧ ∃𝑡 ∈ 𝐵 (𝑡 · 𝑋) = 𝑌) ∧ 𝑠 ∈ 𝐵) → ((𝑠 · 𝑌) = 𝑋 → ∃𝑢 ∈ 𝑈 (𝑢 · 𝑋) = 𝑌))
73	72	imp 407	. . . . 5 ⊢ ((((𝜑 ∧ ∃𝑡 ∈ 𝐵 (𝑡 · 𝑋) = 𝑌) ∧ 𝑠 ∈ 𝐵) ∧ (𝑠 · 𝑌) = 𝑋) → ∃𝑢 ∈ 𝑈 (𝑢 · 𝑋) = 𝑌)
74	73	r19.29an 3158	. . . 4 ⊢ (((𝜑 ∧ ∃𝑡 ∈ 𝐵 (𝑡 · 𝑋) = 𝑌) ∧ ∃𝑠 ∈ 𝐵 (𝑠 · 𝑌) = 𝑋) → ∃𝑢 ∈ 𝑈 (𝑢 · 𝑋) = 𝑌)
75	74	anasss 467	. . 3 ⊢ ((𝜑 ∧ (∃𝑡 ∈ 𝐵 (𝑡 · 𝑋) = 𝑌 ∧ ∃𝑠 ∈ 𝐵 (𝑠 · 𝑌) = 𝑋)) → ∃𝑢 ∈ 𝑈 (𝑢 · 𝑋) = 𝑌)
76	12, 75	sylbida 592	. 2 ⊢ ((𝜑 ∧ (𝑋 ∥ 𝑌 ∧ 𝑌 ∥ 𝑋)) → ∃𝑢 ∈ 𝑈 (𝑢 · 𝑋) = 𝑌)
77		dvdsrspss.k	. . . 4 ⊢ 𝐾 = (RSpan‘𝑅)
78	5	ad2antrr 724	. . . 4 ⊢ (((𝜑 ∧ 𝑢 ∈ 𝑈) ∧ (𝑢 · 𝑋) = 𝑌) → 𝑋 ∈ 𝐵)
79	9	ad2antrr 724	. . . 4 ⊢ (((𝜑 ∧ 𝑢 ∈ 𝑈) ∧ (𝑢 · 𝑋) = 𝑌) → 𝑌 ∈ 𝐵)
80	14	ad2antrr 724	. . . 4 ⊢ (((𝜑 ∧ 𝑢 ∈ 𝑈) ∧ (𝑢 · 𝑋) = 𝑌) → 𝑅 ∈ Ring)
81		simplr 767	. . . 4 ⊢ (((𝜑 ∧ 𝑢 ∈ 𝑈) ∧ (𝑢 · 𝑋) = 𝑌) → 𝑢 ∈ 𝑈)
82		simpr 485	. . . 4 ⊢ (((𝜑 ∧ 𝑢 ∈ 𝑈) ∧ (𝑢 · 𝑋) = 𝑌) → (𝑢 · 𝑋) = 𝑌)
83	1, 77, 2, 78, 79, 15, 3, 80, 81, 82	dvdsruassoi 32484	. . 3 ⊢ (((𝜑 ∧ 𝑢 ∈ 𝑈) ∧ (𝑢 · 𝑋) = 𝑌) → (𝑋 ∥ 𝑌 ∧ 𝑌 ∥ 𝑋))
84	83	r19.29an 3158	. 2 ⊢ ((𝜑 ∧ ∃𝑢 ∈ 𝑈 (𝑢 · 𝑋) = 𝑌) → (𝑋 ∥ 𝑌 ∧ 𝑌 ∥ 𝑋))
85	76, 84	impbida 799	1 ⊢ (𝜑 → ((𝑋 ∥ 𝑌 ∧ 𝑌 ∥ 𝑋) ↔ ∃𝑢 ∈ 𝑈 (𝑢 · 𝑋) = 𝑌))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 ∧ w3a 1087 = wceq 1541 ∈ wcel 2106 ≠ wne 2940 ∃wrex 3070 ∖ cdif 3945 {csn 4628 class class class wbr 5148 ‘cfv 6543 (class class class)co 7408 Basecbs 17143 ._rcmulr 17197 0_gc0g 17384 1_rcur 20003 Ringcrg 20055 CRingccrg 20056 ∥_rcdsr 20167 Unitcui 20168 RSpancrsp 20783 Domncdomn 20895 IDomncidom 20896

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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-rep 5285 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7724 ax-cnex 11165 ax-resscn 11166 ax-1cn 11167 ax-icn 11168 ax-addcl 11169 ax-addrcl 11170 ax-mulcl 11171 ax-mulrcl 11172 ax-mulcom 11173 ax-addass 11174 ax-mulass 11175 ax-distr 11176 ax-i2m1 11177 ax-1ne0 11178 ax-1rid 11179 ax-rnegex 11180 ax-rrecex 11181 ax-cnre 11182 ax-pre-lttri 11183 ax-pre-lttrn 11184 ax-pre-ltadd 11185 ax-pre-mulgt0 11186

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3376 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-pss 3967 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-iun 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5574 df-eprel 5580 df-po 5588 df-so 5589 df-fr 5631 df-we 5633 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-pred 6300 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7364 df-ov 7411 df-oprab 7412 df-mpo 7413 df-om 7855 df-1st 7974 df-2nd 7975 df-tpos 8210 df-frecs 8265 df-wrecs 8296 df-recs 8370 df-rdg 8409 df-er 8702 df-en 8939 df-dom 8940 df-sdom 8941 df-pnf 11249 df-mnf 11250 df-xr 11251 df-ltxr 11252 df-le 11253 df-sub 11445 df-neg 11446 df-nn 12212 df-2 12274 df-3 12275 df-sets 17096 df-slot 17114 df-ndx 17126 df-base 17144 df-ress 17173 df-plusg 17209 df-mulr 17210 df-0g 17386 df-mgm 18560 df-sgrp 18609 df-mnd 18625 df-grp 18821 df-minusg 18822 df-sbg 18823 df-cmn 19649 df-mgp 19987 df-ur 20004 df-ring 20057 df-cring 20058 df-oppr 20149 df-dvdsr 20170 df-unit 20171 df-invr 20201 df-nzr 20291 df-domn 20899 df-idom 20900

This theorem is referenced by: (None)

W3C validator