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 42924

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 4131	. . . . . . . 8 ⊢ (𝐴 ∈ (ℂ ∖ ℚ) → ¬ 𝐴 ∈ ℚ)
2	1	3ad2ant1 1133	. . . . . . 7 ⊢ ((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) → ¬ 𝐴 ∈ ℚ)
3	2	adantr 480	. . . . . 6 ⊢ (((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) → ¬ 𝐴 ∈ ℚ)
4		simpll1 1212	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → 𝐴 ∈ (ℂ ∖ ℚ))
5	4	eldifad 3962	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → 𝐴 ∈ ℂ)
6		simp2r 1200	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) → 𝐶 ∈ ℚ)
7	6	ad2antrr 726	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → 𝐶 ∈ ℚ)
8		qcn 13006	. . . . . . . . . . . 12 ⊢ (𝐶 ∈ ℚ → 𝐶 ∈ ℂ)
9	7, 8	syl 17	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → 𝐶 ∈ ℂ)
10		simp3r 1202	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) → 𝐸 ∈ ℚ)
11	10	ad2antrr 726	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → 𝐸 ∈ ℚ)
12		qcn 13006	. . . . . . . . . . . 12 ⊢ (𝐸 ∈ ℚ → 𝐸 ∈ ℂ)
13	11, 12	syl 17	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → 𝐸 ∈ ℂ)
14	5, 9, 13	subdid 11720	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → (𝐴 · (𝐶 − 𝐸)) = ((𝐴 · 𝐶) − (𝐴 · 𝐸)))
15		qsubcl 13011	. . . . . . . . . . . . 13 ⊢ ((𝐶 ∈ ℚ ∧ 𝐸 ∈ ℚ) → (𝐶 − 𝐸) ∈ ℚ)
16	7, 11, 15	syl2anc 584	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → (𝐶 − 𝐸) ∈ ℚ)
17		qcn 13006	. . . . . . . . . . . 12 ⊢ ((𝐶 − 𝐸) ∈ ℚ → (𝐶 − 𝐸) ∈ ℂ)
18	16, 17	syl 17	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → (𝐶 − 𝐸) ∈ ℂ)
19	18, 5	mulcomd 11283	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → ((𝐶 − 𝐸) · 𝐴) = (𝐴 · (𝐶 − 𝐸)))
20		simplr 768	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸)))
21		simp2l 1199	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) → 𝐵 ∈ ℚ)
22	21	ad2antrr 726	. . . . . . . . . . . . 13 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → 𝐵 ∈ ℚ)
23		qcn 13006	. . . . . . . . . . . . 13 ⊢ (𝐵 ∈ ℚ → 𝐵 ∈ ℂ)
24	22, 23	syl 17	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → 𝐵 ∈ ℂ)
25	5, 9	mulcld 11282	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → (𝐴 · 𝐶) ∈ ℂ)
26		simp3l 1201	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) → 𝐷 ∈ ℚ)
27	26	ad2antrr 726	. . . . . . . . . . . . 13 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → 𝐷 ∈ ℚ)
28		qcn 13006	. . . . . . . . . . . . 13 ⊢ (𝐷 ∈ ℚ → 𝐷 ∈ ℂ)
29	27, 28	syl 17	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → 𝐷 ∈ ℂ)
30	5, 13	mulcld 11282	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → (𝐴 · 𝐸) ∈ ℂ)
31	24, 25, 29, 30	addsubeq4d 11672	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → ((𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸)) ↔ (𝐷 − 𝐵) = ((𝐴 · 𝐶) − (𝐴 · 𝐸))))
32	20, 31	mpbid 232	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → (𝐷 − 𝐵) = ((𝐴 · 𝐶) − (𝐴 · 𝐸)))
33	14, 19, 32	3eqtr4d 2786	. . . . . . . . 9 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → ((𝐶 − 𝐸) · 𝐴) = (𝐷 − 𝐵))
34		qsubcl 13011	. . . . . . . . . . . 12 ⊢ ((𝐷 ∈ ℚ ∧ 𝐵 ∈ ℚ) → (𝐷 − 𝐵) ∈ ℚ)
35	27, 22, 34	syl2anc 584	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → (𝐷 − 𝐵) ∈ ℚ)
36		qcn 13006	. . . . . . . . . . 11 ⊢ ((𝐷 − 𝐵) ∈ ℚ → (𝐷 − 𝐵) ∈ ℂ)
37	35, 36	syl 17	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → (𝐷 − 𝐵) ∈ ℂ)
38		simpr 484	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → ¬ 𝐶 = 𝐸)
39		subeq0 11536	. . . . . . . . . . . . 13 ⊢ ((𝐶 ∈ ℂ ∧ 𝐸 ∈ ℂ) → ((𝐶 − 𝐸) = 0 ↔ 𝐶 = 𝐸))
40	39	necon3abid 2976	. . . . . . . . . . . 12 ⊢ ((𝐶 ∈ ℂ ∧ 𝐸 ∈ ℂ) → ((𝐶 − 𝐸) ≠ 0 ↔ ¬ 𝐶 = 𝐸))
41	9, 13, 40	syl2anc 584	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → ((𝐶 − 𝐸) ≠ 0 ↔ ¬ 𝐶 = 𝐸))
42	38, 41	mpbird 257	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → (𝐶 − 𝐸) ≠ 0)
43	37, 18, 5, 42	divmuld 12066	. . . . . . . . 9 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → (((𝐷 − 𝐵) / (𝐶 − 𝐸)) = 𝐴 ↔ ((𝐶 − 𝐸) · 𝐴) = (𝐷 − 𝐵)))
44	33, 43	mpbird 257	. . . . . . . 8 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → ((𝐷 − 𝐵) / (𝐶 − 𝐸)) = 𝐴)
45		qdivcl 13013	. . . . . . . . 9 ⊢ (((𝐷 − 𝐵) ∈ ℚ ∧ (𝐶 − 𝐸) ∈ ℚ ∧ (𝐶 − 𝐸) ≠ 0) → ((𝐷 − 𝐵) / (𝐶 − 𝐸)) ∈ ℚ)
46	35, 16, 42, 45	syl3anc 1372	. . . . . . . 8 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → ((𝐷 − 𝐵) / (𝐶 − 𝐸)) ∈ ℚ)
47	44, 46	eqeltrrd 2841	. . . . . . 7 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → 𝐴 ∈ ℚ)
48	47	ex 412	. . . . . 6 ⊢ (((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) → (¬ 𝐶 = 𝐸 → 𝐴 ∈ ℚ))
49	3, 48	mt3d 148	. . . . 5 ⊢ (((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) → 𝐶 = 𝐸)
50		simpl2l 1226	. . . . . . . . 9 ⊢ (((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) → 𝐵 ∈ ℚ)
51	50, 23	syl 17	. . . . . . . 8 ⊢ (((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) → 𝐵 ∈ ℂ)
52	51	adantr 480	. . . . . . 7 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ 𝐶 = 𝐸) → 𝐵 ∈ ℂ)
53		simpl3l 1228	. . . . . . . . 9 ⊢ (((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) → 𝐷 ∈ ℚ)
54	53, 28	syl 17	. . . . . . . 8 ⊢ (((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) → 𝐷 ∈ ℂ)
55	54	adantr 480	. . . . . . 7 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ 𝐶 = 𝐸) → 𝐷 ∈ ℂ)
56		simpl1 1191	. . . . . . . . . 10 ⊢ (((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) → 𝐴 ∈ (ℂ ∖ ℚ))
57	56	eldifad 3962	. . . . . . . . 9 ⊢ (((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) → 𝐴 ∈ ℂ)
58		simpl3r 1229	. . . . . . . . . 10 ⊢ (((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) → 𝐸 ∈ ℚ)
59	58, 12	syl 17	. . . . . . . . 9 ⊢ (((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) → 𝐸 ∈ ℂ)
60	57, 59	mulcld 11282	. . . . . . . 8 ⊢ (((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) → (𝐴 · 𝐸) ∈ ℂ)
61	60	adantr 480	. . . . . . 7 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ 𝐶 = 𝐸) → (𝐴 · 𝐸) ∈ ℂ)
62		simpr 484	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ 𝐶 = 𝐸) → 𝐶 = 𝐸)
63	62	eqcomd 2742	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ 𝐶 = 𝐸) → 𝐸 = 𝐶)
64	63	oveq2d 7448	. . . . . . . . 9 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ 𝐶 = 𝐸) → (𝐴 · 𝐸) = (𝐴 · 𝐶))
65	64	oveq2d 7448	. . . . . . . 8 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ 𝐶 = 𝐸) → (𝐵 + (𝐴 · 𝐸)) = (𝐵 + (𝐴 · 𝐶)))
66		simplr 768	. . . . . . . 8 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ 𝐶 = 𝐸) → (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸)))
67	65, 66	eqtrd 2776	. . . . . . 7 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ 𝐶 = 𝐸) → (𝐵 + (𝐴 · 𝐸)) = (𝐷 + (𝐴 · 𝐸)))
68	52, 55, 61, 67	addcan2ad 11468	. . . . . 6 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ 𝐶 = 𝐸) → 𝐵 = 𝐷)
69	68	ex 412	. . . . 5 ⊢ (((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) → (𝐶 = 𝐸 → 𝐵 = 𝐷))
70	49, 69	jcai 516	. . . 4 ⊢ (((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) → (𝐶 = 𝐸 ∧ 𝐵 = 𝐷))
71	70	ancomd 461	. . 3 ⊢ (((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) → (𝐵 = 𝐷 ∧ 𝐶 = 𝐸))
72	71	ex 412	. 2 ⊢ ((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) → ((𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸)) → (𝐵 = 𝐷 ∧ 𝐶 = 𝐸)))
73		id 22	. . 3 ⊢ (𝐵 = 𝐷 → 𝐵 = 𝐷)
74		oveq2 7440	. . 3 ⊢ (𝐶 = 𝐸 → (𝐴 · 𝐶) = (𝐴 · 𝐸))
75	73, 74	oveqan12d 7451	. 2 ⊢ ((𝐵 = 𝐷 ∧ 𝐶 = 𝐸) → (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸)))
76	72, 75	impbid1 225	1 ⊢ ((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) → ((𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸)) ↔ (𝐵 = 𝐷 ∧ 𝐶 = 𝐸)))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1539 ∈ wcel 2107 ≠ wne 2939 ∖ cdif 3947 (class class class)co 7432 ℂcc 11154 0cc0 11156 + caddc 11159 · cmul 11161 − cmin 11493 / cdiv 11921 ℚcq 12991

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1909 ax-6 1966 ax-7 2006 ax-8 2109 ax-9 2117 ax-10 2140 ax-11 2156 ax-12 2176 ax-ext 2707 ax-sep 5295 ax-nul 5305 ax-pow 5364 ax-pr 5431 ax-un 7756 ax-resscn 11213 ax-1cn 11214 ax-icn 11215 ax-addcl 11216 ax-addrcl 11217 ax-mulcl 11218 ax-mulrcl 11219 ax-mulcom 11220 ax-addass 11221 ax-mulass 11222 ax-distr 11223 ax-i2m1 11224 ax-1ne0 11225 ax-1rid 11226 ax-rnegex 11227 ax-rrecex 11228 ax-cnre 11229 ax-pre-lttri 11230 ax-pre-lttrn 11231 ax-pre-ltadd 11232 ax-pre-mulgt0 11233

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1779 df-nf 1783 df-sb 2064 df-mo 2539 df-eu 2568 df-clab 2714 df-cleq 2728 df-clel 2815 df-nfc 2891 df-ne 2940 df-nel 3046 df-ral 3061 df-rex 3070 df-rmo 3379 df-reu 3380 df-rab 3436 df-v 3481 df-sbc 3788 df-csb 3899 df-dif 3953 df-un 3955 df-in 3957 df-ss 3967 df-pss 3970 df-nul 4333 df-if 4525 df-pw 4601 df-sn 4626 df-pr 4628 df-op 4632 df-uni 4907 df-iun 4992 df-br 5143 df-opab 5205 df-mpt 5225 df-tr 5259 df-id 5577 df-eprel 5583 df-po 5591 df-so 5592 df-fr 5636 df-we 5638 df-xp 5690 df-rel 5691 df-cnv 5692 df-co 5693 df-dm 5694 df-rn 5695 df-res 5696 df-ima 5697 df-pred 6320 df-ord 6386 df-on 6387 df-lim 6388 df-suc 6389 df-iota 6513 df-fun 6562 df-fn 6563 df-f 6564 df-f1 6565 df-fo 6566 df-f1o 6567 df-fv 6568 df-riota 7389 df-ov 7435 df-oprab 7436 df-mpo 7437 df-om 7889 df-1st 8015 df-2nd 8016 df-frecs 8307 df-wrecs 8338 df-recs 8412 df-rdg 8451 df-er 8746 df-en 8987 df-dom 8988 df-sdom 8989 df-pnf 11298 df-mnf 11299 df-xr 11300 df-ltxr 11301 df-le 11302 df-sub 11495 df-neg 11496 df-div 11922 df-nn 12268 df-n0 12529 df-z 12616 df-q 12992

This theorem is referenced by: rmxypairf1o 42928 rmxycomplete 42934 rmxyneg 42937 rmxyadd 42938 rmxy1 42939 rmxy0 42940 jm2.22 43012

W3C validator