Theorem gbpart9 48457

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 12392	. . 3 ⊢ (3 + 3) = 6
2	1	oveq1i 7421	. 2 ⊢ ((3 + 3) + 3) = (6 + 3)
3		6p3e9 12400	. 2 ⊢ (6 + 3) = 9
4	2, 3	eqtr2i 2793	1 ⊢ 9 = ((3 + 3) + 3)

Syntax hints:   = wceq 1567  (class class class)co 7411   + caddc 11103  3c3 12296  6c6 12299  9c9 12302

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-ext 2741  ax-1cn 11158  ax-addcl 11160  ax-addass 11165

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-sb 2098  df-clab 2748  df-cleq 2761  df-clel 2844  df-rab 3424  df-v 3465  df-dif 3916  df-un 3918  df-ss 3930  df-nul 4295  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-br 5114  df-iota 6493  df-fv 6545  df-ov 7414  df-2 12303  df-3 12304  df-4 12305  df-5 12306  df-6 12307  df-7 12308  df-8 12309  df-9 12310

This theorem is referenced by:  9gbo  48462