Theorem oaltom 44232

Description: Multiplication eventually dominates addition. (Contributed by RP, 3-Jan-2025.)

Assertion

Ref	Expression
oaltom	⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((1o ∈ 𝐴 ∧ 𝐴 ∈ 𝐵) → (𝐵 +o 𝐴) ∈ (𝐵 ·o 𝐴)))

Proof of Theorem oaltom

Step	Hyp	Ref	Expression
1		om2 8576	. . . . 5 ⊢ (𝐵 ∈ On → (𝐵 +o 𝐵) = (𝐵 ·o 2o))
2	1	ad2antlr 740	. . . 4 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (1o ∈ 𝐴 ∧ 𝐴 ∈ 𝐵)) → (𝐵 +o 𝐵) = (𝐵 ·o 2o))
3		2on 8472	. . . . . . . 8 ⊢ 2o ∈ On
4	3	a1i 11	. . . . . . 7 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → 2o ∈ On)
5		simpl 488	. . . . . . 7 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → 𝐴 ∈ On)
6		simpr 490	. . . . . . 7 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → 𝐵 ∈ On)
7	4, 5, 6	3jca 1146	. . . . . 6 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (2o ∈ On ∧ 𝐴 ∈ On ∧ 𝐵 ∈ On))
8	7	adantr 486	. . . . 5 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (1o ∈ 𝐴 ∧ 𝐴 ∈ 𝐵)) → (2o ∈ On ∧ 𝐴 ∈ On ∧ 𝐵 ∈ On))
9		df-2o 8459	. . . . . . 7 ⊢ 2o = suc 1o
10	9	a1i 11	. . . . . 6 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (1o ∈ 𝐴 ∧ 𝐴 ∈ 𝐵)) → 2o = suc 1o)
11		simprl 783	. . . . . . . 8 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (1o ∈ 𝐴 ∧ 𝐴 ∈ 𝐵)) → 1o ∈ 𝐴)
12		eloni 6371	. . . . . . . . . 10 ⊢ (𝐴 ∈ On → Ord 𝐴)
13	12	adantr 486	. . . . . . . . 9 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → Ord 𝐴)
14	13	adantr 486	. . . . . . . 8 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (1o ∈ 𝐴 ∧ 𝐴 ∈ 𝐵)) → Ord 𝐴)
15	11, 14	jca 521	. . . . . . 7 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (1o ∈ 𝐴 ∧ 𝐴 ∈ 𝐵)) → (1o ∈ 𝐴 ∧ Ord 𝐴))
16		ordelsuc 7819	. . . . . . . 8 ⊢ ((1o ∈ 𝐴 ∧ Ord 𝐴) → (1o ∈ 𝐴 ↔ suc 1o ⊆ 𝐴))
17	16	biimpd 232	. . . . . . 7 ⊢ ((1o ∈ 𝐴 ∧ Ord 𝐴) → (1o ∈ 𝐴 → suc 1o ⊆ 𝐴))
18	15, 11, 17	sylc 66	. . . . . 6 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (1o ∈ 𝐴 ∧ 𝐴 ∈ 𝐵)) → suc 1o ⊆ 𝐴)
19	10, 18	eqsstrd 3968	. . . . 5 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (1o ∈ 𝐴 ∧ 𝐴 ∈ 𝐵)) → 2o ⊆ 𝐴)
20		omwordi 8561	. . . . 5 ⊢ ((2o ∈ On ∧ 𝐴 ∈ On ∧ 𝐵 ∈ On) → (2o ⊆ 𝐴 → (𝐵 ·o 2o) ⊆ (𝐵 ·o 𝐴)))
21	8, 19, 20	sylc 66	. . . 4 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (1o ∈ 𝐴 ∧ 𝐴 ∈ 𝐵)) → (𝐵 ·o 2o) ⊆ (𝐵 ·o 𝐴))
22	2, 21	eqsstrd 3968	. . 3 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (1o ∈ 𝐴 ∧ 𝐴 ∈ 𝐵)) → (𝐵 +o 𝐵) ⊆ (𝐵 ·o 𝐴))
23	6, 6	jca 521	. . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐵 ∈ On ∧ 𝐵 ∈ On))
24		simpr 490	. . . 4 ⊢ ((1o ∈ 𝐴 ∧ 𝐴 ∈ 𝐵) → 𝐴 ∈ 𝐵)
25		oaordi 8536	. . . . 5 ⊢ ((𝐵 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ∈ 𝐵 → (𝐵 +o 𝐴) ∈ (𝐵 +o 𝐵)))
26	25	imp 412	. . . 4 ⊢ (((𝐵 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐴 ∈ 𝐵) → (𝐵 +o 𝐴) ∈ (𝐵 +o 𝐵))
27	23, 24, 26	syl2an 608	. . 3 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (1o ∈ 𝐴 ∧ 𝐴 ∈ 𝐵)) → (𝐵 +o 𝐴) ∈ (𝐵 +o 𝐵))
28	22, 27	sseldd 3935	. 2 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (1o ∈ 𝐴 ∧ 𝐴 ∈ 𝐵)) → (𝐵 +o 𝐴) ∈ (𝐵 ·o 𝐴))
29	28	ex 418	1 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((1o ∈ 𝐴 ∧ 𝐴 ∈ 𝐵) → (𝐵 +o 𝐴) ∈ (𝐵 ·o 𝐴)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145   ⊆ wss 3902  Ord word 6360  Oncon0 6361  suc csuc 6363  (class class class)co 7416  1_oc1o 8451  2_oc2o 8452   +_o coa 8455   ·_o comu 8456

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 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pr 5402  ax-un 7739

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 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7419  df-oprab 7420  df-mpo 7421  df-om 7866  df-2nd 7990  df-frecs 8283  df-wrecs 8314  df-recs 8363  df-rdg 8402  df-1o 8458  df-2o 8459  df-oadd 8462  df-omul 8463

This theorem is used by: (None)