Theorem naddoa 8632

Description: Natural addition of a natural is the same as regular addition. (Contributed by Scott Fenton, 20-Aug-2025.)

Assertion

Ref	Expression
naddoa	⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ ω) → (𝐴 +no 𝐵) = (𝐴 +o 𝐵))

Proof of Theorem naddoa

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		oveq2 7368	. . . . 5 ⊢ (𝑦 = ∅ → (𝐴 +no 𝑦) = (𝐴 +no ∅))
2		oveq2 7368	. . . . 5 ⊢ (𝑦 = ∅ → (𝐴 +o 𝑦) = (𝐴 +o ∅))
3	1, 2	eqeq12d 2753	. . . 4 ⊢ (𝑦 = ∅ → ((𝐴 +no 𝑦) = (𝐴 +o 𝑦) ↔ (𝐴 +no ∅) = (𝐴 +o ∅)))
4	3	imbi2d 340	. . 3 ⊢ (𝑦 = ∅ → ((𝐴 ∈ On → (𝐴 +no 𝑦) = (𝐴 +o 𝑦)) ↔ (𝐴 ∈ On → (𝐴 +no ∅) = (𝐴 +o ∅))))
5		oveq2 7368	. . . . 5 ⊢ (𝑦 = 𝑥 → (𝐴 +no 𝑦) = (𝐴 +no 𝑥))
6		oveq2 7368	. . . . 5 ⊢ (𝑦 = 𝑥 → (𝐴 +o 𝑦) = (𝐴 +o 𝑥))
7	5, 6	eqeq12d 2753	. . . 4 ⊢ (𝑦 = 𝑥 → ((𝐴 +no 𝑦) = (𝐴 +o 𝑦) ↔ (𝐴 +no 𝑥) = (𝐴 +o 𝑥)))
8	7	imbi2d 340	. . 3 ⊢ (𝑦 = 𝑥 → ((𝐴 ∈ On → (𝐴 +no 𝑦) = (𝐴 +o 𝑦)) ↔ (𝐴 ∈ On → (𝐴 +no 𝑥) = (𝐴 +o 𝑥))))
9		oveq2 7368	. . . . 5 ⊢ (𝑦 = suc 𝑥 → (𝐴 +no 𝑦) = (𝐴 +no suc 𝑥))
10		oveq2 7368	. . . . 5 ⊢ (𝑦 = suc 𝑥 → (𝐴 +o 𝑦) = (𝐴 +o suc 𝑥))
11	9, 10	eqeq12d 2753	. . . 4 ⊢ (𝑦 = suc 𝑥 → ((𝐴 +no 𝑦) = (𝐴 +o 𝑦) ↔ (𝐴 +no suc 𝑥) = (𝐴 +o suc 𝑥)))
12	11	imbi2d 340	. . 3 ⊢ (𝑦 = suc 𝑥 → ((𝐴 ∈ On → (𝐴 +no 𝑦) = (𝐴 +o 𝑦)) ↔ (𝐴 ∈ On → (𝐴 +no suc 𝑥) = (𝐴 +o suc 𝑥))))
13		oveq2 7368	. . . . 5 ⊢ (𝑦 = 𝐵 → (𝐴 +no 𝑦) = (𝐴 +no 𝐵))
14		oveq2 7368	. . . . 5 ⊢ (𝑦 = 𝐵 → (𝐴 +o 𝑦) = (𝐴 +o 𝐵))
15	13, 14	eqeq12d 2753	. . . 4 ⊢ (𝑦 = 𝐵 → ((𝐴 +no 𝑦) = (𝐴 +o 𝑦) ↔ (𝐴 +no 𝐵) = (𝐴 +o 𝐵)))
16	15	imbi2d 340	. . 3 ⊢ (𝑦 = 𝐵 → ((𝐴 ∈ On → (𝐴 +no 𝑦) = (𝐴 +o 𝑦)) ↔ (𝐴 ∈ On → (𝐴 +no 𝐵) = (𝐴 +o 𝐵))))
17		naddrid 8613	. . . 4 ⊢ (𝐴 ∈ On → (𝐴 +no ∅) = 𝐴)
18		oa0 8445	. . . 4 ⊢ (𝐴 ∈ On → (𝐴 +o ∅) = 𝐴)
19	17, 18	eqtr4d 2775	. . 3 ⊢ (𝐴 ∈ On → (𝐴 +no ∅) = (𝐴 +o ∅))
20		suceq 6386	. . . . . . 7 ⊢ ((𝐴 +no 𝑥) = (𝐴 +o 𝑥) → suc (𝐴 +no 𝑥) = suc (𝐴 +o 𝑥))
21	20	3ad2ant3 1136	. . . . . 6 ⊢ ((𝑥 ∈ ω ∧ 𝐴 ∈ On ∧ (𝐴 +no 𝑥) = (𝐴 +o 𝑥)) → suc (𝐴 +no 𝑥) = suc (𝐴 +o 𝑥))
22		nnon 7816	. . . . . . . . 9 ⊢ (𝑥 ∈ ω → 𝑥 ∈ On)
23		naddsuc2 8631	. . . . . . . . 9 ⊢ ((𝐴 ∈ On ∧ 𝑥 ∈ On) → (𝐴 +no suc 𝑥) = suc (𝐴 +no 𝑥))
24	22, 23	sylan2 594	. . . . . . . 8 ⊢ ((𝐴 ∈ On ∧ 𝑥 ∈ ω) → (𝐴 +no suc 𝑥) = suc (𝐴 +no 𝑥))
25	24	ancoms 458	. . . . . . 7 ⊢ ((𝑥 ∈ ω ∧ 𝐴 ∈ On) → (𝐴 +no suc 𝑥) = suc (𝐴 +no 𝑥))
26	25	3adant3 1133	. . . . . 6 ⊢ ((𝑥 ∈ ω ∧ 𝐴 ∈ On ∧ (𝐴 +no 𝑥) = (𝐴 +o 𝑥)) → (𝐴 +no suc 𝑥) = suc (𝐴 +no 𝑥))
27		onasuc 8457	. . . . . . . 8 ⊢ ((𝐴 ∈ On ∧ 𝑥 ∈ ω) → (𝐴 +o suc 𝑥) = suc (𝐴 +o 𝑥))
28	27	ancoms 458	. . . . . . 7 ⊢ ((𝑥 ∈ ω ∧ 𝐴 ∈ On) → (𝐴 +o suc 𝑥) = suc (𝐴 +o 𝑥))
29	28	3adant3 1133	. . . . . 6 ⊢ ((𝑥 ∈ ω ∧ 𝐴 ∈ On ∧ (𝐴 +no 𝑥) = (𝐴 +o 𝑥)) → (𝐴 +o suc 𝑥) = suc (𝐴 +o 𝑥))
30	21, 26, 29	3eqtr4d 2782	. . . . 5 ⊢ ((𝑥 ∈ ω ∧ 𝐴 ∈ On ∧ (𝐴 +no 𝑥) = (𝐴 +o 𝑥)) → (𝐴 +no suc 𝑥) = (𝐴 +o suc 𝑥))
31	30	3exp 1120	. . . 4 ⊢ (𝑥 ∈ ω → (𝐴 ∈ On → ((𝐴 +no 𝑥) = (𝐴 +o 𝑥) → (𝐴 +no suc 𝑥) = (𝐴 +o suc 𝑥))))
32	31	a2d 29	. . 3 ⊢ (𝑥 ∈ ω → ((𝐴 ∈ On → (𝐴 +no 𝑥) = (𝐴 +o 𝑥)) → (𝐴 ∈ On → (𝐴 +no suc 𝑥) = (𝐴 +o suc 𝑥))))
33	4, 8, 12, 16, 19, 32	finds 7840	. 2 ⊢ (𝐵 ∈ ω → (𝐴 ∈ On → (𝐴 +no 𝐵) = (𝐴 +o 𝐵)))
34	33	impcom 407	1 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ ω) → (𝐴 +no 𝐵) = (𝐴 +o 𝐵))

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1087   = wceq 1542   ∈ wcel 2114  ∅c0 4286  Oncon0 6318  suc csuc 6320  (class class class)co 7360  ωcom 7810   +_o coa 8396   +no cnadd 8595

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5225  ax-sep 5242  ax-nul 5252  ax-pow 5311  ax-pr 5378  ax-un 7682

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3062  df-reu 3352  df-rab 3401  df-v 3443  df-sbc 3742  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4287  df-if 4481  df-pw 4557  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-int 4904  df-iun 4949  df-br 5100  df-opab 5162  df-mpt 5181  df-tr 5207  df-id 5520  df-eprel 5525  df-po 5533  df-so 5534  df-fr 5578  df-se 5579  df-we 5580  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-pred 6260  df-ord 6321  df-on 6322  df-lim 6323  df-suc 6324  df-iota 6449  df-fun 6495  df-fn 6496  df-f 6497  df-f1 6498  df-fo 6499  df-f1o 6500  df-fv 6501  df-ov 7363  df-oprab 7364  df-mpo 7365  df-om 7811  df-1st 7935  df-2nd 7936  df-frecs 8225  df-wrecs 8256  df-recs 8305  df-rdg 8343  df-oadd 8403  df-nadd 8596

This theorem is referenced by:  omnaddcl  8633