MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  insubm Structured version   Visualization version   GIF version

Theorem insubm 18629
Description: The intersection of two submonoids is a submonoid. (Contributed by AV, 25-Feb-2024.)
Assertion
Ref Expression
insubm ((𝐴 ∈ (SubMnd‘𝑀) ∧ 𝐵 ∈ (SubMnd‘𝑀)) → (𝐴𝐵) ∈ (SubMnd‘𝑀))

Proof of Theorem insubm
Dummy variables 𝑎 𝑏 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 submrcl 18613 . . 3 (𝐴 ∈ (SubMnd‘𝑀) → 𝑀 ∈ Mnd)
2 ssinss1 4197 . . . . . . . . 9 (𝐴 ⊆ (Base‘𝑀) → (𝐴𝐵) ⊆ (Base‘𝑀))
323ad2ant1 1133 . . . . . . . 8 ((𝐴 ⊆ (Base‘𝑀) ∧ (0g𝑀) ∈ 𝐴 ∧ ∀𝑎𝐴𝑏𝐴 (𝑎(+g𝑀)𝑏) ∈ 𝐴) → (𝐴𝐵) ⊆ (Base‘𝑀))
43ad2antrl 726 . . . . . . 7 ((𝑀 ∈ Mnd ∧ ((𝐴 ⊆ (Base‘𝑀) ∧ (0g𝑀) ∈ 𝐴 ∧ ∀𝑎𝐴𝑏𝐴 (𝑎(+g𝑀)𝑏) ∈ 𝐴) ∧ (𝐵 ⊆ (Base‘𝑀) ∧ (0g𝑀) ∈ 𝐵 ∧ ∀𝑎𝐵𝑏𝐵 (𝑎(+g𝑀)𝑏) ∈ 𝐵))) → (𝐴𝐵) ⊆ (Base‘𝑀))
5 elin 3926 . . . . . . . . . . . . 13 ((0g𝑀) ∈ (𝐴𝐵) ↔ ((0g𝑀) ∈ 𝐴 ∧ (0g𝑀) ∈ 𝐵))
65simplbi2com 503 . . . . . . . . . . . 12 ((0g𝑀) ∈ 𝐵 → ((0g𝑀) ∈ 𝐴 → (0g𝑀) ∈ (𝐴𝐵)))
763ad2ant2 1134 . . . . . . . . . . 11 ((𝐵 ⊆ (Base‘𝑀) ∧ (0g𝑀) ∈ 𝐵 ∧ ∀𝑎𝐵𝑏𝐵 (𝑎(+g𝑀)𝑏) ∈ 𝐵) → ((0g𝑀) ∈ 𝐴 → (0g𝑀) ∈ (𝐴𝐵)))
87com12 32 . . . . . . . . . 10 ((0g𝑀) ∈ 𝐴 → ((𝐵 ⊆ (Base‘𝑀) ∧ (0g𝑀) ∈ 𝐵 ∧ ∀𝑎𝐵𝑏𝐵 (𝑎(+g𝑀)𝑏) ∈ 𝐵) → (0g𝑀) ∈ (𝐴𝐵)))
983ad2ant2 1134 . . . . . . . . 9 ((𝐴 ⊆ (Base‘𝑀) ∧ (0g𝑀) ∈ 𝐴 ∧ ∀𝑎𝐴𝑏𝐴 (𝑎(+g𝑀)𝑏) ∈ 𝐴) → ((𝐵 ⊆ (Base‘𝑀) ∧ (0g𝑀) ∈ 𝐵 ∧ ∀𝑎𝐵𝑏𝐵 (𝑎(+g𝑀)𝑏) ∈ 𝐵) → (0g𝑀) ∈ (𝐴𝐵)))
109imp 407 . . . . . . . 8 (((𝐴 ⊆ (Base‘𝑀) ∧ (0g𝑀) ∈ 𝐴 ∧ ∀𝑎𝐴𝑏𝐴 (𝑎(+g𝑀)𝑏) ∈ 𝐴) ∧ (𝐵 ⊆ (Base‘𝑀) ∧ (0g𝑀) ∈ 𝐵 ∧ ∀𝑎𝐵𝑏𝐵 (𝑎(+g𝑀)𝑏) ∈ 𝐵)) → (0g𝑀) ∈ (𝐴𝐵))
1110adantl 482 . . . . . . 7 ((𝑀 ∈ Mnd ∧ ((𝐴 ⊆ (Base‘𝑀) ∧ (0g𝑀) ∈ 𝐴 ∧ ∀𝑎𝐴𝑏𝐴 (𝑎(+g𝑀)𝑏) ∈ 𝐴) ∧ (𝐵 ⊆ (Base‘𝑀) ∧ (0g𝑀) ∈ 𝐵 ∧ ∀𝑎𝐵𝑏𝐵 (𝑎(+g𝑀)𝑏) ∈ 𝐵))) → (0g𝑀) ∈ (𝐴𝐵))
12 elin 3926 . . . . . . . . . 10 (𝑥 ∈ (𝐴𝐵) ↔ (𝑥𝐴𝑥𝐵))
13 elin 3926 . . . . . . . . . 10 (𝑦 ∈ (𝐴𝐵) ↔ (𝑦𝐴𝑦𝐵))
1412, 13anbi12i 627 . . . . . . . . 9 ((𝑥 ∈ (𝐴𝐵) ∧ 𝑦 ∈ (𝐴𝐵)) ↔ ((𝑥𝐴𝑥𝐵) ∧ (𝑦𝐴𝑦𝐵)))
15 oveq1 7364 . . . . . . . . . . . . . . . . 17 (𝑎 = 𝑥 → (𝑎(+g𝑀)𝑏) = (𝑥(+g𝑀)𝑏))
1615eleq1d 2822 . . . . . . . . . . . . . . . 16 (𝑎 = 𝑥 → ((𝑎(+g𝑀)𝑏) ∈ 𝐴 ↔ (𝑥(+g𝑀)𝑏) ∈ 𝐴))
17 oveq2 7365 . . . . . . . . . . . . . . . . 17 (𝑏 = 𝑦 → (𝑥(+g𝑀)𝑏) = (𝑥(+g𝑀)𝑦))
1817eleq1d 2822 . . . . . . . . . . . . . . . 16 (𝑏 = 𝑦 → ((𝑥(+g𝑀)𝑏) ∈ 𝐴 ↔ (𝑥(+g𝑀)𝑦) ∈ 𝐴))
19 simpl 483 . . . . . . . . . . . . . . . . 17 ((𝑥𝐴𝑥𝐵) → 𝑥𝐴)
2019adantr 481 . . . . . . . . . . . . . . . 16 (((𝑥𝐴𝑥𝐵) ∧ (𝑦𝐴𝑦𝐵)) → 𝑥𝐴)
21 eqidd 2737 . . . . . . . . . . . . . . . 16 ((((𝑥𝐴𝑥𝐵) ∧ (𝑦𝐴𝑦𝐵)) ∧ 𝑎 = 𝑥) → 𝐴 = 𝐴)
22 simpl 483 . . . . . . . . . . . . . . . . 17 ((𝑦𝐴𝑦𝐵) → 𝑦𝐴)
2322adantl 482 . . . . . . . . . . . . . . . 16 (((𝑥𝐴𝑥𝐵) ∧ (𝑦𝐴𝑦𝐵)) → 𝑦𝐴)
2416, 18, 20, 21, 23rspc2vd 3906 . . . . . . . . . . . . . . 15 (((𝑥𝐴𝑥𝐵) ∧ (𝑦𝐴𝑦𝐵)) → (∀𝑎𝐴𝑏𝐴 (𝑎(+g𝑀)𝑏) ∈ 𝐴 → (𝑥(+g𝑀)𝑦) ∈ 𝐴))
2524com12 32 . . . . . . . . . . . . . 14 (∀𝑎𝐴𝑏𝐴 (𝑎(+g𝑀)𝑏) ∈ 𝐴 → (((𝑥𝐴𝑥𝐵) ∧ (𝑦𝐴𝑦𝐵)) → (𝑥(+g𝑀)𝑦) ∈ 𝐴))
26253ad2ant3 1135 . . . . . . . . . . . . 13 ((𝐴 ⊆ (Base‘𝑀) ∧ (0g𝑀) ∈ 𝐴 ∧ ∀𝑎𝐴𝑏𝐴 (𝑎(+g𝑀)𝑏) ∈ 𝐴) → (((𝑥𝐴𝑥𝐵) ∧ (𝑦𝐴𝑦𝐵)) → (𝑥(+g𝑀)𝑦) ∈ 𝐴))
2726ad2antrl 726 . . . . . . . . . . . 12 ((𝑀 ∈ Mnd ∧ ((𝐴 ⊆ (Base‘𝑀) ∧ (0g𝑀) ∈ 𝐴 ∧ ∀𝑎𝐴𝑏𝐴 (𝑎(+g𝑀)𝑏) ∈ 𝐴) ∧ (𝐵 ⊆ (Base‘𝑀) ∧ (0g𝑀) ∈ 𝐵 ∧ ∀𝑎𝐵𝑏𝐵 (𝑎(+g𝑀)𝑏) ∈ 𝐵))) → (((𝑥𝐴𝑥𝐵) ∧ (𝑦𝐴𝑦𝐵)) → (𝑥(+g𝑀)𝑦) ∈ 𝐴))
2827imp 407 . . . . . . . . . . 11 (((𝑀 ∈ Mnd ∧ ((𝐴 ⊆ (Base‘𝑀) ∧ (0g𝑀) ∈ 𝐴 ∧ ∀𝑎𝐴𝑏𝐴 (𝑎(+g𝑀)𝑏) ∈ 𝐴) ∧ (𝐵 ⊆ (Base‘𝑀) ∧ (0g𝑀) ∈ 𝐵 ∧ ∀𝑎𝐵𝑏𝐵 (𝑎(+g𝑀)𝑏) ∈ 𝐵))) ∧ ((𝑥𝐴𝑥𝐵) ∧ (𝑦𝐴𝑦𝐵))) → (𝑥(+g𝑀)𝑦) ∈ 𝐴)
2915eleq1d 2822 . . . . . . . . . . . . . . . . 17 (𝑎 = 𝑥 → ((𝑎(+g𝑀)𝑏) ∈ 𝐵 ↔ (𝑥(+g𝑀)𝑏) ∈ 𝐵))
3017eleq1d 2822 . . . . . . . . . . . . . . . . 17 (𝑏 = 𝑦 → ((𝑥(+g𝑀)𝑏) ∈ 𝐵 ↔ (𝑥(+g𝑀)𝑦) ∈ 𝐵))
31 simpr 485 . . . . . . . . . . . . . . . . . 18 ((𝑥𝐴𝑥𝐵) → 𝑥𝐵)
3231adantr 481 . . . . . . . . . . . . . . . . 17 (((𝑥𝐴𝑥𝐵) ∧ (𝑦𝐴𝑦𝐵)) → 𝑥𝐵)
33 eqidd 2737 . . . . . . . . . . . . . . . . 17 ((((𝑥𝐴𝑥𝐵) ∧ (𝑦𝐴𝑦𝐵)) ∧ 𝑎 = 𝑥) → 𝐵 = 𝐵)
34 simpr 485 . . . . . . . . . . . . . . . . . 18 ((𝑦𝐴𝑦𝐵) → 𝑦𝐵)
3534adantl 482 . . . . . . . . . . . . . . . . 17 (((𝑥𝐴𝑥𝐵) ∧ (𝑦𝐴𝑦𝐵)) → 𝑦𝐵)
3629, 30, 32, 33, 35rspc2vd 3906 . . . . . . . . . . . . . . . 16 (((𝑥𝐴𝑥𝐵) ∧ (𝑦𝐴𝑦𝐵)) → (∀𝑎𝐵𝑏𝐵 (𝑎(+g𝑀)𝑏) ∈ 𝐵 → (𝑥(+g𝑀)𝑦) ∈ 𝐵))
3736com12 32 . . . . . . . . . . . . . . 15 (∀𝑎𝐵𝑏𝐵 (𝑎(+g𝑀)𝑏) ∈ 𝐵 → (((𝑥𝐴𝑥𝐵) ∧ (𝑦𝐴𝑦𝐵)) → (𝑥(+g𝑀)𝑦) ∈ 𝐵))
38373ad2ant3 1135 . . . . . . . . . . . . . 14 ((𝐵 ⊆ (Base‘𝑀) ∧ (0g𝑀) ∈ 𝐵 ∧ ∀𝑎𝐵𝑏𝐵 (𝑎(+g𝑀)𝑏) ∈ 𝐵) → (((𝑥𝐴𝑥𝐵) ∧ (𝑦𝐴𝑦𝐵)) → (𝑥(+g𝑀)𝑦) ∈ 𝐵))
3938adantl 482 . . . . . . . . . . . . 13 (((𝐴 ⊆ (Base‘𝑀) ∧ (0g𝑀) ∈ 𝐴 ∧ ∀𝑎𝐴𝑏𝐴 (𝑎(+g𝑀)𝑏) ∈ 𝐴) ∧ (𝐵 ⊆ (Base‘𝑀) ∧ (0g𝑀) ∈ 𝐵 ∧ ∀𝑎𝐵𝑏𝐵 (𝑎(+g𝑀)𝑏) ∈ 𝐵)) → (((𝑥𝐴𝑥𝐵) ∧ (𝑦𝐴𝑦𝐵)) → (𝑥(+g𝑀)𝑦) ∈ 𝐵))
4039adantl 482 . . . . . . . . . . . 12 ((𝑀 ∈ Mnd ∧ ((𝐴 ⊆ (Base‘𝑀) ∧ (0g𝑀) ∈ 𝐴 ∧ ∀𝑎𝐴𝑏𝐴 (𝑎(+g𝑀)𝑏) ∈ 𝐴) ∧ (𝐵 ⊆ (Base‘𝑀) ∧ (0g𝑀) ∈ 𝐵 ∧ ∀𝑎𝐵𝑏𝐵 (𝑎(+g𝑀)𝑏) ∈ 𝐵))) → (((𝑥𝐴𝑥𝐵) ∧ (𝑦𝐴𝑦𝐵)) → (𝑥(+g𝑀)𝑦) ∈ 𝐵))
4140imp 407 . . . . . . . . . . 11 (((𝑀 ∈ Mnd ∧ ((𝐴 ⊆ (Base‘𝑀) ∧ (0g𝑀) ∈ 𝐴 ∧ ∀𝑎𝐴𝑏𝐴 (𝑎(+g𝑀)𝑏) ∈ 𝐴) ∧ (𝐵 ⊆ (Base‘𝑀) ∧ (0g𝑀) ∈ 𝐵 ∧ ∀𝑎𝐵𝑏𝐵 (𝑎(+g𝑀)𝑏) ∈ 𝐵))) ∧ ((𝑥𝐴𝑥𝐵) ∧ (𝑦𝐴𝑦𝐵))) → (𝑥(+g𝑀)𝑦) ∈ 𝐵)
4228, 41elind 4154 . . . . . . . . . 10 (((𝑀 ∈ Mnd ∧ ((𝐴 ⊆ (Base‘𝑀) ∧ (0g𝑀) ∈ 𝐴 ∧ ∀𝑎𝐴𝑏𝐴 (𝑎(+g𝑀)𝑏) ∈ 𝐴) ∧ (𝐵 ⊆ (Base‘𝑀) ∧ (0g𝑀) ∈ 𝐵 ∧ ∀𝑎𝐵𝑏𝐵 (𝑎(+g𝑀)𝑏) ∈ 𝐵))) ∧ ((𝑥𝐴𝑥𝐵) ∧ (𝑦𝐴𝑦𝐵))) → (𝑥(+g𝑀)𝑦) ∈ (𝐴𝐵))
4342ex 413 . . . . . . . . 9 ((𝑀 ∈ Mnd ∧ ((𝐴 ⊆ (Base‘𝑀) ∧ (0g𝑀) ∈ 𝐴 ∧ ∀𝑎𝐴𝑏𝐴 (𝑎(+g𝑀)𝑏) ∈ 𝐴) ∧ (𝐵 ⊆ (Base‘𝑀) ∧ (0g𝑀) ∈ 𝐵 ∧ ∀𝑎𝐵𝑏𝐵 (𝑎(+g𝑀)𝑏) ∈ 𝐵))) → (((𝑥𝐴𝑥𝐵) ∧ (𝑦𝐴𝑦𝐵)) → (𝑥(+g𝑀)𝑦) ∈ (𝐴𝐵)))
4414, 43biimtrid 241 . . . . . . . 8 ((𝑀 ∈ Mnd ∧ ((𝐴 ⊆ (Base‘𝑀) ∧ (0g𝑀) ∈ 𝐴 ∧ ∀𝑎𝐴𝑏𝐴 (𝑎(+g𝑀)𝑏) ∈ 𝐴) ∧ (𝐵 ⊆ (Base‘𝑀) ∧ (0g𝑀) ∈ 𝐵 ∧ ∀𝑎𝐵𝑏𝐵 (𝑎(+g𝑀)𝑏) ∈ 𝐵))) → ((𝑥 ∈ (𝐴𝐵) ∧ 𝑦 ∈ (𝐴𝐵)) → (𝑥(+g𝑀)𝑦) ∈ (𝐴𝐵)))
4544ralrimivv 3195 . . . . . . 7 ((𝑀 ∈ Mnd ∧ ((𝐴 ⊆ (Base‘𝑀) ∧ (0g𝑀) ∈ 𝐴 ∧ ∀𝑎𝐴𝑏𝐴 (𝑎(+g𝑀)𝑏) ∈ 𝐴) ∧ (𝐵 ⊆ (Base‘𝑀) ∧ (0g𝑀) ∈ 𝐵 ∧ ∀𝑎𝐵𝑏𝐵 (𝑎(+g𝑀)𝑏) ∈ 𝐵))) → ∀𝑥 ∈ (𝐴𝐵)∀𝑦 ∈ (𝐴𝐵)(𝑥(+g𝑀)𝑦) ∈ (𝐴𝐵))
464, 11, 453jca 1128 . . . . . 6 ((𝑀 ∈ Mnd ∧ ((𝐴 ⊆ (Base‘𝑀) ∧ (0g𝑀) ∈ 𝐴 ∧ ∀𝑎𝐴𝑏𝐴 (𝑎(+g𝑀)𝑏) ∈ 𝐴) ∧ (𝐵 ⊆ (Base‘𝑀) ∧ (0g𝑀) ∈ 𝐵 ∧ ∀𝑎𝐵𝑏𝐵 (𝑎(+g𝑀)𝑏) ∈ 𝐵))) → ((𝐴𝐵) ⊆ (Base‘𝑀) ∧ (0g𝑀) ∈ (𝐴𝐵) ∧ ∀𝑥 ∈ (𝐴𝐵)∀𝑦 ∈ (𝐴𝐵)(𝑥(+g𝑀)𝑦) ∈ (𝐴𝐵)))
4746ex 413 . . . . 5 (𝑀 ∈ Mnd → (((𝐴 ⊆ (Base‘𝑀) ∧ (0g𝑀) ∈ 𝐴 ∧ ∀𝑎𝐴𝑏𝐴 (𝑎(+g𝑀)𝑏) ∈ 𝐴) ∧ (𝐵 ⊆ (Base‘𝑀) ∧ (0g𝑀) ∈ 𝐵 ∧ ∀𝑎𝐵𝑏𝐵 (𝑎(+g𝑀)𝑏) ∈ 𝐵)) → ((𝐴𝐵) ⊆ (Base‘𝑀) ∧ (0g𝑀) ∈ (𝐴𝐵) ∧ ∀𝑥 ∈ (𝐴𝐵)∀𝑦 ∈ (𝐴𝐵)(𝑥(+g𝑀)𝑦) ∈ (𝐴𝐵))))
48 eqid 2736 . . . . . . 7 (Base‘𝑀) = (Base‘𝑀)
49 eqid 2736 . . . . . . 7 (0g𝑀) = (0g𝑀)
50 eqid 2736 . . . . . . 7 (+g𝑀) = (+g𝑀)
5148, 49, 50issubm 18614 . . . . . 6 (𝑀 ∈ Mnd → (𝐴 ∈ (SubMnd‘𝑀) ↔ (𝐴 ⊆ (Base‘𝑀) ∧ (0g𝑀) ∈ 𝐴 ∧ ∀𝑎𝐴𝑏𝐴 (𝑎(+g𝑀)𝑏) ∈ 𝐴)))
5248, 49, 50issubm 18614 . . . . . 6 (𝑀 ∈ Mnd → (𝐵 ∈ (SubMnd‘𝑀) ↔ (𝐵 ⊆ (Base‘𝑀) ∧ (0g𝑀) ∈ 𝐵 ∧ ∀𝑎𝐵𝑏𝐵 (𝑎(+g𝑀)𝑏) ∈ 𝐵)))
5351, 52anbi12d 631 . . . . 5 (𝑀 ∈ Mnd → ((𝐴 ∈ (SubMnd‘𝑀) ∧ 𝐵 ∈ (SubMnd‘𝑀)) ↔ ((𝐴 ⊆ (Base‘𝑀) ∧ (0g𝑀) ∈ 𝐴 ∧ ∀𝑎𝐴𝑏𝐴 (𝑎(+g𝑀)𝑏) ∈ 𝐴) ∧ (𝐵 ⊆ (Base‘𝑀) ∧ (0g𝑀) ∈ 𝐵 ∧ ∀𝑎𝐵𝑏𝐵 (𝑎(+g𝑀)𝑏) ∈ 𝐵))))
5448, 49, 50issubm 18614 . . . . 5 (𝑀 ∈ Mnd → ((𝐴𝐵) ∈ (SubMnd‘𝑀) ↔ ((𝐴𝐵) ⊆ (Base‘𝑀) ∧ (0g𝑀) ∈ (𝐴𝐵) ∧ ∀𝑥 ∈ (𝐴𝐵)∀𝑦 ∈ (𝐴𝐵)(𝑥(+g𝑀)𝑦) ∈ (𝐴𝐵))))
5547, 53, 543imtr4d 293 . . . 4 (𝑀 ∈ Mnd → ((𝐴 ∈ (SubMnd‘𝑀) ∧ 𝐵 ∈ (SubMnd‘𝑀)) → (𝐴𝐵) ∈ (SubMnd‘𝑀)))
5655expd 416 . . 3 (𝑀 ∈ Mnd → (𝐴 ∈ (SubMnd‘𝑀) → (𝐵 ∈ (SubMnd‘𝑀) → (𝐴𝐵) ∈ (SubMnd‘𝑀))))
571, 56mpcom 38 . 2 (𝐴 ∈ (SubMnd‘𝑀) → (𝐵 ∈ (SubMnd‘𝑀) → (𝐴𝐵) ∈ (SubMnd‘𝑀)))
5857imp 407 1 ((𝐴 ∈ (SubMnd‘𝑀) ∧ 𝐵 ∈ (SubMnd‘𝑀)) → (𝐴𝐵) ∈ (SubMnd‘𝑀))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396  w3a 1087  wcel 2106  wral 3064  cin 3909  wss 3910  cfv 6496  (class class class)co 7357  Basecbs 17083  +gcplusg 17133  0gc0g 17321  Mndcmnd 18556  SubMndcsubmnd 18600
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-10 2137  ax-11 2154  ax-12 2171  ax-ext 2707  ax-sep 5256  ax-nul 5263  ax-pow 5320  ax-pr 5384
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-nf 1786  df-sb 2068  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2889  df-ne 2944  df-ral 3065  df-rex 3074  df-rab 3408  df-v 3447  df-sbc 3740  df-csb 3856  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-nul 4283  df-if 4487  df-pw 4562  df-sn 4587  df-pr 4589  df-op 4593  df-uni 4866  df-br 5106  df-opab 5168  df-mpt 5189  df-id 5531  df-xp 5639  df-rel 5640  df-cnv 5641  df-co 5642  df-dm 5643  df-rn 5644  df-res 5645  df-ima 5646  df-iota 6448  df-fun 6498  df-fv 6504  df-ov 7360  df-submnd 18602
This theorem is referenced by:  symgsubmefmnd  19180
  Copyright terms: Public domain W3C validator