Theorem naddcom 8719

Description: Natural addition commutes. (Contributed by Scott Fenton, 26-Aug-2024.)

Assertion

Ref	Expression
naddcom	⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +no 𝐵) = (𝐵 +no 𝐴))

Proof of Theorem naddcom

Dummy variables 𝑎 𝑏 𝑐 𝑑 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		oveq1 7438	. . 3 ⊢ (𝑎 = 𝑐 → (𝑎 +no 𝑏) = (𝑐 +no 𝑏))
2		oveq2 7439	. . 3 ⊢ (𝑎 = 𝑐 → (𝑏 +no 𝑎) = (𝑏 +no 𝑐))
3	1, 2	eqeq12d 2751	. 2 ⊢ (𝑎 = 𝑐 → ((𝑎 +no 𝑏) = (𝑏 +no 𝑎) ↔ (𝑐 +no 𝑏) = (𝑏 +no 𝑐)))
4		oveq2 7439	. . 3 ⊢ (𝑏 = 𝑑 → (𝑐 +no 𝑏) = (𝑐 +no 𝑑))
5		oveq1 7438	. . 3 ⊢ (𝑏 = 𝑑 → (𝑏 +no 𝑐) = (𝑑 +no 𝑐))
6	4, 5	eqeq12d 2751	. 2 ⊢ (𝑏 = 𝑑 → ((𝑐 +no 𝑏) = (𝑏 +no 𝑐) ↔ (𝑐 +no 𝑑) = (𝑑 +no 𝑐)))
7		oveq1 7438	. . 3 ⊢ (𝑎 = 𝑐 → (𝑎 +no 𝑑) = (𝑐 +no 𝑑))
8		oveq2 7439	. . 3 ⊢ (𝑎 = 𝑐 → (𝑑 +no 𝑎) = (𝑑 +no 𝑐))
9	7, 8	eqeq12d 2751	. 2 ⊢ (𝑎 = 𝑐 → ((𝑎 +no 𝑑) = (𝑑 +no 𝑎) ↔ (𝑐 +no 𝑑) = (𝑑 +no 𝑐)))
10		oveq1 7438	. . 3 ⊢ (𝑎 = 𝐴 → (𝑎 +no 𝑏) = (𝐴 +no 𝑏))
11		oveq2 7439	. . 3 ⊢ (𝑎 = 𝐴 → (𝑏 +no 𝑎) = (𝑏 +no 𝐴))
12	10, 11	eqeq12d 2751	. 2 ⊢ (𝑎 = 𝐴 → ((𝑎 +no 𝑏) = (𝑏 +no 𝑎) ↔ (𝐴 +no 𝑏) = (𝑏 +no 𝐴)))
13		oveq2 7439	. . 3 ⊢ (𝑏 = 𝐵 → (𝐴 +no 𝑏) = (𝐴 +no 𝐵))
14		oveq1 7438	. . 3 ⊢ (𝑏 = 𝐵 → (𝑏 +no 𝐴) = (𝐵 +no 𝐴))
15	13, 14	eqeq12d 2751	. 2 ⊢ (𝑏 = 𝐵 → ((𝐴 +no 𝑏) = (𝑏 +no 𝐴) ↔ (𝐴 +no 𝐵) = (𝐵 +no 𝐴)))
16		eleq1 2827	. . . . . . . . . . . 12 ⊢ ((𝑎 +no 𝑑) = (𝑑 +no 𝑎) → ((𝑎 +no 𝑑) ∈ 𝑥 ↔ (𝑑 +no 𝑎) ∈ 𝑥))
17	16	ralimi 3081	. . . . . . . . . . 11 ⊢ (∀𝑑 ∈ 𝑏 (𝑎 +no 𝑑) = (𝑑 +no 𝑎) → ∀𝑑 ∈ 𝑏 ((𝑎 +no 𝑑) ∈ 𝑥 ↔ (𝑑 +no 𝑎) ∈ 𝑥))
18		ralbi 3101	. . . . . . . . . . 11 ⊢ (∀𝑑 ∈ 𝑏 ((𝑎 +no 𝑑) ∈ 𝑥 ↔ (𝑑 +no 𝑎) ∈ 𝑥) → (∀𝑑 ∈ 𝑏 (𝑎 +no 𝑑) ∈ 𝑥 ↔ ∀𝑑 ∈ 𝑏 (𝑑 +no 𝑎) ∈ 𝑥))
19	17, 18	syl 17	. . . . . . . . . 10 ⊢ (∀𝑑 ∈ 𝑏 (𝑎 +no 𝑑) = (𝑑 +no 𝑎) → (∀𝑑 ∈ 𝑏 (𝑎 +no 𝑑) ∈ 𝑥 ↔ ∀𝑑 ∈ 𝑏 (𝑑 +no 𝑎) ∈ 𝑥))
20	19	3ad2ant3 1134	. . . . . . . . 9 ⊢ ((∀𝑐 ∈ 𝑎 ∀𝑑 ∈ 𝑏 (𝑐 +no 𝑑) = (𝑑 +no 𝑐) ∧ ∀𝑐 ∈ 𝑎 (𝑐 +no 𝑏) = (𝑏 +no 𝑐) ∧ ∀𝑑 ∈ 𝑏 (𝑎 +no 𝑑) = (𝑑 +no 𝑎)) → (∀𝑑 ∈ 𝑏 (𝑎 +no 𝑑) ∈ 𝑥 ↔ ∀𝑑 ∈ 𝑏 (𝑑 +no 𝑎) ∈ 𝑥))
21	20	adantl 481	. . . . . . . 8 ⊢ (((𝑎 ∈ On ∧ 𝑏 ∈ On) ∧ (∀𝑐 ∈ 𝑎 ∀𝑑 ∈ 𝑏 (𝑐 +no 𝑑) = (𝑑 +no 𝑐) ∧ ∀𝑐 ∈ 𝑎 (𝑐 +no 𝑏) = (𝑏 +no 𝑐) ∧ ∀𝑑 ∈ 𝑏 (𝑎 +no 𝑑) = (𝑑 +no 𝑎))) → (∀𝑑 ∈ 𝑏 (𝑎 +no 𝑑) ∈ 𝑥 ↔ ∀𝑑 ∈ 𝑏 (𝑑 +no 𝑎) ∈ 𝑥))
22		eleq1 2827	. . . . . . . . . . . 12 ⊢ ((𝑐 +no 𝑏) = (𝑏 +no 𝑐) → ((𝑐 +no 𝑏) ∈ 𝑥 ↔ (𝑏 +no 𝑐) ∈ 𝑥))
23	22	ralimi 3081	. . . . . . . . . . 11 ⊢ (∀𝑐 ∈ 𝑎 (𝑐 +no 𝑏) = (𝑏 +no 𝑐) → ∀𝑐 ∈ 𝑎 ((𝑐 +no 𝑏) ∈ 𝑥 ↔ (𝑏 +no 𝑐) ∈ 𝑥))
24		ralbi 3101	. . . . . . . . . . 11 ⊢ (∀𝑐 ∈ 𝑎 ((𝑐 +no 𝑏) ∈ 𝑥 ↔ (𝑏 +no 𝑐) ∈ 𝑥) → (∀𝑐 ∈ 𝑎 (𝑐 +no 𝑏) ∈ 𝑥 ↔ ∀𝑐 ∈ 𝑎 (𝑏 +no 𝑐) ∈ 𝑥))
25	23, 24	syl 17	. . . . . . . . . 10 ⊢ (∀𝑐 ∈ 𝑎 (𝑐 +no 𝑏) = (𝑏 +no 𝑐) → (∀𝑐 ∈ 𝑎 (𝑐 +no 𝑏) ∈ 𝑥 ↔ ∀𝑐 ∈ 𝑎 (𝑏 +no 𝑐) ∈ 𝑥))
26	25	3ad2ant2 1133	. . . . . . . . 9 ⊢ ((∀𝑐 ∈ 𝑎 ∀𝑑 ∈ 𝑏 (𝑐 +no 𝑑) = (𝑑 +no 𝑐) ∧ ∀𝑐 ∈ 𝑎 (𝑐 +no 𝑏) = (𝑏 +no 𝑐) ∧ ∀𝑑 ∈ 𝑏 (𝑎 +no 𝑑) = (𝑑 +no 𝑎)) → (∀𝑐 ∈ 𝑎 (𝑐 +no 𝑏) ∈ 𝑥 ↔ ∀𝑐 ∈ 𝑎 (𝑏 +no 𝑐) ∈ 𝑥))
27	26	adantl 481	. . . . . . . 8 ⊢ (((𝑎 ∈ On ∧ 𝑏 ∈ On) ∧ (∀𝑐 ∈ 𝑎 ∀𝑑 ∈ 𝑏 (𝑐 +no 𝑑) = (𝑑 +no 𝑐) ∧ ∀𝑐 ∈ 𝑎 (𝑐 +no 𝑏) = (𝑏 +no 𝑐) ∧ ∀𝑑 ∈ 𝑏 (𝑎 +no 𝑑) = (𝑑 +no 𝑎))) → (∀𝑐 ∈ 𝑎 (𝑐 +no 𝑏) ∈ 𝑥 ↔ ∀𝑐 ∈ 𝑎 (𝑏 +no 𝑐) ∈ 𝑥))
28	21, 27	anbi12d 632	. . . . . . 7 ⊢ (((𝑎 ∈ On ∧ 𝑏 ∈ On) ∧ (∀𝑐 ∈ 𝑎 ∀𝑑 ∈ 𝑏 (𝑐 +no 𝑑) = (𝑑 +no 𝑐) ∧ ∀𝑐 ∈ 𝑎 (𝑐 +no 𝑏) = (𝑏 +no 𝑐) ∧ ∀𝑑 ∈ 𝑏 (𝑎 +no 𝑑) = (𝑑 +no 𝑎))) → ((∀𝑑 ∈ 𝑏 (𝑎 +no 𝑑) ∈ 𝑥 ∧ ∀𝑐 ∈ 𝑎 (𝑐 +no 𝑏) ∈ 𝑥) ↔ (∀𝑑 ∈ 𝑏 (𝑑 +no 𝑎) ∈ 𝑥 ∧ ∀𝑐 ∈ 𝑎 (𝑏 +no 𝑐) ∈ 𝑥)))
29	28	biancomd 463	. . . . . 6 ⊢ (((𝑎 ∈ On ∧ 𝑏 ∈ On) ∧ (∀𝑐 ∈ 𝑎 ∀𝑑 ∈ 𝑏 (𝑐 +no 𝑑) = (𝑑 +no 𝑐) ∧ ∀𝑐 ∈ 𝑎 (𝑐 +no 𝑏) = (𝑏 +no 𝑐) ∧ ∀𝑑 ∈ 𝑏 (𝑎 +no 𝑑) = (𝑑 +no 𝑎))) → ((∀𝑑 ∈ 𝑏 (𝑎 +no 𝑑) ∈ 𝑥 ∧ ∀𝑐 ∈ 𝑎 (𝑐 +no 𝑏) ∈ 𝑥) ↔ (∀𝑐 ∈ 𝑎 (𝑏 +no 𝑐) ∈ 𝑥 ∧ ∀𝑑 ∈ 𝑏 (𝑑 +no 𝑎) ∈ 𝑥)))
30	29	rabbidv 3441	. . . . 5 ⊢ (((𝑎 ∈ On ∧ 𝑏 ∈ On) ∧ (∀𝑐 ∈ 𝑎 ∀𝑑 ∈ 𝑏 (𝑐 +no 𝑑) = (𝑑 +no 𝑐) ∧ ∀𝑐 ∈ 𝑎 (𝑐 +no 𝑏) = (𝑏 +no 𝑐) ∧ ∀𝑑 ∈ 𝑏 (𝑎 +no 𝑑) = (𝑑 +no 𝑎))) → {𝑥 ∈ On ∣ (∀𝑑 ∈ 𝑏 (𝑎 +no 𝑑) ∈ 𝑥 ∧ ∀𝑐 ∈ 𝑎 (𝑐 +no 𝑏) ∈ 𝑥)} = {𝑥 ∈ On ∣ (∀𝑐 ∈ 𝑎 (𝑏 +no 𝑐) ∈ 𝑥 ∧ ∀𝑑 ∈ 𝑏 (𝑑 +no 𝑎) ∈ 𝑥)})
31	30	inteqd 4956	. . . 4 ⊢ (((𝑎 ∈ On ∧ 𝑏 ∈ On) ∧ (∀𝑐 ∈ 𝑎 ∀𝑑 ∈ 𝑏 (𝑐 +no 𝑑) = (𝑑 +no 𝑐) ∧ ∀𝑐 ∈ 𝑎 (𝑐 +no 𝑏) = (𝑏 +no 𝑐) ∧ ∀𝑑 ∈ 𝑏 (𝑎 +no 𝑑) = (𝑑 +no 𝑎))) → ∩ {𝑥 ∈ On ∣ (∀𝑑 ∈ 𝑏 (𝑎 +no 𝑑) ∈ 𝑥 ∧ ∀𝑐 ∈ 𝑎 (𝑐 +no 𝑏) ∈ 𝑥)} = ∩ {𝑥 ∈ On ∣ (∀𝑐 ∈ 𝑎 (𝑏 +no 𝑐) ∈ 𝑥 ∧ ∀𝑑 ∈ 𝑏 (𝑑 +no 𝑎) ∈ 𝑥)})
32		naddov2 8716	. . . . 5 ⊢ ((𝑎 ∈ On ∧ 𝑏 ∈ On) → (𝑎 +no 𝑏) = ∩ {𝑥 ∈ On ∣ (∀𝑑 ∈ 𝑏 (𝑎 +no 𝑑) ∈ 𝑥 ∧ ∀𝑐 ∈ 𝑎 (𝑐 +no 𝑏) ∈ 𝑥)})
33	32	adantr 480	. . . 4 ⊢ (((𝑎 ∈ On ∧ 𝑏 ∈ On) ∧ (∀𝑐 ∈ 𝑎 ∀𝑑 ∈ 𝑏 (𝑐 +no 𝑑) = (𝑑 +no 𝑐) ∧ ∀𝑐 ∈ 𝑎 (𝑐 +no 𝑏) = (𝑏 +no 𝑐) ∧ ∀𝑑 ∈ 𝑏 (𝑎 +no 𝑑) = (𝑑 +no 𝑎))) → (𝑎 +no 𝑏) = ∩ {𝑥 ∈ On ∣ (∀𝑑 ∈ 𝑏 (𝑎 +no 𝑑) ∈ 𝑥 ∧ ∀𝑐 ∈ 𝑎 (𝑐 +no 𝑏) ∈ 𝑥)})
34		naddov2 8716	. . . . . 6 ⊢ ((𝑏 ∈ On ∧ 𝑎 ∈ On) → (𝑏 +no 𝑎) = ∩ {𝑥 ∈ On ∣ (∀𝑐 ∈ 𝑎 (𝑏 +no 𝑐) ∈ 𝑥 ∧ ∀𝑑 ∈ 𝑏 (𝑑 +no 𝑎) ∈ 𝑥)})
35	34	ancoms 458	. . . . 5 ⊢ ((𝑎 ∈ On ∧ 𝑏 ∈ On) → (𝑏 +no 𝑎) = ∩ {𝑥 ∈ On ∣ (∀𝑐 ∈ 𝑎 (𝑏 +no 𝑐) ∈ 𝑥 ∧ ∀𝑑 ∈ 𝑏 (𝑑 +no 𝑎) ∈ 𝑥)})
36	35	adantr 480	. . . 4 ⊢ (((𝑎 ∈ On ∧ 𝑏 ∈ On) ∧ (∀𝑐 ∈ 𝑎 ∀𝑑 ∈ 𝑏 (𝑐 +no 𝑑) = (𝑑 +no 𝑐) ∧ ∀𝑐 ∈ 𝑎 (𝑐 +no 𝑏) = (𝑏 +no 𝑐) ∧ ∀𝑑 ∈ 𝑏 (𝑎 +no 𝑑) = (𝑑 +no 𝑎))) → (𝑏 +no 𝑎) = ∩ {𝑥 ∈ On ∣ (∀𝑐 ∈ 𝑎 (𝑏 +no 𝑐) ∈ 𝑥 ∧ ∀𝑑 ∈ 𝑏 (𝑑 +no 𝑎) ∈ 𝑥)})
37	31, 33, 36	3eqtr4d 2785	. . 3 ⊢ (((𝑎 ∈ On ∧ 𝑏 ∈ On) ∧ (∀𝑐 ∈ 𝑎 ∀𝑑 ∈ 𝑏 (𝑐 +no 𝑑) = (𝑑 +no 𝑐) ∧ ∀𝑐 ∈ 𝑎 (𝑐 +no 𝑏) = (𝑏 +no 𝑐) ∧ ∀𝑑 ∈ 𝑏 (𝑎 +no 𝑑) = (𝑑 +no 𝑎))) → (𝑎 +no 𝑏) = (𝑏 +no 𝑎))
38	37	ex 412	. 2 ⊢ ((𝑎 ∈ On ∧ 𝑏 ∈ On) → ((∀𝑐 ∈ 𝑎 ∀𝑑 ∈ 𝑏 (𝑐 +no 𝑑) = (𝑑 +no 𝑐) ∧ ∀𝑐 ∈ 𝑎 (𝑐 +no 𝑏) = (𝑏 +no 𝑐) ∧ ∀𝑑 ∈ 𝑏 (𝑎 +no 𝑑) = (𝑑 +no 𝑎)) → (𝑎 +no 𝑏) = (𝑏 +no 𝑎)))
39	3, 6, 9, 12, 15, 38	on2ind 8706	1 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +no 𝐵) = (𝐵 +no 𝐴))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1537   ∈ wcel 2106  ∀wral 3059  {crab 3433  ∩ cint 4951  Oncon0 6386  (class class class)co 7431   +no cnadd 8702

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-rep 5285  ax-sep 5302  ax-nul 5312  ax-pow 5371  ax-pr 5438  ax-un 7754

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-ral 3060  df-rex 3069  df-reu 3379  df-rab 3434  df-v 3480  df-sbc 3792  df-csb 3909  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-pss 3983  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-int 4952  df-iun 4998  df-br 5149  df-opab 5211  df-mpt 5232  df-tr 5266  df-id 5583  df-eprel 5589  df-po 5597  df-so 5598  df-fr 5641  df-se 5642  df-we 5643  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-pred 6323  df-ord 6389  df-on 6390  df-suc 6392  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-f1 6568  df-fo 6569  df-f1o 6570  df-fv 6571  df-ov 7434  df-oprab 7435  df-mpo 7436  df-1st 8013  df-2nd 8014  df-frecs 8305  df-nadd 8703

This theorem is referenced by:  naddlid  8721  naddel2  8725  naddss2  8727  naddword2  8729  nadd32  8734  nadd42  8736  addsproplem2  28018  addsbday  28065  nadd2rabex  43376  nadd1rabtr  43378  nadd1rabex  43380  naddwordnexlem4  43391