qirropth - Mathbox for Stefan O'Rear

	Mathbox for Stefan O'Rear		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > qirropth		Structured version Visualization version GIF version

Theorem qirropth 43655

Description: This lemma implements the concept of "equate rational and irrational parts", used to prove many arithmetical properties of the X and Y sequences. (Contributed by Stefan O'Rear, 21-Sep-2014.)

**Assertion**
Ref	Expression
qirropth	⊢ ((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) → ((𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸)) ↔ (𝐵 = 𝐷 ∧ 𝐶 = 𝐸)))

**Proof of Theorem qirropth**
Step	Hyp	Ref	Expression
1		eldifn 4086	. . . . . . . 8 ⊢ (𝐴 ∈ (ℂ ∖ ℚ) → ¬ 𝐴 ∈ ℚ)
2	1	3ad2ant1 1151	. . . . . . 7 ⊢ ((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) → ¬ 𝐴 ∈ ℚ)
3	2	adantr 485	. . . . . 6 ⊢ (((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) → ¬ 𝐴 ∈ ℚ)
4		simpll1 1231	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → 𝐴 ∈ (ℂ ∖ ℚ))
5	4	eldifad 3917	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → 𝐴 ∈ ℂ)
6		simp2r 1219	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) → 𝐶 ∈ ℚ)
7	6	ad2antrr 738	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → 𝐶 ∈ ℚ)
8		qcn 12982	. . . . . . . . . . . 12 ⊢ (𝐶 ∈ ℚ → 𝐶 ∈ ℂ)
9	7, 8	syl 18	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → 𝐶 ∈ ℂ)
10		simp3r 1221	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) → 𝐸 ∈ ℚ)
11	10	ad2antrr 738	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → 𝐸 ∈ ℚ)
12		qcn 12982	. . . . . . . . . . . 12 ⊢ (𝐸 ∈ ℚ → 𝐸 ∈ ℂ)
13	11, 12	syl 18	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → 𝐸 ∈ ℂ)
14	5, 9, 13	subdid 11665	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → (𝐴 · (𝐶 − 𝐸)) = ((𝐴 · 𝐶) − (𝐴 · 𝐸)))
15		qsubcl 12987	. . . . . . . . . . . . 13 ⊢ ((𝐶 ∈ ℚ ∧ 𝐸 ∈ ℚ) → (𝐶 − 𝐸) ∈ ℚ)
16	7, 11, 15	syl2anc 595	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → (𝐶 − 𝐸) ∈ ℚ)
17		qcn 12982	. . . . . . . . . . . 12 ⊢ ((𝐶 − 𝐸) ∈ ℚ → (𝐶 − 𝐸) ∈ ℂ)
18	16, 17	syl 18	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → (𝐶 − 𝐸) ∈ ℂ)
19	18, 5	mulcomd 11225	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → ((𝐶 − 𝐸) · 𝐴) = (𝐴 · (𝐶 − 𝐸)))
20		simplr 780	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸)))
21		simp2l 1218	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) → 𝐵 ∈ ℚ)
22	21	ad2antrr 738	. . . . . . . . . . . . 13 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → 𝐵 ∈ ℚ)
23		qcn 12982	. . . . . . . . . . . . 13 ⊢ (𝐵 ∈ ℚ → 𝐵 ∈ ℂ)
24	22, 23	syl 18	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → 𝐵 ∈ ℂ)
25	5, 9	mulcld 11224	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → (𝐴 · 𝐶) ∈ ℂ)
26		simp3l 1220	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) → 𝐷 ∈ ℚ)
27	26	ad2antrr 738	. . . . . . . . . . . . 13 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → 𝐷 ∈ ℚ)
28		qcn 12982	. . . . . . . . . . . . 13 ⊢ (𝐷 ∈ ℚ → 𝐷 ∈ ℂ)
29	27, 28	syl 18	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → 𝐷 ∈ ℂ)
30	5, 13	mulcld 11224	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → (𝐴 · 𝐸) ∈ ℂ)
31	24, 25, 29, 30	addsubeq4d 11615	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → ((𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸)) ↔ (𝐷 − 𝐵) = ((𝐴 · 𝐶) − (𝐴 · 𝐸))))
32	20, 31	mpbid 235	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → (𝐷 − 𝐵) = ((𝐴 · 𝐶) − (𝐴 · 𝐸)))
33	14, 19, 32	3eqtr4d 2808	. . . . . . . . 9 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → ((𝐶 − 𝐸) · 𝐴) = (𝐷 − 𝐵))
34		qsubcl 12987	. . . . . . . . . . . 12 ⊢ ((𝐷 ∈ ℚ ∧ 𝐵 ∈ ℚ) → (𝐷 − 𝐵) ∈ ℚ)
35	27, 22, 34	syl2anc 595	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → (𝐷 − 𝐵) ∈ ℚ)
36		qcn 12982	. . . . . . . . . . 11 ⊢ ((𝐷 − 𝐵) ∈ ℚ → (𝐷 − 𝐵) ∈ ℂ)
37	35, 36	syl 18	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → (𝐷 − 𝐵) ∈ ℂ)
38		simpr 489	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → ¬ 𝐶 = 𝐸)
39		subeq0 11479	. . . . . . . . . . . . 13 ⊢ ((𝐶 ∈ ℂ ∧ 𝐸 ∈ ℂ) → ((𝐶 − 𝐸) = 0 ↔ 𝐶 = 𝐸))
40	39	necon3abid 2994	. . . . . . . . . . . 12 ⊢ ((𝐶 ∈ ℂ ∧ 𝐸 ∈ ℂ) → ((𝐶 − 𝐸) ≠ 0 ↔ ¬ 𝐶 = 𝐸))
41	9, 13, 40	syl2anc 595	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → ((𝐶 − 𝐸) ≠ 0 ↔ ¬ 𝐶 = 𝐸))
42	38, 41	mpbird 260	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → (𝐶 − 𝐸) ≠ 0)
43	37, 18, 5, 42	divmuld 12008	. . . . . . . . 9 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → (((𝐷 − 𝐵) / (𝐶 − 𝐸)) = 𝐴 ↔ ((𝐶 − 𝐸) · 𝐴) = (𝐷 − 𝐵)))
44	33, 43	mpbird 260	. . . . . . . 8 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → ((𝐷 − 𝐵) / (𝐶 − 𝐸)) = 𝐴)
45		qdivcl 12989	. . . . . . . . 9 ⊢ (((𝐷 − 𝐵) ∈ ℚ ∧ (𝐶 − 𝐸) ∈ ℚ ∧ (𝐶 − 𝐸) ≠ 0) → ((𝐷 − 𝐵) / (𝐶 − 𝐸)) ∈ ℚ)
46	35, 16, 42, 45	syl3anc 1398	. . . . . . . 8 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → ((𝐷 − 𝐵) / (𝐶 − 𝐸)) ∈ ℚ)
47	44, 46	eqeltrrd 2864	. . . . . . 7 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → 𝐴 ∈ ℚ)
48	47	ex 417	. . . . . 6 ⊢ (((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) → (¬ 𝐶 = 𝐸 → 𝐴 ∈ ℚ))
49	3, 48	mt3d 149	. . . . 5 ⊢ (((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) → 𝐶 = 𝐸)
50		simpl2l 1245	. . . . . . . . 9 ⊢ (((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) → 𝐵 ∈ ℚ)
51	50, 23	syl 18	. . . . . . . 8 ⊢ (((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) → 𝐵 ∈ ℂ)
52	51	adantr 485	. . . . . . 7 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ 𝐶 = 𝐸) → 𝐵 ∈ ℂ)
53		simpl3l 1247	. . . . . . . . 9 ⊢ (((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) → 𝐷 ∈ ℚ)
54	53, 28	syl 18	. . . . . . . 8 ⊢ (((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) → 𝐷 ∈ ℂ)
55	54	adantr 485	. . . . . . 7 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ 𝐶 = 𝐸) → 𝐷 ∈ ℂ)
56		simpl1 1210	. . . . . . . . . 10 ⊢ (((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) → 𝐴 ∈ (ℂ ∖ ℚ))
57	56	eldifad 3917	. . . . . . . . 9 ⊢ (((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) → 𝐴 ∈ ℂ)
58		simpl3r 1248	. . . . . . . . . 10 ⊢ (((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) → 𝐸 ∈ ℚ)
59	58, 12	syl 18	. . . . . . . . 9 ⊢ (((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) → 𝐸 ∈ ℂ)
60	57, 59	mulcld 11224	. . . . . . . 8 ⊢ (((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) → (𝐴 · 𝐸) ∈ ℂ)
61	60	adantr 485	. . . . . . 7 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ 𝐶 = 𝐸) → (𝐴 · 𝐸) ∈ ℂ)
62		simpr 489	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ 𝐶 = 𝐸) → 𝐶 = 𝐸)
63	62	eqcomd 2769	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ 𝐶 = 𝐸) → 𝐸 = 𝐶)
64	63	oveq2d 7426	. . . . . . . . 9 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ 𝐶 = 𝐸) → (𝐴 · 𝐸) = (𝐴 · 𝐶))
65	64	oveq2d 7426	. . . . . . . 8 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ 𝐶 = 𝐸) → (𝐵 + (𝐴 · 𝐸)) = (𝐵 + (𝐴 · 𝐶)))
66		simplr 780	. . . . . . . 8 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ 𝐶 = 𝐸) → (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸)))
67	65, 66	eqtrd 2798	. . . . . . 7 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ 𝐶 = 𝐸) → (𝐵 + (𝐴 · 𝐸)) = (𝐷 + (𝐴 · 𝐸)))
68	52, 55, 61, 67	addcan2ad 11411	. . . . . 6 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ 𝐶 = 𝐸) → 𝐵 = 𝐷)
69	68	ex 417	. . . . 5 ⊢ (((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) → (𝐶 = 𝐸 → 𝐵 = 𝐷))
70	49, 69	jcai 525	. . . 4 ⊢ (((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) → (𝐶 = 𝐸 ∧ 𝐵 = 𝐷))
71	70	ancomd 466	. . 3 ⊢ (((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) → (𝐵 = 𝐷 ∧ 𝐶 = 𝐸))
72	71	ex 417	. 2 ⊢ ((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) → ((𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸)) → (𝐵 = 𝐷 ∧ 𝐶 = 𝐸)))
73		id 23	. . 3 ⊢ (𝐵 = 𝐷 → 𝐵 = 𝐷)
74		oveq2 7418	. . 3 ⊢ (𝐶 = 𝐸 → (𝐴 · 𝐶) = (𝐴 · 𝐸))
75	73, 74	oveqan12d 7429	. 2 ⊢ ((𝐵 = 𝐷 ∧ 𝐶 = 𝐸) → (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸)))
76	72, 75	impbid1 228	1 ⊢ ((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) → ((𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸)) ↔ (𝐵 = 𝐷 ∧ 𝐶 = 𝐸)))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 400 ∧ w3a 1103 = wceq 1570 ∈ wcel 2143 ≠ wne 2958 ∖ cdif 3902 (class class class)co 7410 ℂcc 11093 0cc0 11095 + caddc 11098 · cmul 11100 − cmin 11436 / cdiv 11866 ℚcq 12967

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5257 ax-nul 5269 ax-pow 5336 ax-pr 5404 ax-un 7732 ax-resscn 11152 ax-1cn 11153 ax-icn 11154 ax-addcl 11155 ax-addrcl 11156 ax-mulcl 11157 ax-mulrcl 11158 ax-mulcom 11159 ax-addass 11160 ax-mulass 11161 ax-distr 11162 ax-i2m1 11163 ax-1ne0 11164 ax-1rid 11165 ax-rnegex 11166 ax-rrecex 11167 ax-cnre 11168 ax-pre-lttri 11169 ax-pre-lttrn 11170 ax-pre-ltadd 11171 ax-pre-mulgt0 11172

This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-iun 4958 df-br 5110 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5556 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-we 5616 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-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-om 7859 df-1st 7982 df-2nd 7983 df-frecs 8274 df-wrecs 8305 df-recs 8354 df-rdg 8393 df-er 8690 df-en 8940 df-dom 8941 df-sdom 8942 df-pnf 11240 df-mnf 11241 df-xr 11242 df-ltxr 11243 df-le 11244 df-sub 11438 df-neg 11439 df-div 11867 df-nn 12229 df-n0 12500 df-z 12587 df-q 12968

This theorem is referenced by: rmxypairf1o 43658 rmxycomplete 43664 rmxyneg 43667 rmxyadd 43668 rmxy1 43669 rmxy0 43670 jm2.22 43742

W3C validator