Theorem i2linesi 48289

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 11574	. 2 ⊢ (𝐴 − 𝐶) ∈ ℂ
4		i2linesi.5	. 2 ⊢ 𝑋 ∈ ℂ
5		i2linesi.8	. 2 ⊢ (𝐴 − 𝐶) ≠ 0
6	2, 4	mulcli 11259	. . . 4 ⊢ (𝐶 · 𝑋) ∈ ℂ
7		i2linesi.4	. . . . 5 ⊢ 𝐷 ∈ ℂ
8		i2linesi.2	. . . . 5 ⊢ 𝐵 ∈ ℂ
9	7, 8	subcli 11574	. . . 4 ⊢ (𝐷 − 𝐵) ∈ ℂ
10	1, 4	mulcli 11259	. . . . . 6 ⊢ (𝐴 · 𝑋) ∈ ℂ
11		i2linesi.6	. . . . . . 7 ⊢ 𝑌 = ((𝐴 · 𝑋) + 𝐵)
12		i2linesi.7	. . . . . . 7 ⊢ 𝑌 = ((𝐶 · 𝑋) + 𝐷)
13	11, 12	eqtr3i 2758	. . . . . 6 ⊢ ((𝐴 · 𝑋) + 𝐵) = ((𝐶 · 𝑋) + 𝐷)
14	10, 8, 13	mvlraddi 48281	. . . . 5 ⊢ (𝐴 · 𝑋) = (((𝐶 · 𝑋) + 𝐷) − 𝐵)
15	6, 7, 8, 14	assraddsubi 48283	. . . 4 ⊢ (𝐴 · 𝑋) = ((𝐶 · 𝑋) + (𝐷 − 𝐵))
16	6, 9, 15	mvrladdi 48282	. . 3 ⊢ ((𝐴 · 𝑋) − (𝐶 · 𝑋)) = (𝐷 − 𝐵)
17	1, 4, 2, 16	joinlmulsubmuli 48286	. 2 ⊢ ((𝐴 − 𝐶) · 𝑋) = (𝐷 − 𝐵)
18	3, 4, 5, 17	mvllmuli 12085	1 ⊢ 𝑋 = ((𝐷 − 𝐵) / (𝐴 − 𝐶))

Syntax hints:   = wceq 1533   ∈ wcel 2098   ≠ wne 2937  (class class class)co 7426  ℂcc 11144  0cc0 11146   + caddc 11149   · cmul 11151   − cmin 11482   / cdiv 11909

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2166  ax-ext 2699  ax-sep 5303  ax-nul 5310  ax-pow 5369  ax-pr 5433  ax-un 7746  ax-resscn 11203  ax-1cn 11204  ax-icn 11205  ax-addcl 11206  ax-addrcl 11207  ax-mulcl 11208  ax-mulrcl 11209  ax-mulcom 11210  ax-addass 11211  ax-mulass 11212  ax-distr 11213  ax-i2m1 11214  ax-1ne0 11215  ax-1rid 11216  ax-rnegex 11217  ax-rrecex 11218  ax-cnre 11219  ax-pre-lttri 11220  ax-pre-lttrn 11221  ax-pre-ltadd 11222  ax-pre-mulgt0 11223

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3or 1085  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2529  df-eu 2558  df-clab 2706  df-cleq 2720  df-clel 2806  df-nfc 2881  df-ne 2938  df-nel 3044  df-ral 3059  df-rex 3068  df-rmo 3374  df-reu 3375  df-rab 3431  df-v 3475  df-sbc 3779  df-csb 3895  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-nul 4327  df-if 4533  df-pw 4608  df-sn 4633  df-pr 4635  df-op 4639  df-uni 4913  df-br 5153  df-opab 5215  df-mpt 5236  df-id 5580  df-po 5594  df-so 5595  df-xp 5688  df-rel 5689  df-cnv 5690  df-co 5691  df-dm 5692  df-rn 5693  df-res 5694  df-ima 5695  df-iota 6505  df-fun 6555  df-fn 6556  df-f 6557  df-f1 6558  df-fo 6559  df-f1o 6560  df-fv 6561  df-riota 7382  df-ov 7429  df-oprab 7430  df-mpo 7431  df-er 8731  df-en 8971  df-dom 8972  df-sdom 8973  df-pnf 11288  df-mnf 11289  df-xr 11290  df-ltxr 11291  df-le 11292  df-sub 11484  df-neg 11485  df-div 11910

This theorem is referenced by: (None)