Theorem addcmpblnr 11082

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 7426	. 2 ⊢ (((𝐴 +P 𝐷) = (𝐵 +P 𝐶) ∧ (𝐹 +P 𝑆) = (𝐺 +P 𝑅)) → ((𝐴 +P 𝐷) +P (𝐹 +P 𝑆)) = ((𝐵 +P 𝐶) +P (𝐺 +P 𝑅)))
2		addclpr 11031	. . . . . . . 8 ⊢ ((𝐴 ∈ P ∧ 𝐹 ∈ P) → (𝐴 +P 𝐹) ∈ P)
3		addclpr 11031	. . . . . . . 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 11031	. . . . . . . 8 ⊢ ((𝐶 ∈ P ∧ 𝑅 ∈ P) → (𝐶 +P 𝑅) ∈ P)
7		addclpr 11031	. . . . . . . 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 11078	. . . 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 11034	. . . . . . . 8 ⊢ (𝐹 +P 𝐷) = (𝐷 +P 𝐹)
15	14	oveq1i 7427	. . . . . . 7 ⊢ ((𝐹 +P 𝐷) +P 𝑆) = ((𝐷 +P 𝐹) +P 𝑆)
16		addasspr 11035	. . . . . . 7 ⊢ ((𝐹 +P 𝐷) +P 𝑆) = (𝐹 +P (𝐷 +P 𝑆))
17		addasspr 11035	. . . . . . 7 ⊢ ((𝐷 +P 𝐹) +P 𝑆) = (𝐷 +P (𝐹 +P 𝑆))
18	15, 16, 17	3eqtr3i 2793	. . . . . 6 ⊢ (𝐹 +P (𝐷 +P 𝑆)) = (𝐷 +P (𝐹 +P 𝑆))
19	18	oveq2i 7428	. . . . 5 ⊢ (𝐴 +P (𝐹 +P (𝐷 +P 𝑆))) = (𝐴 +P (𝐷 +P (𝐹 +P 𝑆)))
20		addasspr 11035	. . . . 5 ⊢ ((𝐴 +P 𝐹) +P (𝐷 +P 𝑆)) = (𝐴 +P (𝐹 +P (𝐷 +P 𝑆)))
21		addasspr 11035	. . . . 5 ⊢ ((𝐴 +P 𝐷) +P (𝐹 +P 𝑆)) = (𝐴 +P (𝐷 +P (𝐹 +P 𝑆)))
22	19, 20, 21	3eqtr4i 2795	. . . 4 ⊢ ((𝐴 +P 𝐹) +P (𝐷 +P 𝑆)) = ((𝐴 +P 𝐷) +P (𝐹 +P 𝑆))
23		addcompr 11034	. . . . . . . 8 ⊢ (𝐺 +P 𝐶) = (𝐶 +P 𝐺)
24	23	oveq1i 7427	. . . . . . 7 ⊢ ((𝐺 +P 𝐶) +P 𝑅) = ((𝐶 +P 𝐺) +P 𝑅)
25		addasspr 11035	. . . . . . 7 ⊢ ((𝐺 +P 𝐶) +P 𝑅) = (𝐺 +P (𝐶 +P 𝑅))
26		addasspr 11035	. . . . . . 7 ⊢ ((𝐶 +P 𝐺) +P 𝑅) = (𝐶 +P (𝐺 +P 𝑅))
27	24, 25, 26	3eqtr3i 2793	. . . . . 6 ⊢ (𝐺 +P (𝐶 +P 𝑅)) = (𝐶 +P (𝐺 +P 𝑅))
28	27	oveq2i 7428	. . . . 5 ⊢ (𝐵 +P (𝐺 +P (𝐶 +P 𝑅))) = (𝐵 +P (𝐶 +P (𝐺 +P 𝑅)))
29		addasspr 11035	. . . . 5 ⊢ ((𝐵 +P 𝐺) +P (𝐶 +P 𝑅)) = (𝐵 +P (𝐺 +P (𝐶 +P 𝑅)))
30		addasspr 11035	. . . . 5 ⊢ ((𝐵 +P 𝐶) +P (𝐺 +P 𝑅)) = (𝐵 +P (𝐶 +P (𝐺 +P 𝑅)))
31	28, 29, 30	3eqtr4i 2795	. . . 4 ⊢ ((𝐵 +P 𝐺) +P (𝐶 +P 𝑅)) = ((𝐵 +P 𝐶) +P (𝐺 +P 𝑅))
32	22, 31	eqeq12i 2780	. . 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 2145  ⟨cop 4593   class class class wbr 5107  (class class class)co 7417  Pcnp 10872   +_P cpp 10874   ~_R cer 10877

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7740  ax-inf2 9624

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 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rmo 3367  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7420  df-oprab 7421  df-mpo 7422  df-om 7867  df-1st 7990  df-2nd 7991  df-frecs 8284  df-wrecs 8315  df-recs 8364  df-rdg 8403  df-1o 8459  df-oadd 8463  df-omul 8464  df-er 8700  df-ni 10885  df-pli 10886  df-mi 10887  df-lti 10888  df-plpq 10921  df-mpq 10922  df-ltpq 10923  df-enq 10924  df-nq 10925  df-erq 10926  df-plq 10927  df-mq 10928  df-1nq 10929  df-rq 10930  df-ltnq 10931  df-np 10994  df-plp 10996  df-enr 11068

This theorem is used by:  addsrmo  11086