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 43357

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 4073	. . . . . . . 8 ⊢ (𝐴 ∈ (ℂ ∖ ℚ) → ¬ 𝐴 ∈ ℚ)
2	1	3ad2ant1 1134	. . . . . . 7 ⊢ ((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) → ¬ 𝐴 ∈ ℚ)
3	2	adantr 480	. . . . . 6 ⊢ (((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) → ¬ 𝐴 ∈ ℚ)
4		simpll1 1214	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → 𝐴 ∈ (ℂ ∖ ℚ))
5	4	eldifad 3902	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → 𝐴 ∈ ℂ)
6		simp2r 1202	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) → 𝐶 ∈ ℚ)
7	6	ad2antrr 727	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → 𝐶 ∈ ℚ)
8		qcn 12907	. . . . . . . . . . . 12 ⊢ (𝐶 ∈ ℚ → 𝐶 ∈ ℂ)
9	7, 8	syl 17	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → 𝐶 ∈ ℂ)
10		simp3r 1204	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) → 𝐸 ∈ ℚ)
11	10	ad2antrr 727	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → 𝐸 ∈ ℚ)
12		qcn 12907	. . . . . . . . . . . 12 ⊢ (𝐸 ∈ ℚ → 𝐸 ∈ ℂ)
13	11, 12	syl 17	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → 𝐸 ∈ ℂ)
14	5, 9, 13	subdid 11600	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → (𝐴 · (𝐶 − 𝐸)) = ((𝐴 · 𝐶) − (𝐴 · 𝐸)))
15		qsubcl 12912	. . . . . . . . . . . . 13 ⊢ ((𝐶 ∈ ℚ ∧ 𝐸 ∈ ℚ) → (𝐶 − 𝐸) ∈ ℚ)
16	7, 11, 15	syl2anc 585	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → (𝐶 − 𝐸) ∈ ℚ)
17		qcn 12907	. . . . . . . . . . . 12 ⊢ ((𝐶 − 𝐸) ∈ ℚ → (𝐶 − 𝐸) ∈ ℂ)
18	16, 17	syl 17	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → (𝐶 − 𝐸) ∈ ℂ)
19	18, 5	mulcomd 11160	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → ((𝐶 − 𝐸) · 𝐴) = (𝐴 · (𝐶 − 𝐸)))
20		simplr 769	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸)))
21		simp2l 1201	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) → 𝐵 ∈ ℚ)
22	21	ad2antrr 727	. . . . . . . . . . . . 13 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → 𝐵 ∈ ℚ)
23		qcn 12907	. . . . . . . . . . . . 13 ⊢ (𝐵 ∈ ℚ → 𝐵 ∈ ℂ)
24	22, 23	syl 17	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → 𝐵 ∈ ℂ)
25	5, 9	mulcld 11159	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → (𝐴 · 𝐶) ∈ ℂ)
26		simp3l 1203	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) → 𝐷 ∈ ℚ)
27	26	ad2antrr 727	. . . . . . . . . . . . 13 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → 𝐷 ∈ ℚ)
28		qcn 12907	. . . . . . . . . . . . 13 ⊢ (𝐷 ∈ ℚ → 𝐷 ∈ ℂ)
29	27, 28	syl 17	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → 𝐷 ∈ ℂ)
30	5, 13	mulcld 11159	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → (𝐴 · 𝐸) ∈ ℂ)
31	24, 25, 29, 30	addsubeq4d 11550	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → ((𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸)) ↔ (𝐷 − 𝐵) = ((𝐴 · 𝐶) − (𝐴 · 𝐸))))
32	20, 31	mpbid 232	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → (𝐷 − 𝐵) = ((𝐴 · 𝐶) − (𝐴 · 𝐸)))
33	14, 19, 32	3eqtr4d 2782	. . . . . . . . 9 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → ((𝐶 − 𝐸) · 𝐴) = (𝐷 − 𝐵))
34		qsubcl 12912	. . . . . . . . . . . 12 ⊢ ((𝐷 ∈ ℚ ∧ 𝐵 ∈ ℚ) → (𝐷 − 𝐵) ∈ ℚ)
35	27, 22, 34	syl2anc 585	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → (𝐷 − 𝐵) ∈ ℚ)
36		qcn 12907	. . . . . . . . . . 11 ⊢ ((𝐷 − 𝐵) ∈ ℚ → (𝐷 − 𝐵) ∈ ℂ)
37	35, 36	syl 17	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → (𝐷 − 𝐵) ∈ ℂ)
38		simpr 484	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → ¬ 𝐶 = 𝐸)
39		subeq0 11414	. . . . . . . . . . . . 13 ⊢ ((𝐶 ∈ ℂ ∧ 𝐸 ∈ ℂ) → ((𝐶 − 𝐸) = 0 ↔ 𝐶 = 𝐸))
40	39	necon3abid 2969	. . . . . . . . . . . 12 ⊢ ((𝐶 ∈ ℂ ∧ 𝐸 ∈ ℂ) → ((𝐶 − 𝐸) ≠ 0 ↔ ¬ 𝐶 = 𝐸))
41	9, 13, 40	syl2anc 585	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → ((𝐶 − 𝐸) ≠ 0 ↔ ¬ 𝐶 = 𝐸))
42	38, 41	mpbird 257	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → (𝐶 − 𝐸) ≠ 0)
43	37, 18, 5, 42	divmuld 11947	. . . . . . . . 9 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → (((𝐷 − 𝐵) / (𝐶 − 𝐸)) = 𝐴 ↔ ((𝐶 − 𝐸) · 𝐴) = (𝐷 − 𝐵)))
44	33, 43	mpbird 257	. . . . . . . 8 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → ((𝐷 − 𝐵) / (𝐶 − 𝐸)) = 𝐴)
45		qdivcl 12914	. . . . . . . . 9 ⊢ (((𝐷 − 𝐵) ∈ ℚ ∧ (𝐶 − 𝐸) ∈ ℚ ∧ (𝐶 − 𝐸) ≠ 0) → ((𝐷 − 𝐵) / (𝐶 − 𝐸)) ∈ ℚ)
46	35, 16, 42, 45	syl3anc 1374	. . . . . . . 8 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → ((𝐷 − 𝐵) / (𝐶 − 𝐸)) ∈ ℚ)
47	44, 46	eqeltrrd 2838	. . . . . . 7 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ ¬ 𝐶 = 𝐸) → 𝐴 ∈ ℚ)
48	47	ex 412	. . . . . 6 ⊢ (((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) → (¬ 𝐶 = 𝐸 → 𝐴 ∈ ℚ))
49	3, 48	mt3d 148	. . . . 5 ⊢ (((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) → 𝐶 = 𝐸)
50		simpl2l 1228	. . . . . . . . 9 ⊢ (((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) → 𝐵 ∈ ℚ)
51	50, 23	syl 17	. . . . . . . 8 ⊢ (((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) → 𝐵 ∈ ℂ)
52	51	adantr 480	. . . . . . 7 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ 𝐶 = 𝐸) → 𝐵 ∈ ℂ)
53		simpl3l 1230	. . . . . . . . 9 ⊢ (((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) → 𝐷 ∈ ℚ)
54	53, 28	syl 17	. . . . . . . 8 ⊢ (((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) → 𝐷 ∈ ℂ)
55	54	adantr 480	. . . . . . 7 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ 𝐶 = 𝐸) → 𝐷 ∈ ℂ)
56		simpl1 1193	. . . . . . . . . 10 ⊢ (((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) → 𝐴 ∈ (ℂ ∖ ℚ))
57	56	eldifad 3902	. . . . . . . . 9 ⊢ (((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) → 𝐴 ∈ ℂ)
58		simpl3r 1231	. . . . . . . . . 10 ⊢ (((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) → 𝐸 ∈ ℚ)
59	58, 12	syl 17	. . . . . . . . 9 ⊢ (((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) → 𝐸 ∈ ℂ)
60	57, 59	mulcld 11159	. . . . . . . 8 ⊢ (((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) → (𝐴 · 𝐸) ∈ ℂ)
61	60	adantr 480	. . . . . . 7 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ 𝐶 = 𝐸) → (𝐴 · 𝐸) ∈ ℂ)
62		simpr 484	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ 𝐶 = 𝐸) → 𝐶 = 𝐸)
63	62	eqcomd 2743	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ 𝐶 = 𝐸) → 𝐸 = 𝐶)
64	63	oveq2d 7377	. . . . . . . . 9 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ 𝐶 = 𝐸) → (𝐴 · 𝐸) = (𝐴 · 𝐶))
65	64	oveq2d 7377	. . . . . . . 8 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ 𝐶 = 𝐸) → (𝐵 + (𝐴 · 𝐸)) = (𝐵 + (𝐴 · 𝐶)))
66		simplr 769	. . . . . . . 8 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ 𝐶 = 𝐸) → (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸)))
67	65, 66	eqtrd 2772	. . . . . . 7 ⊢ ((((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) ∧ (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸))) ∧ 𝐶 = 𝐸) → (𝐵 + (𝐴 · 𝐸)) = (𝐷 + (𝐴 · 𝐸)))
68	52, 55, 61, 67	addcan2ad 11346	. . . . . 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 7369	. . 3 ⊢ (𝐶 = 𝐸 → (𝐴 · 𝐶) = (𝐴 · 𝐸))
75	73, 74	oveqan12d 7380	. 2 ⊢ ((𝐵 = 𝐷 ∧ 𝐶 = 𝐸) → (𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸)))
76	72, 75	impbid1 225	1 ⊢ ((𝐴 ∈ (ℂ ∖ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐶 ∈ ℚ) ∧ (𝐷 ∈ ℚ ∧ 𝐸 ∈ ℚ)) → ((𝐵 + (𝐴 · 𝐶)) = (𝐷 + (𝐴 · 𝐸)) ↔ (𝐵 = 𝐷 ∧ 𝐶 = 𝐸)))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ≠ wne 2933 ∖ cdif 3887 (class class class)co 7361 ℂcc 11030 0cc0 11032 + caddc 11035 · cmul 11037 − cmin 11371 / cdiv 11801 ℚcq 12892

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 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5232 ax-nul 5242 ax-pow 5303 ax-pr 5371 ax-un 7683 ax-resscn 11089 ax-1cn 11090 ax-icn 11091 ax-addcl 11092 ax-addrcl 11093 ax-mulcl 11094 ax-mulrcl 11095 ax-mulcom 11096 ax-addass 11097 ax-mulass 11098 ax-distr 11099 ax-i2m1 11100 ax-1ne0 11101 ax-1rid 11102 ax-rnegex 11103 ax-rrecex 11104 ax-cnre 11105 ax-pre-lttri 11106 ax-pre-lttrn 11107 ax-pre-ltadd 11108 ax-pre-mulgt0 11109

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6260 df-ord 6321 df-on 6322 df-lim 6323 df-suc 6324 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-riota 7318 df-ov 7364 df-oprab 7365 df-mpo 7366 df-om 7812 df-1st 7936 df-2nd 7937 df-frecs 8225 df-wrecs 8256 df-recs 8305 df-rdg 8343 df-er 8637 df-en 8888 df-dom 8889 df-sdom 8890 df-pnf 11175 df-mnf 11176 df-xr 11177 df-ltxr 11178 df-le 11179 df-sub 11373 df-neg 11374 df-div 11802 df-nn 12169 df-n0 12432 df-z 12519 df-q 12893

This theorem is referenced by: rmxypairf1o 43360 rmxycomplete 43366 rmxyneg 43369 rmxyadd 43370 rmxy1 43371 rmxy0 43372 jm2.22 43444

W3C validator