Theorem isomnd 32206

Description: A (left) ordered monoid is a monoid with a total ordering compatible with its operation. (Contributed by Thierry Arnoux, 30-Jan-2018.)

Hypotheses

Ref	Expression
isomnd.0	⊢ 𝐵 = (Base‘𝑀)
isomnd.1	⊢ + = (+g‘𝑀)
isomnd.2	⊢ ≤ = (le‘𝑀)

Assertion

Ref	Expression
isomnd	⊢ (𝑀 ∈ oMnd ↔ (𝑀 ∈ Mnd ∧ 𝑀 ∈ Toset ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ∀𝑐 ∈ 𝐵 (𝑎 ≤ 𝑏 → (𝑎 + 𝑐) ≤ (𝑏 + 𝑐))))

Distinct variable groups:   𝑎,𝑏,𝑐,𝐵   𝑀,𝑎,𝑏,𝑐

Allowed substitution hints:   + (𝑎,𝑏,𝑐)   ≤ (𝑎,𝑏,𝑐)

Proof of Theorem isomnd

Dummy variables 𝑙 𝑚 𝑝 𝑣 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		fvexd 6903	. . . . 5 ⊢ (𝑚 = 𝑀 → (Base‘𝑚) ∈ V)
2		simpr 485	. . . . . . . . . . 11 ⊢ ((𝑚 = 𝑀 ∧ 𝑣 = (Base‘𝑚)) → 𝑣 = (Base‘𝑚))
3		fveq2 6888	. . . . . . . . . . . 12 ⊢ (𝑚 = 𝑀 → (Base‘𝑚) = (Base‘𝑀))
4	3	adantr 481	. . . . . . . . . . 11 ⊢ ((𝑚 = 𝑀 ∧ 𝑣 = (Base‘𝑚)) → (Base‘𝑚) = (Base‘𝑀))
5	2, 4	eqtrd 2772	. . . . . . . . . 10 ⊢ ((𝑚 = 𝑀 ∧ 𝑣 = (Base‘𝑚)) → 𝑣 = (Base‘𝑀))
6		isomnd.0	. . . . . . . . . 10 ⊢ 𝐵 = (Base‘𝑀)
7	5, 6	eqtr4di 2790	. . . . . . . . 9 ⊢ ((𝑚 = 𝑀 ∧ 𝑣 = (Base‘𝑚)) → 𝑣 = 𝐵)
8		raleq 3322	. . . . . . . . . . 11 ⊢ (𝑣 = 𝐵 → (∀𝑐 ∈ 𝑣 (𝑎𝑙𝑏 → (𝑎𝑝𝑐)𝑙(𝑏𝑝𝑐)) ↔ ∀𝑐 ∈ 𝐵 (𝑎𝑙𝑏 → (𝑎𝑝𝑐)𝑙(𝑏𝑝𝑐))))
9	8	raleqbi1dv 3333	. . . . . . . . . 10 ⊢ (𝑣 = 𝐵 → (∀𝑏 ∈ 𝑣 ∀𝑐 ∈ 𝑣 (𝑎𝑙𝑏 → (𝑎𝑝𝑐)𝑙(𝑏𝑝𝑐)) ↔ ∀𝑏 ∈ 𝐵 ∀𝑐 ∈ 𝐵 (𝑎𝑙𝑏 → (𝑎𝑝𝑐)𝑙(𝑏𝑝𝑐))))
10	9	raleqbi1dv 3333	. . . . . . . . 9 ⊢ (𝑣 = 𝐵 → (∀𝑎 ∈ 𝑣 ∀𝑏 ∈ 𝑣 ∀𝑐 ∈ 𝑣 (𝑎𝑙𝑏 → (𝑎𝑝𝑐)𝑙(𝑏𝑝𝑐)) ↔ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ∀𝑐 ∈ 𝐵 (𝑎𝑙𝑏 → (𝑎𝑝𝑐)𝑙(𝑏𝑝𝑐))))
11	7, 10	syl 17	. . . . . . . 8 ⊢ ((𝑚 = 𝑀 ∧ 𝑣 = (Base‘𝑚)) → (∀𝑎 ∈ 𝑣 ∀𝑏 ∈ 𝑣 ∀𝑐 ∈ 𝑣 (𝑎𝑙𝑏 → (𝑎𝑝𝑐)𝑙(𝑏𝑝𝑐)) ↔ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ∀𝑐 ∈ 𝐵 (𝑎𝑙𝑏 → (𝑎𝑝𝑐)𝑙(𝑏𝑝𝑐))))
12	11	anbi2d 629	. . . . . . 7 ⊢ ((𝑚 = 𝑀 ∧ 𝑣 = (Base‘𝑚)) → ((𝑚 ∈ Toset ∧ ∀𝑎 ∈ 𝑣 ∀𝑏 ∈ 𝑣 ∀𝑐 ∈ 𝑣 (𝑎𝑙𝑏 → (𝑎𝑝𝑐)𝑙(𝑏𝑝𝑐))) ↔ (𝑚 ∈ Toset ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ∀𝑐 ∈ 𝐵 (𝑎𝑙𝑏 → (𝑎𝑝𝑐)𝑙(𝑏𝑝𝑐)))))
13	12	sbcbidv 3835	. . . . . 6 ⊢ ((𝑚 = 𝑀 ∧ 𝑣 = (Base‘𝑚)) → ([(le‘𝑚) / 𝑙](𝑚 ∈ Toset ∧ ∀𝑎 ∈ 𝑣 ∀𝑏 ∈ 𝑣 ∀𝑐 ∈ 𝑣 (𝑎𝑙𝑏 → (𝑎𝑝𝑐)𝑙(𝑏𝑝𝑐))) ↔ [(le‘𝑚) / 𝑙](𝑚 ∈ Toset ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ∀𝑐 ∈ 𝐵 (𝑎𝑙𝑏 → (𝑎𝑝𝑐)𝑙(𝑏𝑝𝑐)))))
14	13	sbcbidv 3835	. . . . 5 ⊢ ((𝑚 = 𝑀 ∧ 𝑣 = (Base‘𝑚)) → ([(+g‘𝑚) / 𝑝][(le‘𝑚) / 𝑙](𝑚 ∈ Toset ∧ ∀𝑎 ∈ 𝑣 ∀𝑏 ∈ 𝑣 ∀𝑐 ∈ 𝑣 (𝑎𝑙𝑏 → (𝑎𝑝𝑐)𝑙(𝑏𝑝𝑐))) ↔ [(+g‘𝑚) / 𝑝][(le‘𝑚) / 𝑙](𝑚 ∈ Toset ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ∀𝑐 ∈ 𝐵 (𝑎𝑙𝑏 → (𝑎𝑝𝑐)𝑙(𝑏𝑝𝑐)))))
15	1, 14	sbcied 3821	. . . 4 ⊢ (𝑚 = 𝑀 → ([(Base‘𝑚) / 𝑣][(+g‘𝑚) / 𝑝][(le‘𝑚) / 𝑙](𝑚 ∈ Toset ∧ ∀𝑎 ∈ 𝑣 ∀𝑏 ∈ 𝑣 ∀𝑐 ∈ 𝑣 (𝑎𝑙𝑏 → (𝑎𝑝𝑐)𝑙(𝑏𝑝𝑐))) ↔ [(+g‘𝑚) / 𝑝][(le‘𝑚) / 𝑙](𝑚 ∈ Toset ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ∀𝑐 ∈ 𝐵 (𝑎𝑙𝑏 → (𝑎𝑝𝑐)𝑙(𝑏𝑝𝑐)))))
16		fvexd 6903	. . . . 5 ⊢ (𝑚 = 𝑀 → (+g‘𝑚) ∈ V)
17		simpr 485	. . . . . . . . . . . . . 14 ⊢ ((𝑚 = 𝑀 ∧ 𝑝 = (+g‘𝑚)) → 𝑝 = (+g‘𝑚))
18		fveq2 6888	. . . . . . . . . . . . . . 15 ⊢ (𝑚 = 𝑀 → (+g‘𝑚) = (+g‘𝑀))
19	18	adantr 481	. . . . . . . . . . . . . 14 ⊢ ((𝑚 = 𝑀 ∧ 𝑝 = (+g‘𝑚)) → (+g‘𝑚) = (+g‘𝑀))
20	17, 19	eqtrd 2772	. . . . . . . . . . . . 13 ⊢ ((𝑚 = 𝑀 ∧ 𝑝 = (+g‘𝑚)) → 𝑝 = (+g‘𝑀))
21		isomnd.1	. . . . . . . . . . . . 13 ⊢ + = (+g‘𝑀)
22	20, 21	eqtr4di 2790	. . . . . . . . . . . 12 ⊢ ((𝑚 = 𝑀 ∧ 𝑝 = (+g‘𝑚)) → 𝑝 = + )
23	22	oveqd 7422	. . . . . . . . . . 11 ⊢ ((𝑚 = 𝑀 ∧ 𝑝 = (+g‘𝑚)) → (𝑎𝑝𝑐) = (𝑎 + 𝑐))
24	22	oveqd 7422	. . . . . . . . . . 11 ⊢ ((𝑚 = 𝑀 ∧ 𝑝 = (+g‘𝑚)) → (𝑏𝑝𝑐) = (𝑏 + 𝑐))
25	23, 24	breq12d 5160	. . . . . . . . . 10 ⊢ ((𝑚 = 𝑀 ∧ 𝑝 = (+g‘𝑚)) → ((𝑎𝑝𝑐)𝑙(𝑏𝑝𝑐) ↔ (𝑎 + 𝑐)𝑙(𝑏 + 𝑐)))
26	25	imbi2d 340	. . . . . . . . 9 ⊢ ((𝑚 = 𝑀 ∧ 𝑝 = (+g‘𝑚)) → ((𝑎𝑙𝑏 → (𝑎𝑝𝑐)𝑙(𝑏𝑝𝑐)) ↔ (𝑎𝑙𝑏 → (𝑎 + 𝑐)𝑙(𝑏 + 𝑐))))
27	26	ralbidv 3177	. . . . . . . 8 ⊢ ((𝑚 = 𝑀 ∧ 𝑝 = (+g‘𝑚)) → (∀𝑐 ∈ 𝐵 (𝑎𝑙𝑏 → (𝑎𝑝𝑐)𝑙(𝑏𝑝𝑐)) ↔ ∀𝑐 ∈ 𝐵 (𝑎𝑙𝑏 → (𝑎 + 𝑐)𝑙(𝑏 + 𝑐))))
28	27	2ralbidv 3218	. . . . . . 7 ⊢ ((𝑚 = 𝑀 ∧ 𝑝 = (+g‘𝑚)) → (∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ∀𝑐 ∈ 𝐵 (𝑎𝑙𝑏 → (𝑎𝑝𝑐)𝑙(𝑏𝑝𝑐)) ↔ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ∀𝑐 ∈ 𝐵 (𝑎𝑙𝑏 → (𝑎 + 𝑐)𝑙(𝑏 + 𝑐))))
29	28	anbi2d 629	. . . . . 6 ⊢ ((𝑚 = 𝑀 ∧ 𝑝 = (+g‘𝑚)) → ((𝑚 ∈ Toset ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ∀𝑐 ∈ 𝐵 (𝑎𝑙𝑏 → (𝑎𝑝𝑐)𝑙(𝑏𝑝𝑐))) ↔ (𝑚 ∈ Toset ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ∀𝑐 ∈ 𝐵 (𝑎𝑙𝑏 → (𝑎 + 𝑐)𝑙(𝑏 + 𝑐)))))
30	29	sbcbidv 3835	. . . . 5 ⊢ ((𝑚 = 𝑀 ∧ 𝑝 = (+g‘𝑚)) → ([(le‘𝑚) / 𝑙](𝑚 ∈ Toset ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ∀𝑐 ∈ 𝐵 (𝑎𝑙𝑏 → (𝑎𝑝𝑐)𝑙(𝑏𝑝𝑐))) ↔ [(le‘𝑚) / 𝑙](𝑚 ∈ Toset ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ∀𝑐 ∈ 𝐵 (𝑎𝑙𝑏 → (𝑎 + 𝑐)𝑙(𝑏 + 𝑐)))))
31	16, 30	sbcied 3821	. . . 4 ⊢ (𝑚 = 𝑀 → ([(+g‘𝑚) / 𝑝][(le‘𝑚) / 𝑙](𝑚 ∈ Toset ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ∀𝑐 ∈ 𝐵 (𝑎𝑙𝑏 → (𝑎𝑝𝑐)𝑙(𝑏𝑝𝑐))) ↔ [(le‘𝑚) / 𝑙](𝑚 ∈ Toset ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ∀𝑐 ∈ 𝐵 (𝑎𝑙𝑏 → (𝑎 + 𝑐)𝑙(𝑏 + 𝑐)))))
32		fvexd 6903	. . . . . 6 ⊢ (𝑚 = 𝑀 → (le‘𝑚) ∈ V)
33		simpr 485	. . . . . . . . . . . . 13 ⊢ ((𝑚 = 𝑀 ∧ 𝑙 = (le‘𝑚)) → 𝑙 = (le‘𝑚))
34		simpl 483	. . . . . . . . . . . . . 14 ⊢ ((𝑚 = 𝑀 ∧ 𝑙 = (le‘𝑚)) → 𝑚 = 𝑀)
35	34	fveq2d 6892	. . . . . . . . . . . . 13 ⊢ ((𝑚 = 𝑀 ∧ 𝑙 = (le‘𝑚)) → (le‘𝑚) = (le‘𝑀))
36	33, 35	eqtrd 2772	. . . . . . . . . . . 12 ⊢ ((𝑚 = 𝑀 ∧ 𝑙 = (le‘𝑚)) → 𝑙 = (le‘𝑀))
37		isomnd.2	. . . . . . . . . . . 12 ⊢ ≤ = (le‘𝑀)
38	36, 37	eqtr4di 2790	. . . . . . . . . . 11 ⊢ ((𝑚 = 𝑀 ∧ 𝑙 = (le‘𝑚)) → 𝑙 = ≤ )
39	38	breqd 5158	. . . . . . . . . 10 ⊢ ((𝑚 = 𝑀 ∧ 𝑙 = (le‘𝑚)) → (𝑎𝑙𝑏 ↔ 𝑎 ≤ 𝑏))
40	38	breqd 5158	. . . . . . . . . 10 ⊢ ((𝑚 = 𝑀 ∧ 𝑙 = (le‘𝑚)) → ((𝑎 + 𝑐)𝑙(𝑏 + 𝑐) ↔ (𝑎 + 𝑐) ≤ (𝑏 + 𝑐)))
41	39, 40	imbi12d 344	. . . . . . . . 9 ⊢ ((𝑚 = 𝑀 ∧ 𝑙 = (le‘𝑚)) → ((𝑎𝑙𝑏 → (𝑎 + 𝑐)𝑙(𝑏 + 𝑐)) ↔ (𝑎 ≤ 𝑏 → (𝑎 + 𝑐) ≤ (𝑏 + 𝑐))))
42	41	ralbidv 3177	. . . . . . . 8 ⊢ ((𝑚 = 𝑀 ∧ 𝑙 = (le‘𝑚)) → (∀𝑐 ∈ 𝐵 (𝑎𝑙𝑏 → (𝑎 + 𝑐)𝑙(𝑏 + 𝑐)) ↔ ∀𝑐 ∈ 𝐵 (𝑎 ≤ 𝑏 → (𝑎 + 𝑐) ≤ (𝑏 + 𝑐))))
43	42	2ralbidv 3218	. . . . . . 7 ⊢ ((𝑚 = 𝑀 ∧ 𝑙 = (le‘𝑚)) → (∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ∀𝑐 ∈ 𝐵 (𝑎𝑙𝑏 → (𝑎 + 𝑐)𝑙(𝑏 + 𝑐)) ↔ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ∀𝑐 ∈ 𝐵 (𝑎 ≤ 𝑏 → (𝑎 + 𝑐) ≤ (𝑏 + 𝑐))))
44	43	anbi2d 629	. . . . . 6 ⊢ ((𝑚 = 𝑀 ∧ 𝑙 = (le‘𝑚)) → ((𝑚 ∈ Toset ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ∀𝑐 ∈ 𝐵 (𝑎𝑙𝑏 → (𝑎 + 𝑐)𝑙(𝑏 + 𝑐))) ↔ (𝑚 ∈ Toset ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ∀𝑐 ∈ 𝐵 (𝑎 ≤ 𝑏 → (𝑎 + 𝑐) ≤ (𝑏 + 𝑐)))))
45	32, 44	sbcied 3821	. . . . 5 ⊢ (𝑚 = 𝑀 → ([(le‘𝑚) / 𝑙](𝑚 ∈ Toset ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ∀𝑐 ∈ 𝐵 (𝑎𝑙𝑏 → (𝑎 + 𝑐)𝑙(𝑏 + 𝑐))) ↔ (𝑚 ∈ Toset ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ∀𝑐 ∈ 𝐵 (𝑎 ≤ 𝑏 → (𝑎 + 𝑐) ≤ (𝑏 + 𝑐)))))
46		eleq1 2821	. . . . . 6 ⊢ (𝑚 = 𝑀 → (𝑚 ∈ Toset ↔ 𝑀 ∈ Toset))
47	46	anbi1d 630	. . . . 5 ⊢ (𝑚 = 𝑀 → ((𝑚 ∈ Toset ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ∀𝑐 ∈ 𝐵 (𝑎 ≤ 𝑏 → (𝑎 + 𝑐) ≤ (𝑏 + 𝑐))) ↔ (𝑀 ∈ Toset ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ∀𝑐 ∈ 𝐵 (𝑎 ≤ 𝑏 → (𝑎 + 𝑐) ≤ (𝑏 + 𝑐)))))
48	45, 47	bitrd 278	. . . 4 ⊢ (𝑚 = 𝑀 → ([(le‘𝑚) / 𝑙](𝑚 ∈ Toset ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ∀𝑐 ∈ 𝐵 (𝑎𝑙𝑏 → (𝑎 + 𝑐)𝑙(𝑏 + 𝑐))) ↔ (𝑀 ∈ Toset ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ∀𝑐 ∈ 𝐵 (𝑎 ≤ 𝑏 → (𝑎 + 𝑐) ≤ (𝑏 + 𝑐)))))
49	15, 31, 48	3bitrd 304	. . 3 ⊢ (𝑚 = 𝑀 → ([(Base‘𝑚) / 𝑣][(+g‘𝑚) / 𝑝][(le‘𝑚) / 𝑙](𝑚 ∈ Toset ∧ ∀𝑎 ∈ 𝑣 ∀𝑏 ∈ 𝑣 ∀𝑐 ∈ 𝑣 (𝑎𝑙𝑏 → (𝑎𝑝𝑐)𝑙(𝑏𝑝𝑐))) ↔ (𝑀 ∈ Toset ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ∀𝑐 ∈ 𝐵 (𝑎 ≤ 𝑏 → (𝑎 + 𝑐) ≤ (𝑏 + 𝑐)))))
50		df-omnd 32204	. . 3 ⊢ oMnd = {𝑚 ∈ Mnd ∣ [(Base‘𝑚) / 𝑣][(+g‘𝑚) / 𝑝][(le‘𝑚) / 𝑙](𝑚 ∈ Toset ∧ ∀𝑎 ∈ 𝑣 ∀𝑏 ∈ 𝑣 ∀𝑐 ∈ 𝑣 (𝑎𝑙𝑏 → (𝑎𝑝𝑐)𝑙(𝑏𝑝𝑐)))}
51	49, 50	elrab2 3685	. 2 ⊢ (𝑀 ∈ oMnd ↔ (𝑀 ∈ Mnd ∧ (𝑀 ∈ Toset ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ∀𝑐 ∈ 𝐵 (𝑎 ≤ 𝑏 → (𝑎 + 𝑐) ≤ (𝑏 + 𝑐)))))
52		3anass 1095	. 2 ⊢ ((𝑀 ∈ Mnd ∧ 𝑀 ∈ Toset ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ∀𝑐 ∈ 𝐵 (𝑎 ≤ 𝑏 → (𝑎 + 𝑐) ≤ (𝑏 + 𝑐))) ↔ (𝑀 ∈ Mnd ∧ (𝑀 ∈ Toset ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ∀𝑐 ∈ 𝐵 (𝑎 ≤ 𝑏 → (𝑎 + 𝑐) ≤ (𝑏 + 𝑐)))))
53	51, 52	bitr4i 277	1 ⊢ (𝑀 ∈ oMnd ↔ (𝑀 ∈ Mnd ∧ 𝑀 ∈ Toset ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ∀𝑐 ∈ 𝐵 (𝑎 ≤ 𝑏 → (𝑎 + 𝑐) ≤ (𝑏 + 𝑐))))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396   ∧ w3a 1087   = wceq 1541   ∈ wcel 2106  ∀wral 3061  Vcvv 3474  [wsbc 3776   class class class wbr 5147  ‘cfv 6540  (class class class)co 7405  Basecbs 17140  +_gcplusg 17193  lecple 17200  Tosetctos 18365  Mndcmnd 18621  oMndcomnd 32202

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-ext 2703  ax-nul 5305

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-sb 2068  df-clab 2710  df-cleq 2724  df-clel 2810  df-ne 2941  df-ral 3062  df-rex 3071  df-rab 3433  df-v 3476  df-sbc 3777  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-nul 4322  df-if 4528  df-sn 4628  df-pr 4630  df-op 4634  df-uni 4908  df-br 5148  df-iota 6492  df-fv 6548  df-ov 7408  df-omnd 32204

This theorem is referenced by:  omndmnd  32209  omndtos  32210  omndadd  32211  submomnd  32215  xrge0omnd  32216  reofld  32447