Theorem nmuladdss 36884

Description: Ordering relationship for natural ordinal operations. (Contributed by Scott Fenton, 15-Jul-2026.)

Assertion

Ref	Expression
nmuladdss	⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On) ∧ (𝐶 ⊆ 𝐴 ∧ 𝐷 ⊆ 𝐵)) → ((𝐶 ·no 𝐵) +no (𝐴 ·no 𝐷)) ⊆ ((𝐴 ·no 𝐵) +no (𝐶 ·no 𝐷)))

Proof of Theorem nmuladdss

Step	Hyp	Ref	Expression
1		onsseleq 6393	. . . . . 6 ⊢ ((𝐶 ∈ On ∧ 𝐴 ∈ On) → (𝐶 ⊆ 𝐴 ↔ (𝐶 ∈ 𝐴 ∨ 𝐶 = 𝐴)))
2	1	ancoms 464	. . . . 5 ⊢ ((𝐴 ∈ On ∧ 𝐶 ∈ On) → (𝐶 ⊆ 𝐴 ↔ (𝐶 ∈ 𝐴 ∨ 𝐶 = 𝐴)))
3		onsseleq 6393	. . . . . 6 ⊢ ((𝐷 ∈ On ∧ 𝐵 ∈ On) → (𝐷 ⊆ 𝐵 ↔ (𝐷 ∈ 𝐵 ∨ 𝐷 = 𝐵)))
4	3	ancoms 464	. . . . 5 ⊢ ((𝐵 ∈ On ∧ 𝐷 ∈ On) → (𝐷 ⊆ 𝐵 ↔ (𝐷 ∈ 𝐵 ∨ 𝐷 = 𝐵)))
5	2, 4	bi2anan9 650	. . . 4 ⊢ (((𝐴 ∈ On ∧ 𝐶 ∈ On) ∧ (𝐵 ∈ On ∧ 𝐷 ∈ On)) → ((𝐶 ⊆ 𝐴 ∧ 𝐷 ⊆ 𝐵) ↔ ((𝐶 ∈ 𝐴 ∨ 𝐶 = 𝐴) ∧ (𝐷 ∈ 𝐵 ∨ 𝐷 = 𝐵))))
6	5	an4s 673	. . 3 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → ((𝐶 ⊆ 𝐴 ∧ 𝐷 ⊆ 𝐵) ↔ ((𝐶 ∈ 𝐴 ∨ 𝐶 = 𝐴) ∧ (𝐷 ∈ 𝐵 ∨ 𝐷 = 𝐵))))
7		nmulcl 36862	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ·no 𝐵) ∈ On)
8	7	adantr 486	. . . . . . . . . . . 12 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵)) → (𝐴 ·no 𝐵) ∈ On)
9		onelon 6376	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ∈ On ∧ 𝐶 ∈ 𝐴) → 𝐶 ∈ On)
10		onelon 6376	. . . . . . . . . . . . . 14 ⊢ ((𝐵 ∈ On ∧ 𝐷 ∈ 𝐵) → 𝐷 ∈ On)
11		nmulcl 36862	. . . . . . . . . . . . . 14 ⊢ ((𝐶 ∈ On ∧ 𝐷 ∈ On) → (𝐶 ·no 𝐷) ∈ On)
12	9, 10, 11	syl2an 608	. . . . . . . . . . . . 13 ⊢ (((𝐴 ∈ On ∧ 𝐶 ∈ 𝐴) ∧ (𝐵 ∈ On ∧ 𝐷 ∈ 𝐵)) → (𝐶 ·no 𝐷) ∈ On)
13	12	an4s 673	. . . . . . . . . . . 12 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵)) → (𝐶 ·no 𝐷) ∈ On)
14	8, 13	naddcld 8667	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵)) → ((𝐴 ·no 𝐵) +no (𝐶 ·no 𝐷)) ∈ On)
15		ontr 6463	. . . . . . . . . . 11 ⊢ (((𝐴 ·no 𝐵) +no (𝐶 ·no 𝐷)) ∈ On → Tr ((𝐴 ·no 𝐵) +no (𝐶 ·no 𝐷)))
16	14, 15	syl 18	. . . . . . . . . 10 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵)) → Tr ((𝐴 ·no 𝐵) +no (𝐶 ·no 𝐷)))
17		nmuladdel 36883	. . . . . . . . . 10 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵)) → ((𝐶 ·no 𝐵) +no (𝐴 ·no 𝐷)) ∈ ((𝐴 ·no 𝐵) +no (𝐶 ·no 𝐷)))
18		trss 5221	. . . . . . . . . 10 ⊢ (Tr ((𝐴 ·no 𝐵) +no (𝐶 ·no 𝐷)) → (((𝐶 ·no 𝐵) +no (𝐴 ·no 𝐷)) ∈ ((𝐴 ·no 𝐵) +no (𝐶 ·no 𝐷)) → ((𝐶 ·no 𝐵) +no (𝐴 ·no 𝐷)) ⊆ ((𝐴 ·no 𝐵) +no (𝐶 ·no 𝐷))))
19	16, 17, 18	sylc 66	. . . . . . . . 9 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵)) → ((𝐶 ·no 𝐵) +no (𝐴 ·no 𝐷)) ⊆ ((𝐴 ·no 𝐵) +no (𝐶 ·no 𝐷)))
20	19	adantlr 728	. . . . . . . 8 ⊢ ((((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ (𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵)) → ((𝐶 ·no 𝐵) +no (𝐴 ·no 𝐷)) ⊆ ((𝐴 ·no 𝐵) +no (𝐶 ·no 𝐷)))
21	20	expr 462	. . . . . . 7 ⊢ ((((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝐶 ∈ 𝐴) → (𝐷 ∈ 𝐵 → ((𝐶 ·no 𝐵) +no (𝐴 ·no 𝐷)) ⊆ ((𝐴 ·no 𝐵) +no (𝐶 ·no 𝐷))))
22		simplll 787	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝐶 ∈ 𝐴) → 𝐴 ∈ On)
23		simpllr 788	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝐶 ∈ 𝐴) → 𝐵 ∈ On)
24	22, 23	nmulcld 36864	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝐶 ∈ 𝐴) → (𝐴 ·no 𝐵) ∈ On)
25		simplrl 789	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝐶 ∈ 𝐴) → 𝐶 ∈ On)
26	25, 23	nmulcld 36864	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝐶 ∈ 𝐴) → (𝐶 ·no 𝐵) ∈ On)
27		naddcom 8670	. . . . . . . . . 10 ⊢ (((𝐴 ·no 𝐵) ∈ On ∧ (𝐶 ·no 𝐵) ∈ On) → ((𝐴 ·no 𝐵) +no (𝐶 ·no 𝐵)) = ((𝐶 ·no 𝐵) +no (𝐴 ·no 𝐵)))
28	24, 26, 27	syl2anc 596	. . . . . . . . 9 ⊢ ((((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝐶 ∈ 𝐴) → ((𝐴 ·no 𝐵) +no (𝐶 ·no 𝐵)) = ((𝐶 ·no 𝐵) +no (𝐴 ·no 𝐵)))
29	28	eqimsscd 3987	. . . . . . . 8 ⊢ ((((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝐶 ∈ 𝐴) → ((𝐶 ·no 𝐵) +no (𝐴 ·no 𝐵)) ⊆ ((𝐴 ·no 𝐵) +no (𝐶 ·no 𝐵)))
30		oveq2 7416	. . . . . . . . . 10 ⊢ (𝐷 = 𝐵 → (𝐴 ·no 𝐷) = (𝐴 ·no 𝐵))
31	30	oveq2d 7424	. . . . . . . . 9 ⊢ (𝐷 = 𝐵 → ((𝐶 ·no 𝐵) +no (𝐴 ·no 𝐷)) = ((𝐶 ·no 𝐵) +no (𝐴 ·no 𝐵)))
32		oveq2 7416	. . . . . . . . . 10 ⊢ (𝐷 = 𝐵 → (𝐶 ·no 𝐷) = (𝐶 ·no 𝐵))
33	32	oveq2d 7424	. . . . . . . . 9 ⊢ (𝐷 = 𝐵 → ((𝐴 ·no 𝐵) +no (𝐶 ·no 𝐷)) = ((𝐴 ·no 𝐵) +no (𝐶 ·no 𝐵)))
34	31, 33	sseq12d 3963	. . . . . . . 8 ⊢ (𝐷 = 𝐵 → (((𝐶 ·no 𝐵) +no (𝐴 ·no 𝐷)) ⊆ ((𝐴 ·no 𝐵) +no (𝐶 ·no 𝐷)) ↔ ((𝐶 ·no 𝐵) +no (𝐴 ·no 𝐵)) ⊆ ((𝐴 ·no 𝐵) +no (𝐶 ·no 𝐵))))
35	29, 34	syl5ibrcom 250	. . . . . . 7 ⊢ ((((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝐶 ∈ 𝐴) → (𝐷 = 𝐵 → ((𝐶 ·no 𝐵) +no (𝐴 ·no 𝐷)) ⊆ ((𝐴 ·no 𝐵) +no (𝐶 ·no 𝐷))))
36	21, 35	jaod 873	. . . . . 6 ⊢ ((((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝐶 ∈ 𝐴) → ((𝐷 ∈ 𝐵 ∨ 𝐷 = 𝐵) → ((𝐶 ·no 𝐵) +no (𝐴 ·no 𝐷)) ⊆ ((𝐴 ·no 𝐵) +no (𝐶 ·no 𝐷))))
37	36	ex 418	. . . . 5 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝐶 ∈ 𝐴 → ((𝐷 ∈ 𝐵 ∨ 𝐷 = 𝐵) → ((𝐶 ·no 𝐵) +no (𝐴 ·no 𝐷)) ⊆ ((𝐴 ·no 𝐵) +no (𝐶 ·no 𝐷)))))
38		ssid 3952	. . . . . . 7 ⊢ ((𝐴 ·no 𝐵) +no (𝐴 ·no 𝐷)) ⊆ ((𝐴 ·no 𝐵) +no (𝐴 ·no 𝐷))
39	38	2a1i 12	. . . . . 6 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → ((𝐷 ∈ 𝐵 ∨ 𝐷 = 𝐵) → ((𝐴 ·no 𝐵) +no (𝐴 ·no 𝐷)) ⊆ ((𝐴 ·no 𝐵) +no (𝐴 ·no 𝐷))))
40		oveq1 7415	. . . . . . . . 9 ⊢ (𝐶 = 𝐴 → (𝐶 ·no 𝐵) = (𝐴 ·no 𝐵))
41	40	oveq1d 7423	. . . . . . . 8 ⊢ (𝐶 = 𝐴 → ((𝐶 ·no 𝐵) +no (𝐴 ·no 𝐷)) = ((𝐴 ·no 𝐵) +no (𝐴 ·no 𝐷)))
42		oveq1 7415	. . . . . . . . 9 ⊢ (𝐶 = 𝐴 → (𝐶 ·no 𝐷) = (𝐴 ·no 𝐷))
43	42	oveq2d 7424	. . . . . . . 8 ⊢ (𝐶 = 𝐴 → ((𝐴 ·no 𝐵) +no (𝐶 ·no 𝐷)) = ((𝐴 ·no 𝐵) +no (𝐴 ·no 𝐷)))
44	41, 43	sseq12d 3963	. . . . . . 7 ⊢ (𝐶 = 𝐴 → (((𝐶 ·no 𝐵) +no (𝐴 ·no 𝐷)) ⊆ ((𝐴 ·no 𝐵) +no (𝐶 ·no 𝐷)) ↔ ((𝐴 ·no 𝐵) +no (𝐴 ·no 𝐷)) ⊆ ((𝐴 ·no 𝐵) +no (𝐴 ·no 𝐷))))
45	44	imbi2d 343	. . . . . 6 ⊢ (𝐶 = 𝐴 → (((𝐷 ∈ 𝐵 ∨ 𝐷 = 𝐵) → ((𝐶 ·no 𝐵) +no (𝐴 ·no 𝐷)) ⊆ ((𝐴 ·no 𝐵) +no (𝐶 ·no 𝐷))) ↔ ((𝐷 ∈ 𝐵 ∨ 𝐷 = 𝐵) → ((𝐴 ·no 𝐵) +no (𝐴 ·no 𝐷)) ⊆ ((𝐴 ·no 𝐵) +no (𝐴 ·no 𝐷)))))
46	39, 45	syl5ibrcom 250	. . . . 5 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝐶 = 𝐴 → ((𝐷 ∈ 𝐵 ∨ 𝐷 = 𝐵) → ((𝐶 ·no 𝐵) +no (𝐴 ·no 𝐷)) ⊆ ((𝐴 ·no 𝐵) +no (𝐶 ·no 𝐷)))))
47	37, 46	jaod 873	. . . 4 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → ((𝐶 ∈ 𝐴 ∨ 𝐶 = 𝐴) → ((𝐷 ∈ 𝐵 ∨ 𝐷 = 𝐵) → ((𝐶 ·no 𝐵) +no (𝐴 ·no 𝐷)) ⊆ ((𝐴 ·no 𝐵) +no (𝐶 ·no 𝐷)))))
48	47	impd 416	. . 3 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (((𝐶 ∈ 𝐴 ∨ 𝐶 = 𝐴) ∧ (𝐷 ∈ 𝐵 ∨ 𝐷 = 𝐵)) → ((𝐶 ·no 𝐵) +no (𝐴 ·no 𝐷)) ⊆ ((𝐴 ·no 𝐵) +no (𝐶 ·no 𝐷))))
49	6, 48	sylbid 243	. 2 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → ((𝐶 ⊆ 𝐴 ∧ 𝐷 ⊆ 𝐵) → ((𝐶 ·no 𝐵) +no (𝐴 ·no 𝐷)) ⊆ ((𝐴 ·no 𝐵) +no (𝐶 ·no 𝐷))))
50	49	3impia 1135	1 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On) ∧ (𝐶 ⊆ 𝐴 ∧ 𝐷 ⊆ 𝐵)) → ((𝐶 ·no 𝐵) +no (𝐴 ·no 𝐷)) ⊆ ((𝐴 ·no 𝐵) +no (𝐶 ·no 𝐷)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145   ⊆ wss 3898  Tr wtr 5211  Oncon0 6351  (class class class)co 7408   +no cnadd 8652   ·_no cnmul 36858

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7734

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-pss 3918  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-int 4907  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5542  df-eprel 5547  df-po 5555  df-so 5556  df-fr 5600  df-se 5601  df-we 5602  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-pred 6293  df-ord 6354  df-on 6355  df-suc 6357  df-iota 6483  df-fun 6529  df-fn 6530  df-f 6531  df-f1 6532  df-fo 6533  df-f1o 6534  df-fv 6535  df-ov 7411  df-oprab 7412  df-mpo 7413  df-1st 7984  df-2nd 7985  df-frecs 8277  df-nadd 8653  df-nmul 36859

This theorem is used by:  nmulss1  36885  nadddilem3  36893