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 40730

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 4062	. . . . . . . 8 ⊢ (𝐴 ∈ (ℂ ∖ ℚ) → ¬ 𝐴 ∈ ℚ)
2	1	3ad2ant1 1132	. . . . . . 7 ⊢ ((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) → ¬ 𝐴 ∈ ℚ)
3	2	adantr 481	. . . . . 6 ⊢ (((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) → ¬ 𝐴 ∈ ℚ)
4		simpll1 1211	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → 𝐴 ∈ (ℂ ∖ ℚ))
5	4	eldifad 3899	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → 𝐴 ∈ ℂ)
6		simp2r 1199	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) → 𝐶 ∈ ℚ)
7	6	ad2antrr 723	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → 𝐶 ∈ ℚ)
8		qcn 12703	. . . . . . . . . . . 12 ⊢ (𝐶 ∈ ℚ → 𝐶 ∈ ℂ)
9	7, 8	syl 17	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → 𝐶 ∈ ℂ)
10		simp3r 1201	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) → 𝐸 ∈ ℚ)
11	10	ad2antrr 723	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → 𝐸 ∈ ℚ)
12		qcn 12703	. . . . . . . . . . . 12 ⊢ (𝐸 ∈ ℚ → 𝐸 ∈ ℂ)
13	11, 12	syl 17	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → 𝐸 ∈ ℂ)
14	5, 9, 13	subdid 11431	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → (𝐴 · (𝐶 − 𝐸)) = ((𝐴 · 𝐶) − (𝐴 · 𝐸)))
15		qsubcl 12708	. . . . . . . . . . . . 13 ⊢ ((𝐶 ∈ ℚ ∧ 𝐸 ∈ ℚ) → (𝐶 − 𝐸) ∈ ℚ)
16	7, 11, 15	syl2anc 584	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → (𝐶 − 𝐸) ∈ ℚ)
17		qcn 12703	. . . . . . . . . . . 12 ⊢ ((𝐶 − 𝐸) ∈ ℚ → (𝐶 − 𝐸) ∈ ℂ)
18	16, 17	syl 17	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → (𝐶 − 𝐸) ∈ ℂ)
19	18, 5	mulcomd 10996	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → ((𝐶 − 𝐸) · 𝐴) = (𝐴 · (𝐶 − 𝐸)))
20		simplr 766	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸)))
21		simp2l 1198	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) → 𝐵 ∈ ℚ)
22	21	ad2antrr 723	. . . . . . . . . . . . 13 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → 𝐵 ∈ ℚ)
23		qcn 12703	. . . . . . . . . . . . 13 ⊢ (𝐵 ∈ ℚ → 𝐵 ∈ ℂ)
24	22, 23	syl 17	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → 𝐵 ∈ ℂ)
25	5, 9	mulcld 10995	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → (𝐴 · 𝐶) ∈ ℂ)
26		simp3l 1200	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) → 𝐷 ∈ ℚ)
27	26	ad2antrr 723	. . . . . . . . . . . . 13 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → 𝐷 ∈ ℚ)
28		qcn 12703	. . . . . . . . . . . . 13 ⊢ (𝐷 ∈ ℚ → 𝐷 ∈ ℂ)
29	27, 28	syl 17	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → 𝐷 ∈ ℂ)
30	5, 13	mulcld 10995	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → (𝐴 · 𝐸) ∈ ℂ)
31	24, 25, 29, 30	addsubeq4d 11383	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → ((𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸)) ↔ (𝐷 − 𝐵) = ((𝐴 · 𝐶) − (𝐴 · 𝐸))))
32	20, 31	mpbid 231	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → (𝐷 − 𝐵) = ((𝐴 · 𝐶) − (𝐴 · 𝐸)))
33	14, 19, 32	3eqtr4d 2788	. . . . . . . . 9 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → ((𝐶 − 𝐸) · 𝐴) = (𝐷 − 𝐵))
34		qsubcl 12708	. . . . . . . . . . . 12 ⊢ ((𝐷 ∈ ℚ ∧ 𝐵 ∈ ℚ) → (𝐷 − 𝐵) ∈ ℚ)
35	27, 22, 34	syl2anc 584	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → (𝐷 − 𝐵) ∈ ℚ)
36		qcn 12703	. . . . . . . . . . 11 ⊢ ((𝐷 − 𝐵) ∈ ℚ → (𝐷 − 𝐵) ∈ ℂ)
37	35, 36	syl 17	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → (𝐷 − 𝐵) ∈ ℂ)
38		simpr 485	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → ¬ 𝐶 = 𝐸)
39		subeq0 11247	. . . . . . . . . . . . 13 ⊢ ((𝐶 ∈ ℂ ∧ 𝐸 ∈ ℂ) → ((𝐶 − 𝐸) = 0 ↔ 𝐶 = 𝐸))
40	39	necon3abid 2980	. . . . . . . . . . . 12 ⊢ ((𝐶 ∈ ℂ ∧ 𝐸 ∈ ℂ) → ((𝐶 − 𝐸) ≠ 0 ↔ ¬ 𝐶 = 𝐸))
41	9, 13, 40	syl2anc 584	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → ((𝐶 − 𝐸) ≠ 0 ↔ ¬ 𝐶 = 𝐸))
42	38, 41	mpbird 256	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → (𝐶 − 𝐸) ≠ 0)
43	37, 18, 5, 42	divmuld 11773	. . . . . . . . 9 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → (((𝐷 − 𝐵) / (𝐶 − 𝐸)) = 𝐴 ↔ ((𝐶 − 𝐸) · 𝐴) = (𝐷 − 𝐵)))
44	33, 43	mpbird 256	. . . . . . . 8 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → ((𝐷 − 𝐵) / (𝐶 − 𝐸)) = 𝐴)
45		qdivcl 12710	. . . . . . . . 9 ⊢ (((𝐷 − 𝐵) ∈ ℚ ∧ (𝐶 − 𝐸) ∈ ℚ ∧ (𝐶 − 𝐸) ≠ 0) → ((𝐷 − 𝐵) / (𝐶 − 𝐸)) ∈ ℚ)
46	35, 16, 42, 45	syl3anc 1370	. . . . . . . 8 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → ((𝐷 − 𝐵) / (𝐶 − 𝐸)) ∈ ℚ)
47	44, 46	eqeltrrd 2840	. . . . . . 7 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → 𝐴 ∈ ℚ)
48	47	ex 413	. . . . . 6 ⊢ (((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) → (¬ 𝐶 = 𝐸 → 𝐴 ∈ ℚ))
49	3, 48	mt3d 148	. . . . 5 ⊢ (((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) → 𝐶 = 𝐸)
50		simpl2l 1225	. . . . . . . . 9 ⊢ (((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) → 𝐵 ∈ ℚ)
51	50, 23	syl 17	. . . . . . . 8 ⊢ (((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) → 𝐵 ∈ ℂ)
52	51	adantr 481	. . . . . . 7 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ 𝐶 = 𝐸) → 𝐵 ∈ ℂ)
53		simpl3l 1227	. . . . . . . . 9 ⊢ (((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) → 𝐷 ∈ ℚ)
54	53, 28	syl 17	. . . . . . . 8 ⊢ (((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) → 𝐷 ∈ ℂ)
55	54	adantr 481	. . . . . . 7 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ 𝐶 = 𝐸) → 𝐷 ∈ ℂ)
56		simpl1 1190	. . . . . . . . . 10 ⊢ (((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) → 𝐴 ∈ (ℂ ∖ ℚ))
57	56	eldifad 3899	. . . . . . . . 9 ⊢ (((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) → 𝐴 ∈ ℂ)
58		simpl3r 1228	. . . . . . . . . 10 ⊢ (((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) → 𝐸 ∈ ℚ)
59	58, 12	syl 17	. . . . . . . . 9 ⊢ (((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) → 𝐸 ∈ ℂ)
60	57, 59	mulcld 10995	. . . . . . . 8 ⊢ (((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) → (𝐴 · 𝐸) ∈ ℂ)
61	60	adantr 481	. . . . . . 7 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ 𝐶 = 𝐸) → (𝐴 · 𝐸) ∈ ℂ)
62		simpr 485	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ 𝐶 = 𝐸) → 𝐶 = 𝐸)
63	62	eqcomd 2744	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ 𝐶 = 𝐸) → 𝐸 = 𝐶)
64	63	oveq2d 7291	. . . . . . . . 9 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ 𝐶 = 𝐸) → (𝐴 · 𝐸) = (𝐴 · 𝐶))
65	64	oveq2d 7291	. . . . . . . 8 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ 𝐶 = 𝐸) → (𝐵 + (𝐴 · 𝐸)) = (𝐵 + (𝐴 · 𝐶)))
66		simplr 766	. . . . . . . 8 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ 𝐶 = 𝐸) → (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸)))
67	65, 66	eqtrd 2778	. . . . . . 7 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ 𝐶 = 𝐸) → (𝐵 + (𝐴 · 𝐸)) = (𝐷 + (𝐴 · 𝐸)))
68	52, 55, 61, 67	addcan2ad 11181	. . . . . 6 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ 𝐶 = 𝐸) → 𝐵 = 𝐷)
69	68	ex 413	. . . . 5 ⊢ (((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) → (𝐶 = 𝐸 → 𝐵 = 𝐷))
70	49, 69	jcai 517	. . . 4 ⊢ (((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) → (𝐶 = 𝐸 ∧ 𝐵 = 𝐷))
71	70	ancomd 462	. . 3 ⊢ (((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) → (𝐵 = 𝐷 ∧ 𝐶 = 𝐸))
72	71	ex 413	. 2 ⊢ ((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) → ((𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸)) → (𝐵 = 𝐷 ∧ 𝐶 = 𝐸)))
73		id 22	. . 3 ⊢ (𝐵 = 𝐷 → 𝐵 = 𝐷)
74		oveq2 7283	. . 3 ⊢ (𝐶 = 𝐸 → (𝐴 · 𝐶) = (𝐴 · 𝐸))
75	73, 74	oveqan12d 7294	. 2 ⊢ ((𝐵 = 𝐷 ∧ 𝐶 = 𝐸) → (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸)))
76	72, 75	impbid1 224	1 ⊢ ((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) → ((𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸)) ↔ (𝐵 = 𝐷 ∧ 𝐶 = 𝐸)))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 396 ∧ w3a 1086 = wceq 1539 ∈ wcel 2106 ≠ wne 2943 ∖ cdif 3884 (class class class)co 7275 ℂcc 10869 0cc0 10871 + caddc 10874 · cmul 10876 − cmin 11205 / cdiv 11632 ℚcq 12688

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 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 2709 ax-sep 5223 ax-nul 5230 ax-pow 5288 ax-pr 5352 ax-un 7588 ax-resscn 10928 ax-1cn 10929 ax-icn 10930 ax-addcl 10931 ax-addrcl 10932 ax-mulcl 10933 ax-mulrcl 10934 ax-mulcom 10935 ax-addass 10936 ax-mulass 10937 ax-distr 10938 ax-i2m1 10939 ax-1ne0 10940 ax-1rid 10941 ax-rnegex 10942 ax-rrecex 10943 ax-cnre 10944 ax-pre-lttri 10945 ax-pre-lttrn 10946 ax-pre-ltadd 10947 ax-pre-mulgt0 10948

This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-nel 3050 df-ral 3069 df-rex 3070 df-rmo 3071 df-reu 3072 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-pss 3906 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-iun 4926 df-br 5075 df-opab 5137 df-mpt 5158 df-tr 5192 df-id 5489 df-eprel 5495 df-po 5503 df-so 5504 df-fr 5544 df-we 5546 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-pred 6202 df-ord 6269 df-on 6270 df-lim 6271 df-suc 6272 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-f1 6438 df-fo 6439 df-f1o 6440 df-fv 6441 df-riota 7232 df-ov 7278 df-oprab 7279 df-mpo 7280 df-om 7713 df-1st 7831 df-2nd 7832 df-frecs 8097 df-wrecs 8128 df-recs 8202 df-rdg 8241 df-er 8498 df-en 8734 df-dom 8735 df-sdom 8736 df-pnf 11011 df-mnf 11012 df-xr 11013 df-ltxr 11014 df-le 11015 df-sub 11207 df-neg 11208 df-div 11633 df-nn 11974 df-n0 12234 df-z 12320 df-q 12689

This theorem is referenced by: rmxypairf1o 40733 rmxycomplete 40739 rmxyneg 40742 rmxyadd 40743 rmxy1 40744 rmxy0 40745 jm2.22 40817

W3C validator