Users' Mathboxes Mathbox for Scott Fenton < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  nmulcom Structured version   Visualization version   GIF version

Theorem nmulcom 36640
Description: Natural multiplication is commutative. (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.
StepHypRef Expression
1 oveq1 7417 . . 3 (𝑎 = 𝑐 → (𝑎 ·no 𝑏) = (𝑐 ·no 𝑏))
2 oveq2 7418 . . 3 (𝑎 = 𝑐 → (𝑏 ·no 𝑎) = (𝑏 ·no 𝑐))
31, 2eqeq12d 2777 . 2 (𝑎 = 𝑐 → ((𝑎 ·no 𝑏) = (𝑏 ·no 𝑎) ↔ (𝑐 ·no 𝑏) = (𝑏 ·no 𝑐)))
4 oveq2 7418 . . 3 (𝑏 = 𝑑 → (𝑐 ·no 𝑏) = (𝑐 ·no 𝑑))
5 oveq1 7417 . . 3 (𝑏 = 𝑑 → (𝑏 ·no 𝑐) = (𝑑 ·no 𝑐))
64, 5eqeq12d 2777 . 2 (𝑏 = 𝑑 → ((𝑐 ·no 𝑏) = (𝑏 ·no 𝑐) ↔ (𝑐 ·no 𝑑) = (𝑑 ·no 𝑐)))
7 oveq1 7417 . . 3 (𝑎 = 𝑐 → (𝑎 ·no 𝑑) = (𝑐 ·no 𝑑))
8 oveq2 7418 . . 3 (𝑎 = 𝑐 → (𝑑 ·no 𝑎) = (𝑑 ·no 𝑐))
97, 8eqeq12d 2777 . 2 (𝑎 = 𝑐 → ((𝑎 ·no 𝑑) = (𝑑 ·no 𝑎) ↔ (𝑐 ·no 𝑑) = (𝑑 ·no 𝑐)))
10 oveq1 7417 . . 3 (𝑎 = 𝐴 → (𝑎 ·no 𝑏) = (𝐴 ·no 𝑏))
11 oveq2 7418 . . 3 (𝑎 = 𝐴 → (𝑏 ·no 𝑎) = (𝑏 ·no 𝐴))
1210, 11eqeq12d 2777 . 2 (𝑎 = 𝐴 → ((𝑎 ·no 𝑏) = (𝑏 ·no 𝑎) ↔ (𝐴 ·no 𝑏) = (𝑏 ·no 𝐴)))
13 oveq2 7418 . . 3 (𝑏 = 𝐵 → (𝐴 ·no 𝑏) = (𝐴 ·no 𝐵))
14 oveq1 7417 . . 3 (𝑏 = 𝐵 → (𝑏 ·no 𝐴) = (𝐵 ·no 𝐴))
1513, 14eqeq12d 2777 . 2 (𝑏 = 𝐵 → ((𝐴 ·no 𝑏) = (𝑏 ·no 𝐴) ↔ (𝐴 ·no 𝐵) = (𝐵 ·no 𝐴)))
16 oveq1 7417 . . . . . . . . . . . . 13 (𝑐 = 𝑧 → (𝑐 ·no 𝑏) = (𝑧 ·no 𝑏))
17 oveq2 7418 . . . . . . . . . . . . 13 (𝑐 = 𝑧 → (𝑏 ·no 𝑐) = (𝑏 ·no 𝑧))
1816, 17eqeq12d 2777 . . . . . . . . . . . 12 (𝑐 = 𝑧 → ((𝑐 ·no 𝑏) = (𝑏 ·no 𝑐) ↔ (𝑧 ·no 𝑏) = (𝑏 ·no 𝑧)))
19 simplr2 1233 . . . . . . . . . . . 12 ((((𝑎 ∈ On ∧ 𝑏 ∈ On) ∧ (∀𝑐𝑎𝑑𝑏 (𝑐 ·no 𝑑) = (𝑑 ·no 𝑐) ∧ ∀𝑐𝑎 (𝑐 ·no 𝑏) = (𝑏 ·no 𝑐) ∧ ∀𝑑𝑏 (𝑎 ·no 𝑑) = (𝑑 ·no 𝑎))) ∧ (𝑧𝑎𝑦𝑏)) → ∀𝑐𝑎 (𝑐 ·no 𝑏) = (𝑏 ·no 𝑐))
20 simprl 782 . . . . . . . . . . . 12 ((((𝑎 ∈ On ∧ 𝑏 ∈ On) ∧ (∀𝑐𝑎𝑑𝑏 (𝑐 ·no 𝑑) = (𝑑 ·no 𝑐) ∧ ∀𝑐𝑎 (𝑐 ·no 𝑏) = (𝑏 ·no 𝑐) ∧ ∀𝑑𝑏 (𝑎 ·no 𝑑) = (𝑑 ·no 𝑎))) ∧ (𝑧𝑎𝑦𝑏)) → 𝑧𝑎)
2118, 19, 20rspcdva 3581 . . . . . . . . . . 11 ((((𝑎 ∈ On ∧ 𝑏 ∈ On) ∧ (∀𝑐𝑎𝑑𝑏 (𝑐 ·no 𝑑) = (𝑑 ·no 𝑐) ∧ ∀𝑐𝑎 (𝑐 ·no 𝑏) = (𝑏 ·no 𝑐) ∧ ∀𝑑𝑏 (𝑎 ·no 𝑑) = (𝑑 ·no 𝑎))) ∧ (𝑧𝑎𝑦𝑏)) → (𝑧 ·no 𝑏) = (𝑏 ·no 𝑧))
22 oveq2 7418 . . . . . . . . . . . . 13 (𝑑 = 𝑦 → (𝑎 ·no 𝑑) = (𝑎 ·no 𝑦))
23 oveq1 7417 . . . . . . . . . . . . 13 (𝑑 = 𝑦 → (𝑑 ·no 𝑎) = (𝑦 ·no 𝑎))
2422, 23eqeq12d 2777 . . . . . . . . . . . 12 (𝑑 = 𝑦 → ((𝑎 ·no 𝑑) = (𝑑 ·no 𝑎) ↔ (𝑎 ·no 𝑦) = (𝑦 ·no 𝑎)))
25 simplr3 1234 . . . . . . . . . . . 12 ((((𝑎 ∈ On ∧ 𝑏 ∈ On) ∧ (∀𝑐𝑎𝑑𝑏 (𝑐 ·no 𝑑) = (𝑑 ·no 𝑐) ∧ ∀𝑐𝑎 (𝑐 ·no 𝑏) = (𝑏 ·no 𝑐) ∧ ∀𝑑𝑏 (𝑎 ·no 𝑑) = (𝑑 ·no 𝑎))) ∧ (𝑧𝑎𝑦𝑏)) → ∀𝑑𝑏 (𝑎 ·no 𝑑) = (𝑑 ·no 𝑎))
26 simprr 784 . . . . . . . . . . . 12 ((((𝑎 ∈ On ∧ 𝑏 ∈ On) ∧ (∀𝑐𝑎𝑑𝑏 (𝑐 ·no 𝑑) = (𝑑 ·no 𝑐) ∧ ∀𝑐𝑎 (𝑐 ·no 𝑏) = (𝑏 ·no 𝑐) ∧ ∀𝑑𝑏 (𝑎 ·no 𝑑) = (𝑑 ·no 𝑎))) ∧ (𝑧𝑎𝑦𝑏)) → 𝑦𝑏)
2724, 25, 26rspcdva 3581 . . . . . . . . . . 11 ((((𝑎 ∈ On ∧ 𝑏 ∈ On) ∧ (∀𝑐𝑎𝑑𝑏 (𝑐 ·no 𝑑) = (𝑑 ·no 𝑐) ∧ ∀𝑐𝑎 (𝑐 ·no 𝑏) = (𝑏 ·no 𝑐) ∧ ∀𝑑𝑏 (𝑎 ·no 𝑑) = (𝑑 ·no 𝑎))) ∧ (𝑧𝑎𝑦𝑏)) → (𝑎 ·no 𝑦) = (𝑦 ·no 𝑎))
2821, 27oveq12d 7428 . . . . . . . . . 10 ((((𝑎 ∈ On ∧ 𝑏 ∈ On) ∧ (∀𝑐𝑎𝑑𝑏 (𝑐 ·no 𝑑) = (𝑑 ·no 𝑐) ∧ ∀𝑐𝑎 (𝑐 ·no 𝑏) = (𝑏 ·no 𝑐) ∧ ∀𝑑𝑏 (𝑎 ·no 𝑑) = (𝑑 ·no 𝑎))) ∧ (𝑧𝑎𝑦𝑏)) → ((𝑧 ·no 𝑏) +no (𝑎 ·no 𝑦)) = ((𝑏 ·no 𝑧) +no (𝑦 ·no 𝑎)))
29 simpllr 787 . . . . . . . . . . . 12 ((((𝑎 ∈ On ∧ 𝑏 ∈ On) ∧ (∀𝑐𝑎𝑑𝑏 (𝑐 ·no 𝑑) = (𝑑 ·no 𝑐) ∧ ∀𝑐𝑎 (𝑐 ·no 𝑏) = (𝑏 ·no 𝑐) ∧ ∀𝑑𝑏 (𝑎 ·no 𝑑) = (𝑑 ·no 𝑎))) ∧ (𝑧𝑎𝑦𝑏)) → 𝑏 ∈ On)
30 simplll 786 . . . . . . . . . . . . 13 ((((𝑎 ∈ On ∧ 𝑏 ∈ On) ∧ (∀𝑐𝑎𝑑𝑏 (𝑐 ·no 𝑑) = (𝑑 ·no 𝑐) ∧ ∀𝑐𝑎 (𝑐 ·no 𝑏) = (𝑏 ·no 𝑐) ∧ ∀𝑑𝑏 (𝑎 ·no 𝑑) = (𝑑 ·no 𝑎))) ∧ (𝑧𝑎𝑦𝑏)) → 𝑎 ∈ On)
31 onelon 6385 . . . . . . . . . . . . 13 ((𝑎 ∈ On ∧ 𝑧𝑎) → 𝑧 ∈ On)
3230, 20, 31syl2anc 595 . . . . . . . . . . . 12 ((((𝑎 ∈ On ∧ 𝑏 ∈ On) ∧ (∀𝑐𝑎𝑑𝑏 (𝑐 ·no 𝑑) = (𝑑 ·no 𝑐) ∧ ∀𝑐𝑎 (𝑐 ·no 𝑏) = (𝑏 ·no 𝑐) ∧ ∀𝑑𝑏 (𝑎 ·no 𝑑) = (𝑑 ·no 𝑎))) ∧ (𝑧𝑎𝑦𝑏)) → 𝑧 ∈ On)
33 nmulcl 36637 . . . . . . . . . . . 12 ((𝑏 ∈ On ∧ 𝑧 ∈ On) → (𝑏 ·no 𝑧) ∈ On)
3429, 32, 33syl2anc 595 . . . . . . . . . . 11 ((((𝑎 ∈ On ∧ 𝑏 ∈ On) ∧ (∀𝑐𝑎𝑑𝑏 (𝑐 ·no 𝑑) = (𝑑 ·no 𝑐) ∧ ∀𝑐𝑎 (𝑐 ·no 𝑏) = (𝑏 ·no 𝑐) ∧ ∀𝑑𝑏 (𝑎 ·no 𝑑) = (𝑑 ·no 𝑎))) ∧ (𝑧𝑎𝑦𝑏)) → (𝑏 ·no 𝑧) ∈ On)
35 onelon 6385 . . . . . . . . . . . . 13 ((𝑏 ∈ On ∧ 𝑦𝑏) → 𝑦 ∈ On)
3629, 26, 35syl2anc 595 . . . . . . . . . . . 12 ((((𝑎 ∈ On ∧ 𝑏 ∈ On) ∧ (∀𝑐𝑎𝑑𝑏 (𝑐 ·no 𝑑) = (𝑑 ·no 𝑐) ∧ ∀𝑐𝑎 (𝑐 ·no 𝑏) = (𝑏 ·no 𝑐) ∧ ∀𝑑𝑏 (𝑎 ·no 𝑑) = (𝑑 ·no 𝑎))) ∧ (𝑧𝑎𝑦𝑏)) → 𝑦 ∈ On)
37 nmulcl 36637 . . . . . . . . . . . 12 ((𝑦 ∈ On ∧ 𝑎 ∈ On) → (𝑦 ·no 𝑎) ∈ On)
3836, 30, 37syl2anc 595 . . . . . . . . . . 11 ((((𝑎 ∈ On ∧ 𝑏 ∈ On) ∧ (∀𝑐𝑎𝑑𝑏 (𝑐 ·no 𝑑) = (𝑑 ·no 𝑐) ∧ ∀𝑐𝑎 (𝑐 ·no 𝑏) = (𝑏 ·no 𝑐) ∧ ∀𝑑𝑏 (𝑎 ·no 𝑑) = (𝑑 ·no 𝑎))) ∧ (𝑧𝑎𝑦𝑏)) → (𝑦 ·no 𝑎) ∈ On)
39 naddcom 8668 . . . . . . . . . . 11 (((𝑏 ·no 𝑧) ∈ On ∧ (𝑦 ·no 𝑎) ∈ On) → ((𝑏 ·no 𝑧) +no (𝑦 ·no 𝑎)) = ((𝑦 ·no 𝑎) +no (𝑏 ·no 𝑧)))
4034, 38, 39syl2anc 595 . . . . . . . . . 10 ((((𝑎 ∈ On ∧ 𝑏 ∈ On) ∧ (∀𝑐𝑎𝑑𝑏 (𝑐 ·no 𝑑) = (𝑑 ·no 𝑐) ∧ ∀𝑐𝑎 (𝑐 ·no 𝑏) = (𝑏 ·no 𝑐) ∧ ∀𝑑𝑏 (𝑎 ·no 𝑑) = (𝑑 ·no 𝑎))) ∧ (𝑧𝑎𝑦𝑏)) → ((𝑏 ·no 𝑧) +no (𝑦 ·no 𝑎)) = ((𝑦 ·no 𝑎) +no (𝑏 ·no 𝑧)))
4128, 40eqtrd 2796 . . . . . . . . 9 ((((𝑎 ∈ On ∧ 𝑏 ∈ On) ∧ (∀𝑐𝑎𝑑𝑏 (𝑐 ·no 𝑑) = (𝑑 ·no 𝑐) ∧ ∀𝑐𝑎 (𝑐 ·no 𝑏) = (𝑏 ·no 𝑐) ∧ ∀𝑑𝑏 (𝑎 ·no 𝑑) = (𝑑 ·no 𝑎))) ∧ (𝑧𝑎𝑦𝑏)) → ((𝑧 ·no 𝑏) +no (𝑎 ·no 𝑦)) = ((𝑦 ·no 𝑎) +no (𝑏 ·no 𝑧)))
42 oveq1 7417 . . . . . . . . . . . 12 (𝑐 = 𝑧 → (𝑐 ·no 𝑑) = (𝑧 ·no 𝑑))
43 oveq2 7418 . . . . . . . . . . . 12 (𝑐 = 𝑧 → (𝑑 ·no 𝑐) = (𝑑 ·no 𝑧))
4442, 43eqeq12d 2777 . . . . . . . . . . 11 (𝑐 = 𝑧 → ((𝑐 ·no 𝑑) = (𝑑 ·no 𝑐) ↔ (𝑧 ·no 𝑑) = (𝑑 ·no 𝑧)))
45 oveq2 7418 . . . . . . . . . . . 12 (𝑑 = 𝑦 → (𝑧 ·no 𝑑) = (𝑧 ·no 𝑦))
46 oveq1 7417 . . . . . . . . . . . 12 (𝑑 = 𝑦 → (𝑑 ·no 𝑧) = (𝑦 ·no 𝑧))
4745, 46eqeq12d 2777 . . . . . . . . . . 11 (𝑑 = 𝑦 → ((𝑧 ·no 𝑑) = (𝑑 ·no 𝑧) ↔ (𝑧 ·no 𝑦) = (𝑦 ·no 𝑧)))
48 simplr1 1232 . . . . . . . . . . 11 ((((𝑎 ∈ On ∧ 𝑏 ∈ On) ∧ (∀𝑐𝑎𝑑𝑏 (𝑐 ·no 𝑑) = (𝑑 ·no 𝑐) ∧ ∀𝑐𝑎 (𝑐 ·no 𝑏) = (𝑏 ·no 𝑐) ∧ ∀𝑑𝑏 (𝑎 ·no 𝑑) = (𝑑 ·no 𝑎))) ∧ (𝑧𝑎𝑦𝑏)) → ∀𝑐𝑎𝑑𝑏 (𝑐 ·no 𝑑) = (𝑑 ·no 𝑐))
4944, 47, 48, 20, 26rspc2dv 3595 . . . . . . . . . 10 ((((𝑎 ∈ On ∧ 𝑏 ∈ On) ∧ (∀𝑐𝑎𝑑𝑏 (𝑐 ·no 𝑑) = (𝑑 ·no 𝑐) ∧ ∀𝑐𝑎 (𝑐 ·no 𝑏) = (𝑏 ·no 𝑐) ∧ ∀𝑑𝑏 (𝑎 ·no 𝑑) = (𝑑 ·no 𝑎))) ∧ (𝑧𝑎𝑦𝑏)) → (𝑧 ·no 𝑦) = (𝑦 ·no 𝑧))
5049oveq2d 7426 . . . . . . . . 9 ((((𝑎 ∈ On ∧ 𝑏 ∈ On) ∧ (∀𝑐𝑎𝑑𝑏 (𝑐 ·no 𝑑) = (𝑑 ·no 𝑐) ∧ ∀𝑐𝑎 (𝑐 ·no 𝑏) = (𝑏 ·no 𝑐) ∧ ∀𝑑𝑏 (𝑎 ·no 𝑑) = (𝑑 ·no 𝑎))) ∧ (𝑧𝑎𝑦𝑏)) → (𝑥 +no (𝑧 ·no 𝑦)) = (𝑥 +no (𝑦 ·no 𝑧)))
5141, 50eleq12d 2855 . . . . . . . 8 ((((𝑎 ∈ On ∧ 𝑏 ∈ On) ∧ (∀𝑐𝑎𝑑𝑏 (𝑐 ·no 𝑑) = (𝑑 ·no 𝑐) ∧ ∀𝑐𝑎 (𝑐 ·no 𝑏) = (𝑏 ·no 𝑐) ∧ ∀𝑑𝑏 (𝑎 ·no 𝑑) = (𝑑 ·no 𝑎))) ∧ (𝑧𝑎𝑦𝑏)) → (((𝑧 ·no 𝑏) +no (𝑎 ·no 𝑦)) ∈ (𝑥 +no (𝑧 ·no 𝑦)) ↔ ((𝑦 ·no 𝑎) +no (𝑏 ·no 𝑧)) ∈ (𝑥 +no (𝑦 ·no 𝑧))))
52512ralbidva 3225 . . . . . . 7 (((𝑎 ∈ On ∧ 𝑏 ∈ On) ∧ (∀𝑐𝑎𝑑𝑏 (𝑐 ·no 𝑑) = (𝑑 ·no 𝑐) ∧ ∀𝑐𝑎 (𝑐 ·no 𝑏) = (𝑏 ·no 𝑐) ∧ ∀𝑑𝑏 (𝑎 ·no 𝑑) = (𝑑 ·no 𝑎))) → (∀𝑧𝑎𝑦𝑏 ((𝑧 ·no 𝑏) +no (𝑎 ·no 𝑦)) ∈ (𝑥 +no (𝑧 ·no 𝑦)) ↔ ∀𝑧𝑎𝑦𝑏 ((𝑦 ·no 𝑎) +no (𝑏 ·no 𝑧)) ∈ (𝑥 +no (𝑦 ·no 𝑧))))
53 ralcom 3291 . . . . . . 7 (∀𝑧𝑎𝑦𝑏 ((𝑦 ·no 𝑎) +no (𝑏 ·no 𝑧)) ∈ (𝑥 +no (𝑦 ·no 𝑧)) ↔ ∀𝑦𝑏𝑧𝑎 ((𝑦 ·no 𝑎) +no (𝑏 ·no 𝑧)) ∈ (𝑥 +no (𝑦 ·no 𝑧)))
5452, 53bitrdi 290 . . . . . 6 (((𝑎 ∈ On ∧ 𝑏 ∈ On) ∧ (∀𝑐𝑎𝑑𝑏 (𝑐 ·no 𝑑) = (𝑑 ·no 𝑐) ∧ ∀𝑐𝑎 (𝑐 ·no 𝑏) = (𝑏 ·no 𝑐) ∧ ∀𝑑𝑏 (𝑎 ·no 𝑑) = (𝑑 ·no 𝑎))) → (∀𝑧𝑎𝑦𝑏 ((𝑧 ·no 𝑏) +no (𝑎 ·no 𝑦)) ∈ (𝑥 +no (𝑧 ·no 𝑦)) ↔ ∀𝑦𝑏𝑧𝑎 ((𝑦 ·no 𝑎) +no (𝑏 ·no 𝑧)) ∈ (𝑥 +no (𝑦 ·no 𝑧))))
5554rabbidv 3421 . . . . 5 (((𝑎 ∈ On ∧ 𝑏 ∈ On) ∧ (∀𝑐𝑎𝑑𝑏 (𝑐 ·no 𝑑) = (𝑑 ·no 𝑐) ∧ ∀𝑐𝑎 (𝑐 ·no 𝑏) = (𝑏 ·no 𝑐) ∧ ∀𝑑𝑏 (𝑎 ·no 𝑑) = (𝑑 ·no 𝑎))) → {𝑥 ∈ On ∣ ∀𝑧𝑎𝑦𝑏 ((𝑧 ·no 𝑏) +no (𝑎 ·no 𝑦)) ∈ (𝑥 +no (𝑧 ·no 𝑦))} = {𝑥 ∈ On ∣ ∀𝑦𝑏𝑧𝑎 ((𝑦 ·no 𝑎) +no (𝑏 ·no 𝑧)) ∈ (𝑥 +no (𝑦 ·no 𝑧))})
5655inteqd 4916 . . . 4 (((𝑎 ∈ On ∧ 𝑏 ∈ On) ∧ (∀𝑐𝑎𝑑𝑏 (𝑐 ·no 𝑑) = (𝑑 ·no 𝑐) ∧ ∀𝑐𝑎 (𝑐 ·no 𝑏) = (𝑏 ·no 𝑐) ∧ ∀𝑑𝑏 (𝑎 ·no 𝑑) = (𝑑 ·no 𝑎))) → {𝑥 ∈ On ∣ ∀𝑧𝑎𝑦𝑏 ((𝑧 ·no 𝑏) +no (𝑎 ·no 𝑦)) ∈ (𝑥 +no (𝑧 ·no 𝑦))} = {𝑥 ∈ On ∣ ∀𝑦𝑏𝑧𝑎 ((𝑦 ·no 𝑎) +no (𝑏 ·no 𝑧)) ∈ (𝑥 +no (𝑦 ·no 𝑧))})
57 nmulval 36638 . . . . 5 ((𝑎 ∈ On ∧ 𝑏 ∈ On) → (𝑎 ·no 𝑏) = {𝑥 ∈ On ∣ ∀𝑧𝑎𝑦𝑏 ((𝑧 ·no 𝑏) +no (𝑎 ·no 𝑦)) ∈ (𝑥 +no (𝑧 ·no 𝑦))})
5857adantr 485 . . . 4 (((𝑎 ∈ On ∧ 𝑏 ∈ On) ∧ (∀𝑐𝑎𝑑𝑏 (𝑐 ·no 𝑑) = (𝑑 ·no 𝑐) ∧ ∀𝑐𝑎 (𝑐 ·no 𝑏) = (𝑏 ·no 𝑐) ∧ ∀𝑑𝑏 (𝑎 ·no 𝑑) = (𝑑 ·no 𝑎))) → (𝑎 ·no 𝑏) = {𝑥 ∈ On ∣ ∀𝑧𝑎𝑦𝑏 ((𝑧 ·no 𝑏) +no (𝑎 ·no 𝑦)) ∈ (𝑥 +no (𝑧 ·no 𝑦))})
59 nmulval 36638 . . . . . 6 ((𝑏 ∈ On ∧ 𝑎 ∈ On) → (𝑏 ·no 𝑎) = {𝑥 ∈ On ∣ ∀𝑦𝑏𝑧𝑎 ((𝑦 ·no 𝑎) +no (𝑏 ·no 𝑧)) ∈ (𝑥 +no (𝑦 ·no 𝑧))})
6059ancoms 463 . . . . 5 ((𝑎 ∈ On ∧ 𝑏 ∈ On) → (𝑏 ·no 𝑎) = {𝑥 ∈ On ∣ ∀𝑦𝑏𝑧𝑎 ((𝑦 ·no 𝑎) +no (𝑏 ·no 𝑧)) ∈ (𝑥 +no (𝑦 ·no 𝑧))})
6160adantr 485 . . . 4 (((𝑎 ∈ On ∧ 𝑏 ∈ On) ∧ (∀𝑐𝑎𝑑𝑏 (𝑐 ·no 𝑑) = (𝑑 ·no 𝑐) ∧ ∀𝑐𝑎 (𝑐 ·no 𝑏) = (𝑏 ·no 𝑐) ∧ ∀𝑑𝑏 (𝑎 ·no 𝑑) = (𝑑 ·no 𝑎))) → (𝑏 ·no 𝑎) = {𝑥 ∈ On ∣ ∀𝑦𝑏𝑧𝑎 ((𝑦 ·no 𝑎) +no (𝑏 ·no 𝑧)) ∈ (𝑥 +no (𝑦 ·no 𝑧))})
6256, 58, 613eqtr4d 2806 . . 3 (((𝑎 ∈ On ∧ 𝑏 ∈ On) ∧ (∀𝑐𝑎𝑑𝑏 (𝑐 ·no 𝑑) = (𝑑 ·no 𝑐) ∧ ∀𝑐𝑎 (𝑐 ·no 𝑏) = (𝑏 ·no 𝑐) ∧ ∀𝑑𝑏 (𝑎 ·no 𝑑) = (𝑑 ·no 𝑎))) → (𝑎 ·no 𝑏) = (𝑏 ·no 𝑎))
6362ex 417 . 2 ((𝑎 ∈ On ∧ 𝑏 ∈ On) → ((∀𝑐𝑎𝑑𝑏 (𝑐 ·no 𝑑) = (𝑑 ·no 𝑐) ∧ ∀𝑐𝑎 (𝑐 ·no 𝑏) = (𝑏 ·no 𝑐) ∧ ∀𝑑𝑏 (𝑎 ·no 𝑑) = (𝑑 ·no 𝑎)) → (𝑎 ·no 𝑏) = (𝑏 ·no 𝑎)))
643, 6, 9, 12, 15, 63on2ind 8654 1 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ·no 𝐵) = (𝐵 ·no 𝐴))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 400  w3a 1101   = wceq 1568  wcel 2141  wral 3077  {crab 3414   cint 4911  Oncon0 6360  (class class class)co 7410   +no cnadd 8650   ·no cnmul 36633
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-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-1st 7985  df-2nd 7986  df-frecs 8277  df-nadd 8651  df-nmul 36634
This theorem is referenced by:  nmull0  36642
  Copyright terms: Public domain W3C validator