Theorem gbpart9 48866

Description: The (strong) Goldbach partition of 9. (Contributed by AV, 26-Jul-2020.)

Assertion

Ref	Expression
gbpart9	⊢ 9 = ((3 + 3) + 3)

Proof of Theorem gbpart9

Step	Hyp	Ref	Expression
1		3p3e6 12494	. . 3 ⊢ (3 + 3) = 6
2	1	oveq1i 7430	. 2 ⊢ ((3 + 3) + 3) = (6 + 3)
3		6p3e9 12502	. 2 ⊢ (6 + 3) = 9
4	2, 3	eqtr2i 2785	1 ⊢ 9 = ((3 + 3) + 3)

This proof depends on syntax axioms:   = wceq 1570  (class class class)co 7420   + caddc 11203  3c3 12398  6c6 12401  9c9 12404

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-ext 2733  ax-1cn 11258  ax-addcl 11260  ax-addass 11265

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-iota 6494  df-fv 6546  df-ov 7423  df-2 12405  df-3 12406  df-4 12407  df-5 12408  df-6 12409  df-7 12410  df-8 12411  df-9 12412

This theorem is used by:  9gbo  48871