Theorem addcmpblnr 11181

Description: Lemma showing compatibility of addition. (Contributed by NM, 3-Sep-1995.) (New usage is discouraged.)

Assertion

Ref	Expression
addcmpblnr	⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝐶 ∈ P ∧ 𝐷 ∈ P)) ∧ ((𝐹 ∈ P ∧ 𝐺 ∈ P) ∧ (𝑅 ∈ P ∧ 𝑆 ∈ P))) → (((𝐴 +P 𝐷) = (𝐵 +P 𝐶) ∧ (𝐹 +P 𝑆) = (𝐺 +P 𝑅)) → ⟨(𝐴 +P 𝐹), (𝐵 +P 𝐺)⟩ ~R ⟨(𝐶 +P 𝑅), (𝐷 +P 𝑆)⟩))

Proof of Theorem addcmpblnr

Step	Hyp	Ref	Expression
1		oveq12 7452	. 2 ⊢ (((𝐴 +P 𝐷) = (𝐵 +P 𝐶) ∧ (𝐹 +P 𝑆) = (𝐺 +P 𝑅)) → ((𝐴 +P 𝐷) +P (𝐹 +P 𝑆)) = ((𝐵 +P 𝐶) +P (𝐺 +P 𝑅)))
2		addclpr 11130	. . . . . . . 8 ⊢ ((𝐴 ∈ P ∧ 𝐹 ∈ P) → (𝐴 +P 𝐹) ∈ P)
3		addclpr 11130	. . . . . . . 8 ⊢ ((𝐵 ∈ P ∧ 𝐺 ∈ P) → (𝐵 +P 𝐺) ∈ P)
4	2, 3	anim12i 625	. . . . . . 7 ⊢ (((𝐴 ∈ P ∧ 𝐹 ∈ P) ∧ (𝐵 ∈ P ∧ 𝐺 ∈ P)) → ((𝐴 +P 𝐹) ∈ P ∧ (𝐵 +P 𝐺) ∈ P))
5	4	an4s 673	. . . . . 6 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝐹 ∈ P ∧ 𝐺 ∈ P)) → ((𝐴 +P 𝐹) ∈ P ∧ (𝐵 +P 𝐺) ∈ P))
6		addclpr 11130	. . . . . . . 8 ⊢ ((𝐶 ∈ P ∧ 𝑅 ∈ P) → (𝐶 +P 𝑅) ∈ P)
7		addclpr 11130	. . . . . . . 8 ⊢ ((𝐷 ∈ P ∧ 𝑆 ∈ P) → (𝐷 +P 𝑆) ∈ P)
8	6, 7	anim12i 625	. . . . . . 7 ⊢ (((𝐶 ∈ P ∧ 𝑅 ∈ P) ∧ (𝐷 ∈ P ∧ 𝑆 ∈ P)) → ((𝐶 +P 𝑅) ∈ P ∧ (𝐷 +P 𝑆) ∈ P))
9	8	an4s 673	. . . . . 6 ⊢ (((𝐶 ∈ P ∧ 𝐷 ∈ P) ∧ (𝑅 ∈ P ∧ 𝑆 ∈ P)) → ((𝐶 +P 𝑅) ∈ P ∧ (𝐷 +P 𝑆) ∈ P))
10	5, 9	anim12i 625	. . . . 5 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝐹 ∈ P ∧ 𝐺 ∈ P)) ∧ ((𝐶 ∈ P ∧ 𝐷 ∈ P) ∧ (𝑅 ∈ P ∧ 𝑆 ∈ P))) → (((𝐴 +P 𝐹) ∈ P ∧ (𝐵 +P 𝐺) ∈ P) ∧ ((𝐶 +P 𝑅) ∈ P ∧ (𝐷 +P 𝑆) ∈ P)))
11	10	an4s 673	. . . 4 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝐶 ∈ P ∧ 𝐷 ∈ P)) ∧ ((𝐹 ∈ P ∧ 𝐺 ∈ P) ∧ (𝑅 ∈ P ∧ 𝑆 ∈ P))) → (((𝐴 +P 𝐹) ∈ P ∧ (𝐵 +P 𝐺) ∈ P) ∧ ((𝐶 +P 𝑅) ∈ P ∧ (𝐷 +P 𝑆) ∈ P)))
12		enrbreq 11177	. . . 4 ⊢ ((((𝐴 +P 𝐹) ∈ P ∧ (𝐵 +P 𝐺) ∈ P) ∧ ((𝐶 +P 𝑅) ∈ P ∧ (𝐷 +P 𝑆) ∈ P)) → (⟨(𝐴 +P 𝐹), (𝐵 +P 𝐺)⟩ ~R ⟨(𝐶 +P 𝑅), (𝐷 +P 𝑆)⟩ ↔ ((𝐴 +P 𝐹) +P (𝐷 +P 𝑆)) = ((𝐵 +P 𝐺) +P (𝐶 +P 𝑅))))
13	11, 12	syl 18	. . 3 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝐶 ∈ P ∧ 𝐷 ∈ P)) ∧ ((𝐹 ∈ P ∧ 𝐺 ∈ P) ∧ (𝑅 ∈ P ∧ 𝑆 ∈ P))) → (⟨(𝐴 +P 𝐹), (𝐵 +P 𝐺)⟩ ~R ⟨(𝐶 +P 𝑅), (𝐷 +P 𝑆)⟩ ↔ ((𝐴 +P 𝐹) +P (𝐷 +P 𝑆)) = ((𝐵 +P 𝐺) +P (𝐶 +P 𝑅))))
14		addcompr 11133	. . . . . . . 8 ⊢ (𝐹 +P 𝐷) = (𝐷 +P 𝐹)
15	14	oveq1i 7453	. . . . . . 7 ⊢ ((𝐹 +P 𝐷) +P 𝑆) = ((𝐷 +P 𝐹) +P 𝑆)
16		addasspr 11134	. . . . . . 7 ⊢ ((𝐹 +P 𝐷) +P 𝑆) = (𝐹 +P (𝐷 +P 𝑆))
17		addasspr 11134	. . . . . . 7 ⊢ ((𝐷 +P 𝐹) +P 𝑆) = (𝐷 +P (𝐹 +P 𝑆))
18	15, 16, 17	3eqtr3i 2794	. . . . . 6 ⊢ (𝐹 +P (𝐷 +P 𝑆)) = (𝐷 +P (𝐹 +P 𝑆))
19	18	oveq2i 7454	. . . . 5 ⊢ (𝐴 +P (𝐹 +P (𝐷 +P 𝑆))) = (𝐴 +P (𝐷 +P (𝐹 +P 𝑆)))
20		addasspr 11134	. . . . 5 ⊢ ((𝐴 +P 𝐹) +P (𝐷 +P 𝑆)) = (𝐴 +P (𝐹 +P (𝐷 +P 𝑆)))
21		addasspr 11134	. . . . 5 ⊢ ((𝐴 +P 𝐷) +P (𝐹 +P 𝑆)) = (𝐴 +P (𝐷 +P (𝐹 +P 𝑆)))
22	19, 20, 21	3eqtr4i 2796	. . . 4 ⊢ ((𝐴 +P 𝐹) +P (𝐷 +P 𝑆)) = ((𝐴 +P 𝐷) +P (𝐹 +P 𝑆))
23		addcompr 11133	. . . . . . . 8 ⊢ (𝐺 +P 𝐶) = (𝐶 +P 𝐺)
24	23	oveq1i 7453	. . . . . . 7 ⊢ ((𝐺 +P 𝐶) +P 𝑅) = ((𝐶 +P 𝐺) +P 𝑅)
25		addasspr 11134	. . . . . . 7 ⊢ ((𝐺 +P 𝐶) +P 𝑅) = (𝐺 +P (𝐶 +P 𝑅))
26		addasspr 11134	. . . . . . 7 ⊢ ((𝐶 +P 𝐺) +P 𝑅) = (𝐶 +P (𝐺 +P 𝑅))
27	24, 25, 26	3eqtr3i 2794	. . . . . 6 ⊢ (𝐺 +P (𝐶 +P 𝑅)) = (𝐶 +P (𝐺 +P 𝑅))
28	27	oveq2i 7454	. . . . 5 ⊢ (𝐵 +P (𝐺 +P (𝐶 +P 𝑅))) = (𝐵 +P (𝐶 +P (𝐺 +P 𝑅)))
29		addasspr 11134	. . . . 5 ⊢ ((𝐵 +P 𝐺) +P (𝐶 +P 𝑅)) = (𝐵 +P (𝐺 +P (𝐶 +P 𝑅)))
30		addasspr 11134	. . . . 5 ⊢ ((𝐵 +P 𝐶) +P (𝐺 +P 𝑅)) = (𝐵 +P (𝐶 +P (𝐺 +P 𝑅)))
31	28, 29, 30	3eqtr4i 2796	. . . 4 ⊢ ((𝐵 +P 𝐺) +P (𝐶 +P 𝑅)) = ((𝐵 +P 𝐶) +P (𝐺 +P 𝑅))
32	22, 31	eqeq12i 2781	. . 3 ⊢ (((𝐴 +P 𝐹) +P (𝐷 +P 𝑆)) = ((𝐵 +P 𝐺) +P (𝐶 +P 𝑅)) ↔ ((𝐴 +P 𝐷) +P (𝐹 +P 𝑆)) = ((𝐵 +P 𝐶) +P (𝐺 +P 𝑅)))
33	13, 32	bitrdi 290	. 2 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝐶 ∈ P ∧ 𝐷 ∈ P)) ∧ ((𝐹 ∈ P ∧ 𝐺 ∈ P) ∧ (𝑅 ∈ P ∧ 𝑆 ∈ P))) → (⟨(𝐴 +P 𝐹), (𝐵 +P 𝐺)⟩ ~R ⟨(𝐶 +P 𝑅), (𝐷 +P 𝑆)⟩ ↔ ((𝐴 +P 𝐷) +P (𝐹 +P 𝑆)) = ((𝐵 +P 𝐶) +P (𝐺 +P 𝑅))))
34	1, 33	imbitrrid 249	1 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝐶 ∈ P ∧ 𝐷 ∈ P)) ∧ ((𝐹 ∈ P ∧ 𝐺 ∈ P) ∧ (𝑅 ∈ P ∧ 𝑆 ∈ P))) → (((𝐴 +P 𝐷) = (𝐵 +P 𝐶) ∧ (𝐹 +P 𝑆) = (𝐺 +P 𝑅)) → ⟨(𝐴 +P 𝐹), (𝐵 +P 𝐺)⟩ ~R ⟨(𝐶 +P 𝑅), (𝐷 +P 𝑆)⟩))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ⟨cop 4838   class class class wbr 5106  (class class class)co 7443  Pcnp 10971   +_P cpp 10973   ~_R cer 10976

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7775  ax-inf2 9669

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6322  df-ord 6383  df-on 6384  df-lim 6385  df-suc 6386  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-f1 6563  df-fo 6564  df-f1o 6565  df-fv 6566  df-ov 7446  df-oprab 7447  df-mpo 7448  df-om 7902  df-1st 8025  df-2nd 8026  df-frecs 8327  df-wrecs 8358  df-recs 8407  df-rdg 8446  df-1o 8504  df-oadd 8508  df-omul 8509  df-er 8745  df-ni 10984  df-pli 10985  df-mi 10986  df-lti 10987  df-plpq 11020  df-mpq 11021  df-ltpq 11022  df-enq 11023  df-nq 11024  df-erq 11025  df-plq 11026  df-mq 11027  df-1nq 11028  df-rq 11029  df-ltnq 11030  df-np 11093  df-plp 11095  df-enr 11167

This theorem is used by:  addsrmo  11185