Theorem nmulcom 36482

Description: Natural multiplication commutes. (Contributed by Scott Fenton, 10-Jun-2026.)

Assertion

Ref	Expression
nmulcom	⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ·no 𝐵) = (𝐵 ·no 𝐴))

Proof of Theorem nmulcom

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

Step	Hyp	Ref	Expression
1		oveq1 7388	. . 3 ⊢ (𝑎 = 𝑐 → (𝑎 ·no 𝑏) = (𝑐 ·no 𝑏))
2		oveq2 7389	. . 3 ⊢ (𝑎 = 𝑐 → (𝑏 ·no 𝑎) = (𝑏 ·no 𝑐))
3	1, 2	eqeq12d 2768	. 2 ⊢ (𝑎 = 𝑐 → ((𝑎 ·no 𝑏) = (𝑏 ·no 𝑎) ↔ (𝑐 ·no 𝑏) = (𝑏 ·no 𝑐)))
4		oveq2 7389	. . 3 ⊢ (𝑏 = 𝑑 → (𝑐 ·no 𝑏) = (𝑐 ·no 𝑑))
5		oveq1 7388	. . 3 ⊢ (𝑏 = 𝑑 → (𝑏 ·no 𝑐) = (𝑑 ·no 𝑐))
6	4, 5	eqeq12d 2768	. 2 ⊢ (𝑏 = 𝑑 → ((𝑐 ·no 𝑏) = (𝑏 ·no 𝑐) ↔ (𝑐 ·no 𝑑) = (𝑑 ·no 𝑐)))
7		oveq1 7388	. . 3 ⊢ (𝑎 = 𝑐 → (𝑎 ·no 𝑑) = (𝑐 ·no 𝑑))
8		oveq2 7389	. . 3 ⊢ (𝑎 = 𝑐 → (𝑑 ·no 𝑎) = (𝑑 ·no 𝑐))
9	7, 8	eqeq12d 2768	. 2 ⊢ (𝑎 = 𝑐 → ((𝑎 ·no 𝑑) = (𝑑 ·no 𝑎) ↔ (𝑐 ·no 𝑑) = (𝑑 ·no 𝑐)))
10		oveq1 7388	. . 3 ⊢ (𝑎 = 𝐴 → (𝑎 ·no 𝑏) = (𝐴 ·no 𝑏))
11		oveq2 7389	. . 3 ⊢ (𝑎 = 𝐴 → (𝑏 ·no 𝑎) = (𝑏 ·no 𝐴))
12	10, 11	eqeq12d 2768	. 2 ⊢ (𝑎 = 𝐴 → ((𝑎 ·no 𝑏) = (𝑏 ·no 𝑎) ↔ (𝐴 ·no 𝑏) = (𝑏 ·no 𝐴)))
13		oveq2 7389	. . 3 ⊢ (𝑏 = 𝐵 → (𝐴 ·no 𝑏) = (𝐴 ·no 𝐵))
14		oveq1 7388	. . 3 ⊢ (𝑏 = 𝐵 → (𝑏 ·no 𝐴) = (𝐵 ·no 𝐴))
15	13, 14	eqeq12d 2768	. 2 ⊢ (𝑏 = 𝐵 → ((𝐴 ·no 𝑏) = (𝑏 ·no 𝐴) ↔ (𝐴 ·no 𝐵) = (𝐵 ·no 𝐴)))
16		oveq1 7388	. . . . . . . . . . . . 13 ⊢ (𝑐 = 𝑧 → (𝑐 ·no 𝑏) = (𝑧 ·no 𝑏))
17		oveq2 7389	. . . . . . . . . . . . 13 ⊢ (𝑐 = 𝑧 → (𝑏 ·no 𝑐) = (𝑏 ·no 𝑧))
18	16, 17	eqeq12d 2768	. . . . . . . . . . . 12 ⊢ (𝑐 = 𝑧 → ((𝑐 ·no 𝑏) = (𝑏 ·no 𝑐) ↔ (𝑧 ·no 𝑏) = (𝑏 ·no 𝑧)))
19		simplr2 1226	. . . . . . . . . . . 12 ⊢ ((((𝑎 ∈ On ∧ 𝑏 ∈ On) ∧ (∀𝑐 ∈ 𝑎 ∀𝑑 ∈ 𝑏 (𝑐 ·no 𝑑) = (𝑑 ·no 𝑐) ∧ ∀𝑐 ∈ 𝑎 (𝑐 ·no 𝑏) = (𝑏 ·no 𝑐) ∧ ∀𝑑 ∈ 𝑏 (𝑎 ·no 𝑑) = (𝑑 ·no 𝑎))) ∧ (𝑧 ∈ 𝑎 ∧ 𝑦 ∈ 𝑏)) → ∀𝑐 ∈ 𝑎 (𝑐 ·no 𝑏) = (𝑏 ·no 𝑐))
20		simprl 778	. . . . . . . . . . . 12 ⊢ ((((𝑎 ∈ On ∧ 𝑏 ∈ On) ∧ (∀𝑐 ∈ 𝑎 ∀𝑑 ∈ 𝑏 (𝑐 ·no 𝑑) = (𝑑 ·no 𝑐) ∧ ∀𝑐 ∈ 𝑎 (𝑐 ·no 𝑏) = (𝑏 ·no 𝑐) ∧ ∀𝑑 ∈ 𝑏 (𝑎 ·no 𝑑) = (𝑑 ·no 𝑎))) ∧ (𝑧 ∈ 𝑎 ∧ 𝑦 ∈ 𝑏)) → 𝑧 ∈ 𝑎)
21	18, 19, 20	rspcdva 3573	. . . . . . . . . . 11 ⊢ ((((𝑎 ∈ On ∧ 𝑏 ∈ On) ∧ (∀𝑐 ∈ 𝑎 ∀𝑑 ∈ 𝑏 (𝑐 ·no 𝑑) = (𝑑 ·no 𝑐) ∧ ∀𝑐 ∈ 𝑎 (𝑐 ·no 𝑏) = (𝑏 ·no 𝑐) ∧ ∀𝑑 ∈ 𝑏 (𝑎 ·no 𝑑) = (𝑑 ·no 𝑎))) ∧ (𝑧 ∈ 𝑎 ∧ 𝑦 ∈ 𝑏)) → (𝑧 ·no 𝑏) = (𝑏 ·no 𝑧))
22		oveq2 7389	. . . . . . . . . . . . 13 ⊢ (𝑑 = 𝑦 → (𝑎 ·no 𝑑) = (𝑎 ·no 𝑦))
23		oveq1 7388	. . . . . . . . . . . . 13 ⊢ (𝑑 = 𝑦 → (𝑑 ·no 𝑎) = (𝑦 ·no 𝑎))
24	22, 23	eqeq12d 2768	. . . . . . . . . . . 12 ⊢ (𝑑 = 𝑦 → ((𝑎 ·no 𝑑) = (𝑑 ·no 𝑎) ↔ (𝑎 ·no 𝑦) = (𝑦 ·no 𝑎)))
25		simplr3 1227	. . . . . . . . . . . 12 ⊢ ((((𝑎 ∈ On ∧ 𝑏 ∈ On) ∧ (∀𝑐 ∈ 𝑎 ∀𝑑 ∈ 𝑏 (𝑐 ·no 𝑑) = (𝑑 ·no 𝑐) ∧ ∀𝑐 ∈ 𝑎 (𝑐 ·no 𝑏) = (𝑏 ·no 𝑐) ∧ ∀𝑑 ∈ 𝑏 (𝑎 ·no 𝑑) = (𝑑 ·no 𝑎))) ∧ (𝑧 ∈ 𝑎 ∧ 𝑦 ∈ 𝑏)) → ∀𝑑 ∈ 𝑏 (𝑎 ·no 𝑑) = (𝑑 ·no 𝑎))
26		simprr 780	. . . . . . . . . . . 12 ⊢ ((((𝑎 ∈ On ∧ 𝑏 ∈ On) ∧ (∀𝑐 ∈ 𝑎 ∀𝑑 ∈ 𝑏 (𝑐 ·no 𝑑) = (𝑑 ·no 𝑐) ∧ ∀𝑐 ∈ 𝑎 (𝑐 ·no 𝑏) = (𝑏 ·no 𝑐) ∧ ∀𝑑 ∈ 𝑏 (𝑎 ·no 𝑑) = (𝑑 ·no 𝑎))) ∧ (𝑧 ∈ 𝑎 ∧ 𝑦 ∈ 𝑏)) → 𝑦 ∈ 𝑏)
27	24, 25, 26	rspcdva 3573	. . . . . . . . . . 11 ⊢ ((((𝑎 ∈ On ∧ 𝑏 ∈ On) ∧ (∀𝑐 ∈ 𝑎 ∀𝑑 ∈ 𝑏 (𝑐 ·no 𝑑) = (𝑑 ·no 𝑐) ∧ ∀𝑐 ∈ 𝑎 (𝑐 ·no 𝑏) = (𝑏 ·no 𝑐) ∧ ∀𝑑 ∈ 𝑏 (𝑎 ·no 𝑑) = (𝑑 ·no 𝑎))) ∧ (𝑧 ∈ 𝑎 ∧ 𝑦 ∈ 𝑏)) → (𝑎 ·no 𝑦) = (𝑦 ·no 𝑎))
28	21, 27	oveq12d 7399	. . . . . . . . . 10 ⊢ ((((𝑎 ∈ On ∧ 𝑏 ∈ On) ∧ (∀𝑐 ∈ 𝑎 ∀𝑑 ∈ 𝑏 (𝑐 ·no 𝑑) = (𝑑 ·no 𝑐) ∧ ∀𝑐 ∈ 𝑎 (𝑐 ·no 𝑏) = (𝑏 ·no 𝑐) ∧ ∀𝑑 ∈ 𝑏 (𝑎 ·no 𝑑) = (𝑑 ·no 𝑎))) ∧ (𝑧 ∈ 𝑎 ∧ 𝑦 ∈ 𝑏)) → ((𝑧 ·no 𝑏) +no (𝑎 ·no 𝑦)) = ((𝑏 ·no 𝑧) +no (𝑦 ·no 𝑎)))
29		simpllr 783	. . . . . . . . . . . 12 ⊢ ((((𝑎 ∈ On ∧ 𝑏 ∈ On) ∧ (∀𝑐 ∈ 𝑎 ∀𝑑 ∈ 𝑏 (𝑐 ·no 𝑑) = (𝑑 ·no 𝑐) ∧ ∀𝑐 ∈ 𝑎 (𝑐 ·no 𝑏) = (𝑏 ·no 𝑐) ∧ ∀𝑑 ∈ 𝑏 (𝑎 ·no 𝑑) = (𝑑 ·no 𝑎))) ∧ (𝑧 ∈ 𝑎 ∧ 𝑦 ∈ 𝑏)) → 𝑏 ∈ On)
30		simplll 782	. . . . . . . . . . . . 13 ⊢ ((((𝑎 ∈ On ∧ 𝑏 ∈ On) ∧ (∀𝑐 ∈ 𝑎 ∀𝑑 ∈ 𝑏 (𝑐 ·no 𝑑) = (𝑑 ·no 𝑐) ∧ ∀𝑐 ∈ 𝑎 (𝑐 ·no 𝑏) = (𝑏 ·no 𝑐) ∧ ∀𝑑 ∈ 𝑏 (𝑎 ·no 𝑑) = (𝑑 ·no 𝑎))) ∧ (𝑧 ∈ 𝑎 ∧ 𝑦 ∈ 𝑏)) → 𝑎 ∈ On)
31		onelon 6356	. . . . . . . . . . . . 13 ⊢ ((𝑎 ∈ On ∧ 𝑧 ∈ 𝑎) → 𝑧 ∈ On)
32	30, 20, 31	syl2anc 592	. . . . . . . . . . . 12 ⊢ ((((𝑎 ∈ On ∧ 𝑏 ∈ On) ∧ (∀𝑐 ∈ 𝑎 ∀𝑑 ∈ 𝑏 (𝑐 ·no 𝑑) = (𝑑 ·no 𝑐) ∧ ∀𝑐 ∈ 𝑎 (𝑐 ·no 𝑏) = (𝑏 ·no 𝑐) ∧ ∀𝑑 ∈ 𝑏 (𝑎 ·no 𝑑) = (𝑑 ·no 𝑎))) ∧ (𝑧 ∈ 𝑎 ∧ 𝑦 ∈ 𝑏)) → 𝑧 ∈ On)
33		nmulcl 36479	. . . . . . . . . . . 12 ⊢ ((𝑏 ∈ On ∧ 𝑧 ∈ On) → (𝑏 ·no 𝑧) ∈ On)
34	29, 32, 33	syl2anc 592	. . . . . . . . . . 11 ⊢ ((((𝑎 ∈ On ∧ 𝑏 ∈ On) ∧ (∀𝑐 ∈ 𝑎 ∀𝑑 ∈ 𝑏 (𝑐 ·no 𝑑) = (𝑑 ·no 𝑐) ∧ ∀𝑐 ∈ 𝑎 (𝑐 ·no 𝑏) = (𝑏 ·no 𝑐) ∧ ∀𝑑 ∈ 𝑏 (𝑎 ·no 𝑑) = (𝑑 ·no 𝑎))) ∧ (𝑧 ∈ 𝑎 ∧ 𝑦 ∈ 𝑏)) → (𝑏 ·no 𝑧) ∈ On)
35		onelon 6356	. . . . . . . . . . . . 13 ⊢ ((𝑏 ∈ On ∧ 𝑦 ∈ 𝑏) → 𝑦 ∈ On)
36	29, 26, 35	syl2anc 592	. . . . . . . . . . . 12 ⊢ ((((𝑎 ∈ On ∧ 𝑏 ∈ On) ∧ (∀𝑐 ∈ 𝑎 ∀𝑑 ∈ 𝑏 (𝑐 ·no 𝑑) = (𝑑 ·no 𝑐) ∧ ∀𝑐 ∈ 𝑎 (𝑐 ·no 𝑏) = (𝑏 ·no 𝑐) ∧ ∀𝑑 ∈ 𝑏 (𝑎 ·no 𝑑) = (𝑑 ·no 𝑎))) ∧ (𝑧 ∈ 𝑎 ∧ 𝑦 ∈ 𝑏)) → 𝑦 ∈ On)
37		nmulcl 36479	. . . . . . . . . . . 12 ⊢ ((𝑦 ∈ On ∧ 𝑎 ∈ On) → (𝑦 ·no 𝑎) ∈ On)
38	36, 30, 37	syl2anc 592	. . . . . . . . . . 11 ⊢ ((((𝑎 ∈ On ∧ 𝑏 ∈ On) ∧ (∀𝑐 ∈ 𝑎 ∀𝑑 ∈ 𝑏 (𝑐 ·no 𝑑) = (𝑑 ·no 𝑐) ∧ ∀𝑐 ∈ 𝑎 (𝑐 ·no 𝑏) = (𝑏 ·no 𝑐) ∧ ∀𝑑 ∈ 𝑏 (𝑎 ·no 𝑑) = (𝑑 ·no 𝑎))) ∧ (𝑧 ∈ 𝑎 ∧ 𝑦 ∈ 𝑏)) → (𝑦 ·no 𝑎) ∈ On)
39		naddcom 8637	. . . . . . . . . . 11 ⊢ (((𝑏 ·no 𝑧) ∈ On ∧ (𝑦 ·no 𝑎) ∈ On) → ((𝑏 ·no 𝑧) +no (𝑦 ·no 𝑎)) = ((𝑦 ·no 𝑎) +no (𝑏 ·no 𝑧)))
40	34, 38, 39	syl2anc 592	. . . . . . . . . 10 ⊢ ((((𝑎 ∈ On ∧ 𝑏 ∈ On) ∧ (∀𝑐 ∈ 𝑎 ∀𝑑 ∈ 𝑏 (𝑐 ·no 𝑑) = (𝑑 ·no 𝑐) ∧ ∀𝑐 ∈ 𝑎 (𝑐 ·no 𝑏) = (𝑏 ·no 𝑐) ∧ ∀𝑑 ∈ 𝑏 (𝑎 ·no 𝑑) = (𝑑 ·no 𝑎))) ∧ (𝑧 ∈ 𝑎 ∧ 𝑦 ∈ 𝑏)) → ((𝑏 ·no 𝑧) +no (𝑦 ·no 𝑎)) = ((𝑦 ·no 𝑎) +no (𝑏 ·no 𝑧)))
41	28, 40	eqtrd 2787	. . . . . . . . 9 ⊢ ((((𝑎 ∈ On ∧ 𝑏 ∈ On) ∧ (∀𝑐 ∈ 𝑎 ∀𝑑 ∈ 𝑏 (𝑐 ·no 𝑑) = (𝑑 ·no 𝑐) ∧ ∀𝑐 ∈ 𝑎 (𝑐 ·no 𝑏) = (𝑏 ·no 𝑐) ∧ ∀𝑑 ∈ 𝑏 (𝑎 ·no 𝑑) = (𝑑 ·no 𝑎))) ∧ (𝑧 ∈ 𝑎 ∧ 𝑦 ∈ 𝑏)) → ((𝑧 ·no 𝑏) +no (𝑎 ·no 𝑦)) = ((𝑦 ·no 𝑎) +no (𝑏 ·no 𝑧)))
42		oveq1 7388	. . . . . . . . . . . 12 ⊢ (𝑐 = 𝑧 → (𝑐 ·no 𝑑) = (𝑧 ·no 𝑑))
43		oveq2 7389	. . . . . . . . . . . 12 ⊢ (𝑐 = 𝑧 → (𝑑 ·no 𝑐) = (𝑑 ·no 𝑧))
44	42, 43	eqeq12d 2768	. . . . . . . . . . 11 ⊢ (𝑐 = 𝑧 → ((𝑐 ·no 𝑑) = (𝑑 ·no 𝑐) ↔ (𝑧 ·no 𝑑) = (𝑑 ·no 𝑧)))
45		oveq2 7389	. . . . . . . . . . . 12 ⊢ (𝑑 = 𝑦 → (𝑧 ·no 𝑑) = (𝑧 ·no 𝑦))
46		oveq1 7388	. . . . . . . . . . . 12 ⊢ (𝑑 = 𝑦 → (𝑑 ·no 𝑧) = (𝑦 ·no 𝑧))
47	45, 46	eqeq12d 2768	. . . . . . . . . . 11 ⊢ (𝑑 = 𝑦 → ((𝑧 ·no 𝑑) = (𝑑 ·no 𝑧) ↔ (𝑧 ·no 𝑦) = (𝑦 ·no 𝑧)))
48		simplr1 1225	. . . . . . . . . . 11 ⊢ ((((𝑎 ∈ On ∧ 𝑏 ∈ On) ∧ (∀𝑐 ∈ 𝑎 ∀𝑑 ∈ 𝑏 (𝑐 ·no 𝑑) = (𝑑 ·no 𝑐) ∧ ∀𝑐 ∈ 𝑎 (𝑐 ·no 𝑏) = (𝑏 ·no 𝑐) ∧ ∀𝑑 ∈ 𝑏 (𝑎 ·no 𝑑) = (𝑑 ·no 𝑎))) ∧ (𝑧 ∈ 𝑎 ∧ 𝑦 ∈ 𝑏)) → ∀𝑐 ∈ 𝑎 ∀𝑑 ∈ 𝑏 (𝑐 ·no 𝑑) = (𝑑 ·no 𝑐))
49	44, 47, 48, 20, 26	rspc2dv 3587	. . . . . . . . . 10 ⊢ ((((𝑎 ∈ On ∧ 𝑏 ∈ On) ∧ (∀𝑐 ∈ 𝑎 ∀𝑑 ∈ 𝑏 (𝑐 ·no 𝑑) = (𝑑 ·no 𝑐) ∧ ∀𝑐 ∈ 𝑎 (𝑐 ·no 𝑏) = (𝑏 ·no 𝑐) ∧ ∀𝑑 ∈ 𝑏 (𝑎 ·no 𝑑) = (𝑑 ·no 𝑎))) ∧ (𝑧 ∈ 𝑎 ∧ 𝑦 ∈ 𝑏)) → (𝑧 ·no 𝑦) = (𝑦 ·no 𝑧))
50	49	oveq2d 7397	. . . . . . . . 9 ⊢ ((((𝑎 ∈ On ∧ 𝑏 ∈ On) ∧ (∀𝑐 ∈ 𝑎 ∀𝑑 ∈ 𝑏 (𝑐 ·no 𝑑) = (𝑑 ·no 𝑐) ∧ ∀𝑐 ∈ 𝑎 (𝑐 ·no 𝑏) = (𝑏 ·no 𝑐) ∧ ∀𝑑 ∈ 𝑏 (𝑎 ·no 𝑑) = (𝑑 ·no 𝑎))) ∧ (𝑧 ∈ 𝑎 ∧ 𝑦 ∈ 𝑏)) → (𝑥 +no (𝑧 ·no 𝑦)) = (𝑥 +no (𝑦 ·no 𝑧)))
51	41, 50	eleq12d 2846	. . . . . . . 8 ⊢ ((((𝑎 ∈ On ∧ 𝑏 ∈ On) ∧ (∀𝑐 ∈ 𝑎 ∀𝑑 ∈ 𝑏 (𝑐 ·no 𝑑) = (𝑑 ·no 𝑐) ∧ ∀𝑐 ∈ 𝑎 (𝑐 ·no 𝑏) = (𝑏 ·no 𝑐) ∧ ∀𝑑 ∈ 𝑏 (𝑎 ·no 𝑑) = (𝑑 ·no 𝑎))) ∧ (𝑧 ∈ 𝑎 ∧ 𝑦 ∈ 𝑏)) → (((𝑧 ·no 𝑏) +no (𝑎 ·no 𝑦)) ∈ (𝑥 +no (𝑧 ·no 𝑦)) ↔ ((𝑦 ·no 𝑎) +no (𝑏 ·no 𝑧)) ∈ (𝑥 +no (𝑦 ·no 𝑧))))
52	51	2ralbidva 3214	. . . . . . 7 ⊢ (((𝑎 ∈ On ∧ 𝑏 ∈ On) ∧ (∀𝑐 ∈ 𝑎 ∀𝑑 ∈ 𝑏 (𝑐 ·no 𝑑) = (𝑑 ·no 𝑐) ∧ ∀𝑐 ∈ 𝑎 (𝑐 ·no 𝑏) = (𝑏 ·no 𝑐) ∧ ∀𝑑 ∈ 𝑏 (𝑎 ·no 𝑑) = (𝑑 ·no 𝑎))) → (∀𝑧 ∈ 𝑎 ∀𝑦 ∈ 𝑏 ((𝑧 ·no 𝑏) +no (𝑎 ·no 𝑦)) ∈ (𝑥 +no (𝑧 ·no 𝑦)) ↔ ∀𝑧 ∈ 𝑎 ∀𝑦 ∈ 𝑏 ((𝑦 ·no 𝑎) +no (𝑏 ·no 𝑧)) ∈ (𝑥 +no (𝑦 ·no 𝑧))))
53		ralcom 3280	. . . . . . 7 ⊢ (∀𝑧 ∈ 𝑎 ∀𝑦 ∈ 𝑏 ((𝑦 ·no 𝑎) +no (𝑏 ·no 𝑧)) ∈ (𝑥 +no (𝑦 ·no 𝑧)) ↔ ∀𝑦 ∈ 𝑏 ∀𝑧 ∈ 𝑎 ((𝑦 ·no 𝑎) +no (𝑏 ·no 𝑧)) ∈ (𝑥 +no (𝑦 ·no 𝑧)))
54	52, 53	bitrdi 289	. . . . . 6 ⊢ (((𝑎 ∈ On ∧ 𝑏 ∈ On) ∧ (∀𝑐 ∈ 𝑎 ∀𝑑 ∈ 𝑏 (𝑐 ·no 𝑑) = (𝑑 ·no 𝑐) ∧ ∀𝑐 ∈ 𝑎 (𝑐 ·no 𝑏) = (𝑏 ·no 𝑐) ∧ ∀𝑑 ∈ 𝑏 (𝑎 ·no 𝑑) = (𝑑 ·no 𝑎))) → (∀𝑧 ∈ 𝑎 ∀𝑦 ∈ 𝑏 ((𝑧 ·no 𝑏) +no (𝑎 ·no 𝑦)) ∈ (𝑥 +no (𝑧 ·no 𝑦)) ↔ ∀𝑦 ∈ 𝑏 ∀𝑧 ∈ 𝑎 ((𝑦 ·no 𝑎) +no (𝑏 ·no 𝑧)) ∈ (𝑥 +no (𝑦 ·no 𝑧))))
55	54	rabbidv 3411	. . . . 5 ⊢ (((𝑎 ∈ On ∧ 𝑏 ∈ On) ∧ (∀𝑐 ∈ 𝑎 ∀𝑑 ∈ 𝑏 (𝑐 ·no 𝑑) = (𝑑 ·no 𝑐) ∧ ∀𝑐 ∈ 𝑎 (𝑐 ·no 𝑏) = (𝑏 ·no 𝑐) ∧ ∀𝑑 ∈ 𝑏 (𝑎 ·no 𝑑) = (𝑑 ·no 𝑎))) → {𝑥 ∈ On ∣ ∀𝑧 ∈ 𝑎 ∀𝑦 ∈ 𝑏 ((𝑧 ·no 𝑏) +no (𝑎 ·no 𝑦)) ∈ (𝑥 +no (𝑧 ·no 𝑦))} = {𝑥 ∈ On ∣ ∀𝑦 ∈ 𝑏 ∀𝑧 ∈ 𝑎 ((𝑦 ·no 𝑎) +no (𝑏 ·no 𝑧)) ∈ (𝑥 +no (𝑦 ·no 𝑧))})
56	55	inteqd 4900	. . . 4 ⊢ (((𝑎 ∈ On ∧ 𝑏 ∈ On) ∧ (∀𝑐 ∈ 𝑎 ∀𝑑 ∈ 𝑏 (𝑐 ·no 𝑑) = (𝑑 ·no 𝑐) ∧ ∀𝑐 ∈ 𝑎 (𝑐 ·no 𝑏) = (𝑏 ·no 𝑐) ∧ ∀𝑑 ∈ 𝑏 (𝑎 ·no 𝑑) = (𝑑 ·no 𝑎))) → ∩ {𝑥 ∈ On ∣ ∀𝑧 ∈ 𝑎 ∀𝑦 ∈ 𝑏 ((𝑧 ·no 𝑏) +no (𝑎 ·no 𝑦)) ∈ (𝑥 +no (𝑧 ·no 𝑦))} = ∩ {𝑥 ∈ On ∣ ∀𝑦 ∈ 𝑏 ∀𝑧 ∈ 𝑎 ((𝑦 ·no 𝑎) +no (𝑏 ·no 𝑧)) ∈ (𝑥 +no (𝑦 ·no 𝑧))})
57		nmulval 36480	. . . . 5 ⊢ ((𝑎 ∈ On ∧ 𝑏 ∈ On) → (𝑎 ·no 𝑏) = ∩ {𝑥 ∈ On ∣ ∀𝑧 ∈ 𝑎 ∀𝑦 ∈ 𝑏 ((𝑧 ·no 𝑏) +no (𝑎 ·no 𝑦)) ∈ (𝑥 +no (𝑧 ·no 𝑦))})
58	57	adantr 483	. . . 4 ⊢ (((𝑎 ∈ On ∧ 𝑏 ∈ On) ∧ (∀𝑐 ∈ 𝑎 ∀𝑑 ∈ 𝑏 (𝑐 ·no 𝑑) = (𝑑 ·no 𝑐) ∧ ∀𝑐 ∈ 𝑎 (𝑐 ·no 𝑏) = (𝑏 ·no 𝑐) ∧ ∀𝑑 ∈ 𝑏 (𝑎 ·no 𝑑) = (𝑑 ·no 𝑎))) → (𝑎 ·no 𝑏) = ∩ {𝑥 ∈ On ∣ ∀𝑧 ∈ 𝑎 ∀𝑦 ∈ 𝑏 ((𝑧 ·no 𝑏) +no (𝑎 ·no 𝑦)) ∈ (𝑥 +no (𝑧 ·no 𝑦))})
59		nmulval 36480	. . . . . 6 ⊢ ((𝑏 ∈ On ∧ 𝑎 ∈ On) → (𝑏 ·no 𝑎) = ∩ {𝑥 ∈ On ∣ ∀𝑦 ∈ 𝑏 ∀𝑧 ∈ 𝑎 ((𝑦 ·no 𝑎) +no (𝑏 ·no 𝑧)) ∈ (𝑥 +no (𝑦 ·no 𝑧))})
60	59	ancoms 461	. . . . 5 ⊢ ((𝑎 ∈ On ∧ 𝑏 ∈ On) → (𝑏 ·no 𝑎) = ∩ {𝑥 ∈ On ∣ ∀𝑦 ∈ 𝑏 ∀𝑧 ∈ 𝑎 ((𝑦 ·no 𝑎) +no (𝑏 ·no 𝑧)) ∈ (𝑥 +no (𝑦 ·no 𝑧))})
61	60	adantr 483	. . . 4 ⊢ (((𝑎 ∈ On ∧ 𝑏 ∈ On) ∧ (∀𝑐 ∈ 𝑎 ∀𝑑 ∈ 𝑏 (𝑐 ·no 𝑑) = (𝑑 ·no 𝑐) ∧ ∀𝑐 ∈ 𝑎 (𝑐 ·no 𝑏) = (𝑏 ·no 𝑐) ∧ ∀𝑑 ∈ 𝑏 (𝑎 ·no 𝑑) = (𝑑 ·no 𝑎))) → (𝑏 ·no 𝑎) = ∩ {𝑥 ∈ On ∣ ∀𝑦 ∈ 𝑏 ∀𝑧 ∈ 𝑎 ((𝑦 ·no 𝑎) +no (𝑏 ·no 𝑧)) ∈ (𝑥 +no (𝑦 ·no 𝑧))})
62	56, 58, 61	3eqtr4d 2797	. . 3 ⊢ (((𝑎 ∈ On ∧ 𝑏 ∈ On) ∧ (∀𝑐 ∈ 𝑎 ∀𝑑 ∈ 𝑏 (𝑐 ·no 𝑑) = (𝑑 ·no 𝑐) ∧ ∀𝑐 ∈ 𝑎 (𝑐 ·no 𝑏) = (𝑏 ·no 𝑐) ∧ ∀𝑑 ∈ 𝑏 (𝑎 ·no 𝑑) = (𝑑 ·no 𝑎))) → (𝑎 ·no 𝑏) = (𝑏 ·no 𝑎))
63	62	ex 415	. 2 ⊢ ((𝑎 ∈ On ∧ 𝑏 ∈ On) → ((∀𝑐 ∈ 𝑎 ∀𝑑 ∈ 𝑏 (𝑐 ·no 𝑑) = (𝑑 ·no 𝑐) ∧ ∀𝑐 ∈ 𝑎 (𝑐 ·no 𝑏) = (𝑏 ·no 𝑐) ∧ ∀𝑑 ∈ 𝑏 (𝑎 ·no 𝑑) = (𝑑 ·no 𝑎)) → (𝑎 ·no 𝑏) = (𝑏 ·no 𝑎)))
64	3, 6, 9, 12, 15, 63	on2ind 8623	1 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ·no 𝐵) = (𝐵 ·no 𝐴))

Syntax hints:   → wi 4   ∧ wa 398   ∧ w3a 1095   = wceq 1550   ∈ wcel 2132  ∀wral 3066  {crab 3404  ∩ cint 4895  Oncon0 6331  (class class class)co 7381   +no cnadd 8619   ·_no cnmul 36475

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1805  ax-4 1819  ax-5 1920  ax-6 1977  ax-7 2018  ax-8 2134  ax-9 2142  ax-10 2165  ax-11 2181  ax-12 2202  ax-ext 2724  ax-rep 5217  ax-sep 5236  ax-nul 5246  ax-pow 5312  ax-pr 5380  ax-un 7703

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 857  df-3or 1096  df-3an 1097  df-tru 1553  df-fal 1563  df-ex 1790  df-nf 1794  df-sb 2081  df-mo 2556  df-eu 2586  df-clab 2731  df-cleq 2744  df-clel 2827  df-nfc 2901  df-ne 2948  df-ral 3067  df-rex 3077  df-reu 3358  df-rab 3405  df-v 3446  df-sbc 3736  df-csb 3844  df-dif 3898  df-un 3900  df-in 3902  df-ss 3912  df-pss 3915  df-nul 4277  df-if 4471  df-pw 4547  df-sn 4573  df-pr 4575  df-op 4579  df-uni 4856  df-int 4896  df-iun 4941  df-br 5091  df-opab 5153  df-mpt 5172  df-tr 5198  df-id 5531  df-eprel 5536  df-po 5544  df-so 5545  df-fr 5589  df-se 5590  df-we 5591  df-xp 5642  df-rel 5643  df-cnv 5644  df-co 5645  df-dm 5646  df-rn 5647  df-res 5648  df-ima 5649  df-pred 6273  df-ord 6334  df-on 6335  df-suc 6337  df-iota 6462  df-fun 6508  df-fn 6509  df-f 6510  df-f1 6511  df-fo 6512  df-f1o 6513  df-fv 6514  df-ov 7384  df-oprab 7385  df-mpo 7386  df-1st 7955  df-2nd 7956  df-frecs 8246  df-nadd 8620  df-nmul 36476

This theorem is referenced by:  nmull0  36484