Theorem i2linesi 49644

Description: Solve for the intersection of two lines expressed in Y = MX+B form (note that the lines cannot be vertical). Here we use inference form. We just solve for X, since Y can be trivially found by using X. This is an example of how to use the algebra helpers. Notice that because this proof uses algebra helpers, the main steps of the proof are higher level and easier to follow by a human reader. (Contributed by David A. Wheeler, 11-Oct-2018.)

Hypotheses

Ref	Expression
i2linesi.1	⊢ 𝐴 ∈ ℂ
i2linesi.2	⊢ 𝐵 ∈ ℂ
i2linesi.3	⊢ 𝐶 ∈ ℂ
i2linesi.4	⊢ 𝐷 ∈ ℂ
i2linesi.5	⊢ 𝑋 ∈ ℂ
i2linesi.6	⊢ 𝑌 = ((𝐴 · 𝑋) + 𝐵)
i2linesi.7	⊢ 𝑌 = ((𝐶 · 𝑋) + 𝐷)
i2linesi.8	⊢ (𝐴 − 𝐶) ≠ 0

Assertion

Ref	Expression
i2linesi	⊢ 𝑋 = ((𝐷 − 𝐵) / (𝐴 − 𝐶))

Proof of Theorem i2linesi

Step	Hyp	Ref	Expression
1		i2linesi.1	. . 3 ⊢ 𝐴 ∈ ℂ
2		i2linesi.3	. . 3 ⊢ 𝐶 ∈ ℂ
3	1, 2	subcli 11516	. 2 ⊢ (𝐴 − 𝐶) ∈ ℂ
4		i2linesi.5	. 2 ⊢ 𝑋 ∈ ℂ
5		i2linesi.8	. 2 ⊢ (𝐴 − 𝐶) ≠ 0
6	2, 4	mulcli 11199	. . . 4 ⊢ (𝐶 · 𝑋) ∈ ℂ
7		i2linesi.4	. . . . 5 ⊢ 𝐷 ∈ ℂ
8		i2linesi.2	. . . . 5 ⊢ 𝐵 ∈ ℂ
9	7, 8	subcli 11516	. . . 4 ⊢ (𝐷 − 𝐵) ∈ ℂ
10	1, 4	mulcli 11199	. . . . . 6 ⊢ (𝐴 · 𝑋) ∈ ℂ
11		i2linesi.6	. . . . . . 7 ⊢ 𝑌 = ((𝐴 · 𝑋) + 𝐵)
12		i2linesi.7	. . . . . . 7 ⊢ 𝑌 = ((𝐶 · 𝑋) + 𝐷)
13	11, 12	eqtr3i 2755	. . . . . 6 ⊢ ((𝐴 · 𝑋) + 𝐵) = ((𝐶 · 𝑋) + 𝐷)
14	10, 8, 13	mvlraddi 49637	. . . . 5 ⊢ (𝐴 · 𝑋) = (((𝐶 · 𝑋) + 𝐷) − 𝐵)
15	6, 7, 8, 14	assraddsubi 49638	. . . 4 ⊢ (𝐴 · 𝑋) = ((𝐶 · 𝑋) + (𝐷 − 𝐵))
16	6, 9, 15	mvrladdi 11457	. . 3 ⊢ ((𝐴 · 𝑋) − (𝐶 · 𝑋)) = (𝐷 − 𝐵)
17	1, 4, 2, 16	joinlmulsubmuli 49641	. 2 ⊢ ((𝐴 − 𝐶) · 𝑋) = (𝐷 − 𝐵)
18	3, 4, 5, 17	mvllmuli 12031	1 ⊢ 𝑋 = ((𝐷 − 𝐵) / (𝐴 − 𝐶))

Syntax hints:   = wceq 1540   ∈ wcel 2109   ≠ wne 2927  (class class class)co 7394  ℂcc 11084  0cc0 11086   + caddc 11089   · cmul 11091   − cmin 11423   / cdiv 11851

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2702  ax-sep 5259  ax-nul 5269  ax-pow 5328  ax-pr 5395  ax-un 7718  ax-resscn 11143  ax-1cn 11144  ax-icn 11145  ax-addcl 11146  ax-addrcl 11147  ax-mulcl 11148  ax-mulrcl 11149  ax-mulcom 11150  ax-addass 11151  ax-mulass 11152  ax-distr 11153  ax-i2m1 11154  ax-1ne0 11155  ax-1rid 11156  ax-rnegex 11157  ax-rrecex 11158  ax-cnre 11159  ax-pre-lttri 11160  ax-pre-lttrn 11161  ax-pre-ltadd 11162  ax-pre-mulgt0 11163

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2880  df-ne 2928  df-nel 3032  df-ral 3047  df-rex 3056  df-rmo 3357  df-reu 3358  df-rab 3412  df-v 3457  df-sbc 3762  df-csb 3871  df-dif 3925  df-un 3927  df-in 3929  df-ss 3939  df-nul 4305  df-if 4497  df-pw 4573  df-sn 4598  df-pr 4600  df-op 4604  df-uni 4880  df-br 5116  df-opab 5178  df-mpt 5197  df-id 5541  df-po 5554  df-so 5555  df-xp 5652  df-rel 5653  df-cnv 5654  df-co 5655  df-dm 5656  df-rn 5657  df-res 5658  df-ima 5659  df-iota 6472  df-fun 6521  df-fn 6522  df-f 6523  df-f1 6524  df-fo 6525  df-f1o 6526  df-fv 6527  df-riota 7351  df-ov 7397  df-oprab 7398  df-mpo 7399  df-er 8682  df-en 8923  df-dom 8924  df-sdom 8925  df-pnf 11228  df-mnf 11229  df-xr 11230  df-ltxr 11231  df-le 11232  df-sub 11425  df-neg 11426  df-div 11852

This theorem is referenced by: (None)