Theorem naddoa 8688

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 7418	. . . . 5 ⊢ (𝑦 = ∅ → (𝐴 +no 𝑦) = (𝐴 +no ∅))
2		oveq2 7418	. . . . 5 ⊢ (𝑦 = ∅ → (𝐴 +o 𝑦) = (𝐴 +o ∅))
3	1, 2	eqeq12d 2777	. . . 4 ⊢ (𝑦 = ∅ → ((𝐴 +no 𝑦) = (𝐴 +o 𝑦) ↔ (𝐴 +no ∅) = (𝐴 +o ∅)))
4	3	imbi2d 343	. . 3 ⊢ (𝑦 = ∅ → ((𝐴 ∈ On → (𝐴 +no 𝑦) = (𝐴 +o 𝑦)) ↔ (𝐴 ∈ On → (𝐴 +no ∅) = (𝐴 +o ∅))))
5		oveq2 7418	. . . . 5 ⊢ (𝑦 = 𝑥 → (𝐴 +no 𝑦) = (𝐴 +no 𝑥))
6		oveq2 7418	. . . . 5 ⊢ (𝑦 = 𝑥 → (𝐴 +o 𝑦) = (𝐴 +o 𝑥))
7	5, 6	eqeq12d 2777	. . . 4 ⊢ (𝑦 = 𝑥 → ((𝐴 +no 𝑦) = (𝐴 +o 𝑦) ↔ (𝐴 +no 𝑥) = (𝐴 +o 𝑥)))
8	7	imbi2d 343	. . 3 ⊢ (𝑦 = 𝑥 → ((𝐴 ∈ On → (𝐴 +no 𝑦) = (𝐴 +o 𝑦)) ↔ (𝐴 ∈ On → (𝐴 +no 𝑥) = (𝐴 +o 𝑥))))
9		oveq2 7418	. . . . 5 ⊢ (𝑦 = suc 𝑥 → (𝐴 +no 𝑦) = (𝐴 +no suc 𝑥))
10		oveq2 7418	. . . . 5 ⊢ (𝑦 = suc 𝑥 → (𝐴 +o 𝑦) = (𝐴 +o suc 𝑥))
11	9, 10	eqeq12d 2777	. . . 4 ⊢ (𝑦 = suc 𝑥 → ((𝐴 +no 𝑦) = (𝐴 +o 𝑦) ↔ (𝐴 +no suc 𝑥) = (𝐴 +o suc 𝑥)))
12	11	imbi2d 343	. . 3 ⊢ (𝑦 = suc 𝑥 → ((𝐴 ∈ On → (𝐴 +no 𝑦) = (𝐴 +o 𝑦)) ↔ (𝐴 ∈ On → (𝐴 +no suc 𝑥) = (𝐴 +o suc 𝑥))))
13		oveq2 7418	. . . . 5 ⊢ (𝑦 = 𝐵 → (𝐴 +no 𝑦) = (𝐴 +no 𝐵))
14		oveq2 7418	. . . . 5 ⊢ (𝑦 = 𝐵 → (𝐴 +o 𝑦) = (𝐴 +o 𝐵))
15	13, 14	eqeq12d 2777	. . . 4 ⊢ (𝑦 = 𝐵 → ((𝐴 +no 𝑦) = (𝐴 +o 𝑦) ↔ (𝐴 +no 𝐵) = (𝐴 +o 𝐵)))
16	15	imbi2d 343	. . 3 ⊢ (𝑦 = 𝐵 → ((𝐴 ∈ On → (𝐴 +no 𝑦) = (𝐴 +o 𝑦)) ↔ (𝐴 ∈ On → (𝐴 +no 𝐵) = (𝐴 +o 𝐵))))
17		naddrid 8669	. . . 4 ⊢ (𝐴 ∈ On → (𝐴 +no ∅) = 𝐴)
18		oa0 8500	. . . 4 ⊢ (𝐴 ∈ On → (𝐴 +o ∅) = 𝐴)
19	17, 18	eqtr4d 2799	. . 3 ⊢ (𝐴 ∈ On → (𝐴 +no ∅) = (𝐴 +o ∅))
20		suceq 6429	. . . . . . 7 ⊢ ((𝐴 +no 𝑥) = (𝐴 +o 𝑥) → suc (𝐴 +no 𝑥) = suc (𝐴 +o 𝑥))
21	20	3ad2ant3 1151	. . . . . 6 ⊢ ((𝑥 ∈ ω ∧ 𝐴 ∈ On ∧ (𝐴 +no 𝑥) = (𝐴 +o 𝑥)) → suc (𝐴 +no 𝑥) = suc (𝐴 +o 𝑥))
22		nnon 7867	. . . . . . . . 9 ⊢ (𝑥 ∈ ω → 𝑥 ∈ On)
23		naddsuc2 8687	. . . . . . . . 9 ⊢ ((𝐴 ∈ On ∧ 𝑥 ∈ On) → (𝐴 +no suc 𝑥) = suc (𝐴 +no 𝑥))
24	22, 23	sylan2 604	. . . . . . . 8 ⊢ ((𝐴 ∈ On ∧ 𝑥 ∈ ω) → (𝐴 +no suc 𝑥) = suc (𝐴 +no 𝑥))
25	24	ancoms 463	. . . . . . 7 ⊢ ((𝑥 ∈ ω ∧ 𝐴 ∈ On) → (𝐴 +no suc 𝑥) = suc (𝐴 +no 𝑥))
26	25	3adant3 1148	. . . . . 6 ⊢ ((𝑥 ∈ ω ∧ 𝐴 ∈ On ∧ (𝐴 +no 𝑥) = (𝐴 +o 𝑥)) → (𝐴 +no suc 𝑥) = suc (𝐴 +no 𝑥))
27		onasuc 8512	. . . . . . . 8 ⊢ ((𝐴 ∈ On ∧ 𝑥 ∈ ω) → (𝐴 +o suc 𝑥) = suc (𝐴 +o 𝑥))
28	27	ancoms 463	. . . . . . 7 ⊢ ((𝑥 ∈ ω ∧ 𝐴 ∈ On) → (𝐴 +o suc 𝑥) = suc (𝐴 +o 𝑥))
29	28	3adant3 1148	. . . . . 6 ⊢ ((𝑥 ∈ ω ∧ 𝐴 ∈ On ∧ (𝐴 +no 𝑥) = (𝐴 +o 𝑥)) → (𝐴 +o suc 𝑥) = suc (𝐴 +o 𝑥))
30	21, 26, 29	3eqtr4d 2806	. . . . 5 ⊢ ((𝑥 ∈ ω ∧ 𝐴 ∈ On ∧ (𝐴 +no 𝑥) = (𝐴 +o 𝑥)) → (𝐴 +no suc 𝑥) = (𝐴 +o suc 𝑥))
31	30	3exp 1135	. . . 4 ⊢ (𝑥 ∈ ω → (𝐴 ∈ On → ((𝐴 +no 𝑥) = (𝐴 +o 𝑥) → (𝐴 +no suc 𝑥) = (𝐴 +o suc 𝑥))))
32	31	a2d 30	. . 3 ⊢ (𝑥 ∈ ω → ((𝐴 ∈ On → (𝐴 +no 𝑥) = (𝐴 +o 𝑥)) → (𝐴 ∈ On → (𝐴 +no suc 𝑥) = (𝐴 +o suc 𝑥))))
33	4, 8, 12, 16, 19, 32	finds 7892	. 2 ⊢ (𝐵 ∈ ω → (𝐴 ∈ On → (𝐴 +no 𝐵) = (𝐴 +o 𝐵)))
34	33	impcom 412	1 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ ω) → (𝐴 +no 𝐵) = (𝐴 +o 𝐵))

Syntax hints:   → wi 4   ∧ wa 400   ∧ w3a 1101   = wceq 1568   ∈ wcel 2141  ∅c0 4285  Oncon0 6360  suc csuc 6362  (class class class)co 7410  ωcom 7861   +_o coa 8449   +no cnadd 8650

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1823  ax-4 1837  ax-5 1938  ax-6 1995  ax-7 2036  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-rep 5237  ax-sep 5256  ax-nul 5268  ax-pow 5336  ax-pr 5404  ax-un 7732

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1571  df-fal 1581  df-ex 1808  df-nf 1812  df-sb 2095  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3744  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-int 4912  df-iun 4957  df-br 5109  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5556  df-eprel 5561  df-po 5569  df-so 5570  df-fr 5614  df-se 5615  df-we 5616  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-pred 6302  df-ord 6363  df-on 6364  df-lim 6365  df-suc 6366  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-ov 7413  df-oprab 7414  df-mpo 7415  df-om 7862  df-1st 7985  df-2nd 7986  df-frecs 8277  df-wrecs 8308  df-recs 8357  df-rdg 8396  df-oadd 8456  df-nadd 8651

This theorem is referenced by:  omnaddcl  8689