Users' Mathboxes Mathbox for Alexander van der Vekens < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  mndpsuppss Structured version   Visualization version   GIF version

Theorem mndpsuppss 43921
Description: The support of a mapping of a scalar multiplication with a function of scalars is a subset of the support of the function of scalars. (Contributed by AV, 5-Apr-2019.)
Hypothesis
Ref Expression
mndpsuppss.r 𝑅 = (Base‘𝑀)
Assertion
Ref Expression
mndpsuppss (((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅𝑚 𝑉) ∧ 𝐵 ∈ (𝑅𝑚 𝑉))) → ((𝐴𝑓 (+g𝑀)𝐵) supp (0g𝑀)) ⊆ ((𝐴 supp (0g𝑀)) ∪ (𝐵 supp (0g𝑀))))

Proof of Theorem mndpsuppss
Dummy variables 𝑣 𝑥 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ioran 978 . . . . . 6 (¬ ((𝐴𝑥) ≠ (0g𝑀) ∨ (𝐵𝑥) ≠ (0g𝑀)) ↔ (¬ (𝐴𝑥) ≠ (0g𝑀) ∧ ¬ (𝐵𝑥) ≠ (0g𝑀)))
2 nne 2990 . . . . . . 7 (¬ (𝐴𝑥) ≠ (0g𝑀) ↔ (𝐴𝑥) = (0g𝑀))
3 nne 2990 . . . . . . 7 (¬ (𝐵𝑥) ≠ (0g𝑀) ↔ (𝐵𝑥) = (0g𝑀))
42, 3anbi12i 626 . . . . . 6 ((¬ (𝐴𝑥) ≠ (0g𝑀) ∧ ¬ (𝐵𝑥) ≠ (0g𝑀)) ↔ ((𝐴𝑥) = (0g𝑀) ∧ (𝐵𝑥) = (0g𝑀)))
51, 4bitri 276 . . . . 5 (¬ ((𝐴𝑥) ≠ (0g𝑀) ∨ (𝐵𝑥) ≠ (0g𝑀)) ↔ ((𝐴𝑥) = (0g𝑀) ∧ (𝐵𝑥) = (0g𝑀)))
6 elmapfn 8286 . . . . . . . . . . . 12 (𝐴 ∈ (𝑅𝑚 𝑉) → 𝐴 Fn 𝑉)
76ad2antrl 724 . . . . . . . . . . 11 (((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅𝑚 𝑉) ∧ 𝐵 ∈ (𝑅𝑚 𝑉))) → 𝐴 Fn 𝑉)
87adantr 481 . . . . . . . . . 10 ((((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅𝑚 𝑉) ∧ 𝐵 ∈ (𝑅𝑚 𝑉))) ∧ ((𝐴𝑥) = (0g𝑀) ∧ (𝐵𝑥) = (0g𝑀))) → 𝐴 Fn 𝑉)
9 elmapfn 8286 . . . . . . . . . . . 12 (𝐵 ∈ (𝑅𝑚 𝑉) → 𝐵 Fn 𝑉)
109ad2antll 725 . . . . . . . . . . 11 (((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅𝑚 𝑉) ∧ 𝐵 ∈ (𝑅𝑚 𝑉))) → 𝐵 Fn 𝑉)
1110adantr 481 . . . . . . . . . 10 ((((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅𝑚 𝑉) ∧ 𝐵 ∈ (𝑅𝑚 𝑉))) ∧ ((𝐴𝑥) = (0g𝑀) ∧ (𝐵𝑥) = (0g𝑀))) → 𝐵 Fn 𝑉)
12 simplr 765 . . . . . . . . . . 11 (((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅𝑚 𝑉) ∧ 𝐵 ∈ (𝑅𝑚 𝑉))) → 𝑉𝑋)
1312adantr 481 . . . . . . . . . 10 ((((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅𝑚 𝑉) ∧ 𝐵 ∈ (𝑅𝑚 𝑉))) ∧ ((𝐴𝑥) = (0g𝑀) ∧ (𝐵𝑥) = (0g𝑀))) → 𝑉𝑋)
14 inidm 4121 . . . . . . . . . 10 (𝑉𝑉) = 𝑉
15 simplrl 773 . . . . . . . . . 10 (((((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅𝑚 𝑉) ∧ 𝐵 ∈ (𝑅𝑚 𝑉))) ∧ ((𝐴𝑥) = (0g𝑀) ∧ (𝐵𝑥) = (0g𝑀))) ∧ 𝑥𝑉) → (𝐴𝑥) = (0g𝑀))
16 simplrr 774 . . . . . . . . . 10 (((((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅𝑚 𝑉) ∧ 𝐵 ∈ (𝑅𝑚 𝑉))) ∧ ((𝐴𝑥) = (0g𝑀) ∧ (𝐵𝑥) = (0g𝑀))) ∧ 𝑥𝑉) → (𝐵𝑥) = (0g𝑀))
178, 11, 13, 13, 14, 15, 16ofval 7283 . . . . . . . . 9 (((((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅𝑚 𝑉) ∧ 𝐵 ∈ (𝑅𝑚 𝑉))) ∧ ((𝐴𝑥) = (0g𝑀) ∧ (𝐵𝑥) = (0g𝑀))) ∧ 𝑥𝑉) → ((𝐴𝑓 (+g𝑀)𝐵)‘𝑥) = ((0g𝑀)(+g𝑀)(0g𝑀)))
1817an32s 648 . . . . . . . 8 (((((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅𝑚 𝑉) ∧ 𝐵 ∈ (𝑅𝑚 𝑉))) ∧ 𝑥𝑉) ∧ ((𝐴𝑥) = (0g𝑀) ∧ (𝐵𝑥) = (0g𝑀))) → ((𝐴𝑓 (+g𝑀)𝐵)‘𝑥) = ((0g𝑀)(+g𝑀)(0g𝑀)))
19 eqid 2797 . . . . . . . . . . . 12 (Base‘𝑀) = (Base‘𝑀)
20 eqid 2797 . . . . . . . . . . . 12 (0g𝑀) = (0g𝑀)
2119, 20mndidcl 17751 . . . . . . . . . . 11 (𝑀 ∈ Mnd → (0g𝑀) ∈ (Base‘𝑀))
2221ancli 549 . . . . . . . . . 10 (𝑀 ∈ Mnd → (𝑀 ∈ Mnd ∧ (0g𝑀) ∈ (Base‘𝑀)))
2322ad4antr 728 . . . . . . . . 9 (((((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅𝑚 𝑉) ∧ 𝐵 ∈ (𝑅𝑚 𝑉))) ∧ 𝑥𝑉) ∧ ((𝐴𝑥) = (0g𝑀) ∧ (𝐵𝑥) = (0g𝑀))) → (𝑀 ∈ Mnd ∧ (0g𝑀) ∈ (Base‘𝑀)))
24 eqid 2797 . . . . . . . . . 10 (+g𝑀) = (+g𝑀)
2519, 24, 20mndlid 17754 . . . . . . . . 9 ((𝑀 ∈ Mnd ∧ (0g𝑀) ∈ (Base‘𝑀)) → ((0g𝑀)(+g𝑀)(0g𝑀)) = (0g𝑀))
2623, 25syl 17 . . . . . . . 8 (((((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅𝑚 𝑉) ∧ 𝐵 ∈ (𝑅𝑚 𝑉))) ∧ 𝑥𝑉) ∧ ((𝐴𝑥) = (0g𝑀) ∧ (𝐵𝑥) = (0g𝑀))) → ((0g𝑀)(+g𝑀)(0g𝑀)) = (0g𝑀))
2718, 26eqtrd 2833 . . . . . . 7 (((((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅𝑚 𝑉) ∧ 𝐵 ∈ (𝑅𝑚 𝑉))) ∧ 𝑥𝑉) ∧ ((𝐴𝑥) = (0g𝑀) ∧ (𝐵𝑥) = (0g𝑀))) → ((𝐴𝑓 (+g𝑀)𝐵)‘𝑥) = (0g𝑀))
28 nne 2990 . . . . . . 7 (¬ ((𝐴𝑓 (+g𝑀)𝐵)‘𝑥) ≠ (0g𝑀) ↔ ((𝐴𝑓 (+g𝑀)𝐵)‘𝑥) = (0g𝑀))
2927, 28sylibr 235 . . . . . 6 (((((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅𝑚 𝑉) ∧ 𝐵 ∈ (𝑅𝑚 𝑉))) ∧ 𝑥𝑉) ∧ ((𝐴𝑥) = (0g𝑀) ∧ (𝐵𝑥) = (0g𝑀))) → ¬ ((𝐴𝑓 (+g𝑀)𝐵)‘𝑥) ≠ (0g𝑀))
3029ex 413 . . . . 5 ((((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅𝑚 𝑉) ∧ 𝐵 ∈ (𝑅𝑚 𝑉))) ∧ 𝑥𝑉) → (((𝐴𝑥) = (0g𝑀) ∧ (𝐵𝑥) = (0g𝑀)) → ¬ ((𝐴𝑓 (+g𝑀)𝐵)‘𝑥) ≠ (0g𝑀)))
315, 30syl5bi 243 . . . 4 ((((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅𝑚 𝑉) ∧ 𝐵 ∈ (𝑅𝑚 𝑉))) ∧ 𝑥𝑉) → (¬ ((𝐴𝑥) ≠ (0g𝑀) ∨ (𝐵𝑥) ≠ (0g𝑀)) → ¬ ((𝐴𝑓 (+g𝑀)𝐵)‘𝑥) ≠ (0g𝑀)))
3231con4d 115 . . 3 ((((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅𝑚 𝑉) ∧ 𝐵 ∈ (𝑅𝑚 𝑉))) ∧ 𝑥𝑉) → (((𝐴𝑓 (+g𝑀)𝐵)‘𝑥) ≠ (0g𝑀) → ((𝐴𝑥) ≠ (0g𝑀) ∨ (𝐵𝑥) ≠ (0g𝑀))))
3332ss2rabdv 3979 . 2 (((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅𝑚 𝑉) ∧ 𝐵 ∈ (𝑅𝑚 𝑉))) → {𝑥𝑉 ∣ ((𝐴𝑓 (+g𝑀)𝐵)‘𝑥) ≠ (0g𝑀)} ⊆ {𝑥𝑉 ∣ ((𝐴𝑥) ≠ (0g𝑀) ∨ (𝐵𝑥) ≠ (0g𝑀))})
347, 10, 12, 12, 14offn 7285 . . . . 5 (((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅𝑚 𝑉) ∧ 𝐵 ∈ (𝑅𝑚 𝑉))) → (𝐴𝑓 (+g𝑀)𝐵) Fn 𝑉)
35 fnfun 6330 . . . . 5 ((𝐴𝑓 (+g𝑀)𝐵) Fn 𝑉 → Fun (𝐴𝑓 (+g𝑀)𝐵))
3634, 35syl 17 . . . 4 (((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅𝑚 𝑉) ∧ 𝐵 ∈ (𝑅𝑚 𝑉))) → Fun (𝐴𝑓 (+g𝑀)𝐵))
37 ovex 7055 . . . . 5 (𝐴𝑓 (+g𝑀)𝐵) ∈ V
3837a1i 11 . . . 4 (((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅𝑚 𝑉) ∧ 𝐵 ∈ (𝑅𝑚 𝑉))) → (𝐴𝑓 (+g𝑀)𝐵) ∈ V)
39 fvexd 6560 . . . 4 (((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅𝑚 𝑉) ∧ 𝐵 ∈ (𝑅𝑚 𝑉))) → (0g𝑀) ∈ V)
40 suppval1 7694 . . . 4 ((Fun (𝐴𝑓 (+g𝑀)𝐵) ∧ (𝐴𝑓 (+g𝑀)𝐵) ∈ V ∧ (0g𝑀) ∈ V) → ((𝐴𝑓 (+g𝑀)𝐵) supp (0g𝑀)) = {𝑥 ∈ dom (𝐴𝑓 (+g𝑀)𝐵) ∣ ((𝐴𝑓 (+g𝑀)𝐵)‘𝑥) ≠ (0g𝑀)})
4136, 38, 39, 40syl3anc 1364 . . 3 (((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅𝑚 𝑉) ∧ 𝐵 ∈ (𝑅𝑚 𝑉))) → ((𝐴𝑓 (+g𝑀)𝐵) supp (0g𝑀)) = {𝑥 ∈ dom (𝐴𝑓 (+g𝑀)𝐵) ∣ ((𝐴𝑓 (+g𝑀)𝐵)‘𝑥) ≠ (0g𝑀)})
4212, 7, 10offvalfv 43891 . . . . . 6 (((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅𝑚 𝑉) ∧ 𝐵 ∈ (𝑅𝑚 𝑉))) → (𝐴𝑓 (+g𝑀)𝐵) = (𝑣𝑉 ↦ ((𝐴𝑣)(+g𝑀)(𝐵𝑣))))
4342dmeqd 5667 . . . . 5 (((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅𝑚 𝑉) ∧ 𝐵 ∈ (𝑅𝑚 𝑉))) → dom (𝐴𝑓 (+g𝑀)𝐵) = dom (𝑣𝑉 ↦ ((𝐴𝑣)(+g𝑀)(𝐵𝑣))))
44 ovex 7055 . . . . . 6 ((𝐴𝑣)(+g𝑀)(𝐵𝑣)) ∈ V
45 eqid 2797 . . . . . 6 (𝑣𝑉 ↦ ((𝐴𝑣)(+g𝑀)(𝐵𝑣))) = (𝑣𝑉 ↦ ((𝐴𝑣)(+g𝑀)(𝐵𝑣)))
4644, 45dmmpti 6367 . . . . 5 dom (𝑣𝑉 ↦ ((𝐴𝑣)(+g𝑀)(𝐵𝑣))) = 𝑉
4743, 46syl6eq 2849 . . . 4 (((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅𝑚 𝑉) ∧ 𝐵 ∈ (𝑅𝑚 𝑉))) → dom (𝐴𝑓 (+g𝑀)𝐵) = 𝑉)
48 rabeq 3431 . . . 4 (dom (𝐴𝑓 (+g𝑀)𝐵) = 𝑉 → {𝑥 ∈ dom (𝐴𝑓 (+g𝑀)𝐵) ∣ ((𝐴𝑓 (+g𝑀)𝐵)‘𝑥) ≠ (0g𝑀)} = {𝑥𝑉 ∣ ((𝐴𝑓 (+g𝑀)𝐵)‘𝑥) ≠ (0g𝑀)})
4947, 48syl 17 . . 3 (((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅𝑚 𝑉) ∧ 𝐵 ∈ (𝑅𝑚 𝑉))) → {𝑥 ∈ dom (𝐴𝑓 (+g𝑀)𝐵) ∣ ((𝐴𝑓 (+g𝑀)𝐵)‘𝑥) ≠ (0g𝑀)} = {𝑥𝑉 ∣ ((𝐴𝑓 (+g𝑀)𝐵)‘𝑥) ≠ (0g𝑀)})
5041, 49eqtrd 2833 . 2 (((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅𝑚 𝑉) ∧ 𝐵 ∈ (𝑅𝑚 𝑉))) → ((𝐴𝑓 (+g𝑀)𝐵) supp (0g𝑀)) = {𝑥𝑉 ∣ ((𝐴𝑓 (+g𝑀)𝐵)‘𝑥) ≠ (0g𝑀)})
51 elmapfun 8287 . . . . . . 7 (𝐴 ∈ (𝑅𝑚 𝑉) → Fun 𝐴)
52 id 22 . . . . . . 7 (𝐴 ∈ (𝑅𝑚 𝑉) → 𝐴 ∈ (𝑅𝑚 𝑉))
53 fvexd 6560 . . . . . . 7 (𝐴 ∈ (𝑅𝑚 𝑉) → (0g𝑀) ∈ V)
54 suppval1 7694 . . . . . . 7 ((Fun 𝐴𝐴 ∈ (𝑅𝑚 𝑉) ∧ (0g𝑀) ∈ V) → (𝐴 supp (0g𝑀)) = {𝑥 ∈ dom 𝐴 ∣ (𝐴𝑥) ≠ (0g𝑀)})
5551, 52, 53, 54syl3anc 1364 . . . . . 6 (𝐴 ∈ (𝑅𝑚 𝑉) → (𝐴 supp (0g𝑀)) = {𝑥 ∈ dom 𝐴 ∣ (𝐴𝑥) ≠ (0g𝑀)})
56 elmapi 8285 . . . . . . 7 (𝐴 ∈ (𝑅𝑚 𝑉) → 𝐴:𝑉𝑅)
57 fdm 6397 . . . . . . 7 (𝐴:𝑉𝑅 → dom 𝐴 = 𝑉)
58 rabeq 3431 . . . . . . 7 (dom 𝐴 = 𝑉 → {𝑥 ∈ dom 𝐴 ∣ (𝐴𝑥) ≠ (0g𝑀)} = {𝑥𝑉 ∣ (𝐴𝑥) ≠ (0g𝑀)})
5956, 57, 583syl 18 . . . . . 6 (𝐴 ∈ (𝑅𝑚 𝑉) → {𝑥 ∈ dom 𝐴 ∣ (𝐴𝑥) ≠ (0g𝑀)} = {𝑥𝑉 ∣ (𝐴𝑥) ≠ (0g𝑀)})
6055, 59eqtrd 2833 . . . . 5 (𝐴 ∈ (𝑅𝑚 𝑉) → (𝐴 supp (0g𝑀)) = {𝑥𝑉 ∣ (𝐴𝑥) ≠ (0g𝑀)})
6160ad2antrl 724 . . . 4 (((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅𝑚 𝑉) ∧ 𝐵 ∈ (𝑅𝑚 𝑉))) → (𝐴 supp (0g𝑀)) = {𝑥𝑉 ∣ (𝐴𝑥) ≠ (0g𝑀)})
62 elmapfun 8287 . . . . . . 7 (𝐵 ∈ (𝑅𝑚 𝑉) → Fun 𝐵)
6362ad2antll 725 . . . . . 6 (((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅𝑚 𝑉) ∧ 𝐵 ∈ (𝑅𝑚 𝑉))) → Fun 𝐵)
64 simprr 769 . . . . . 6 (((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅𝑚 𝑉) ∧ 𝐵 ∈ (𝑅𝑚 𝑉))) → 𝐵 ∈ (𝑅𝑚 𝑉))
65 suppval1 7694 . . . . . 6 ((Fun 𝐵𝐵 ∈ (𝑅𝑚 𝑉) ∧ (0g𝑀) ∈ V) → (𝐵 supp (0g𝑀)) = {𝑥 ∈ dom 𝐵 ∣ (𝐵𝑥) ≠ (0g𝑀)})
6663, 64, 39, 65syl3anc 1364 . . . . 5 (((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅𝑚 𝑉) ∧ 𝐵 ∈ (𝑅𝑚 𝑉))) → (𝐵 supp (0g𝑀)) = {𝑥 ∈ dom 𝐵 ∣ (𝐵𝑥) ≠ (0g𝑀)})
67 elmapi 8285 . . . . . . . 8 (𝐵 ∈ (𝑅𝑚 𝑉) → 𝐵:𝑉𝑅)
6867fdmd 6398 . . . . . . 7 (𝐵 ∈ (𝑅𝑚 𝑉) → dom 𝐵 = 𝑉)
6968ad2antll 725 . . . . . 6 (((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅𝑚 𝑉) ∧ 𝐵 ∈ (𝑅𝑚 𝑉))) → dom 𝐵 = 𝑉)
70 rabeq 3431 . . . . . 6 (dom 𝐵 = 𝑉 → {𝑥 ∈ dom 𝐵 ∣ (𝐵𝑥) ≠ (0g𝑀)} = {𝑥𝑉 ∣ (𝐵𝑥) ≠ (0g𝑀)})
7169, 70syl 17 . . . . 5 (((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅𝑚 𝑉) ∧ 𝐵 ∈ (𝑅𝑚 𝑉))) → {𝑥 ∈ dom 𝐵 ∣ (𝐵𝑥) ≠ (0g𝑀)} = {𝑥𝑉 ∣ (𝐵𝑥) ≠ (0g𝑀)})
7266, 71eqtrd 2833 . . . 4 (((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅𝑚 𝑉) ∧ 𝐵 ∈ (𝑅𝑚 𝑉))) → (𝐵 supp (0g𝑀)) = {𝑥𝑉 ∣ (𝐵𝑥) ≠ (0g𝑀)})
7361, 72uneq12d 4067 . . 3 (((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅𝑚 𝑉) ∧ 𝐵 ∈ (𝑅𝑚 𝑉))) → ((𝐴 supp (0g𝑀)) ∪ (𝐵 supp (0g𝑀))) = ({𝑥𝑉 ∣ (𝐴𝑥) ≠ (0g𝑀)} ∪ {𝑥𝑉 ∣ (𝐵𝑥) ≠ (0g𝑀)}))
74 unrab 4200 . . 3 ({𝑥𝑉 ∣ (𝐴𝑥) ≠ (0g𝑀)} ∪ {𝑥𝑉 ∣ (𝐵𝑥) ≠ (0g𝑀)}) = {𝑥𝑉 ∣ ((𝐴𝑥) ≠ (0g𝑀) ∨ (𝐵𝑥) ≠ (0g𝑀))}
7573, 74syl6eq 2849 . 2 (((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅𝑚 𝑉) ∧ 𝐵 ∈ (𝑅𝑚 𝑉))) → ((𝐴 supp (0g𝑀)) ∪ (𝐵 supp (0g𝑀))) = {𝑥𝑉 ∣ ((𝐴𝑥) ≠ (0g𝑀) ∨ (𝐵𝑥) ≠ (0g𝑀))})
7633, 50, 753sstr4d 3941 1 (((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅𝑚 𝑉) ∧ 𝐵 ∈ (𝑅𝑚 𝑉))) → ((𝐴𝑓 (+g𝑀)𝐵) supp (0g𝑀)) ⊆ ((𝐴 supp (0g𝑀)) ∪ (𝐵 supp (0g𝑀))))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 396  wo 842   = wceq 1525  wcel 2083  wne 2986  {crab 3111  Vcvv 3440  cun 3863  wss 3865  cmpt 5047  dom cdm 5450  Fun wfun 6226   Fn wfn 6227  wf 6228  cfv 6232  (class class class)co 7023  𝑓 cof 7272   supp csupp 7688  𝑚 cmap 8263  Basecbs 16316  +gcplusg 16398  0gc0g 16546  Mndcmnd 17737
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1781  ax-4 1795  ax-5 1892  ax-6 1951  ax-7 1996  ax-8 2085  ax-9 2093  ax-10 2114  ax-11 2128  ax-12 2143  ax-13 2346  ax-ext 2771  ax-rep 5088  ax-sep 5101  ax-nul 5108  ax-pow 5164  ax-pr 5228  ax-un 7326
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 843  df-3an 1082  df-tru 1528  df-ex 1766  df-nf 1770  df-sb 2045  df-mo 2578  df-eu 2614  df-clab 2778  df-cleq 2790  df-clel 2865  df-nfc 2937  df-ne 2987  df-ral 3112  df-rex 3113  df-reu 3114  df-rmo 3115  df-rab 3116  df-v 3442  df-sbc 3712  df-csb 3818  df-dif 3868  df-un 3870  df-in 3872  df-ss 3880  df-nul 4218  df-if 4388  df-pw 4461  df-sn 4479  df-pr 4481  df-op 4485  df-uni 4752  df-iun 4833  df-br 4969  df-opab 5031  df-mpt 5048  df-id 5355  df-xp 5456  df-rel 5457  df-cnv 5458  df-co 5459  df-dm 5460  df-rn 5461  df-res 5462  df-ima 5463  df-iota 6196  df-fun 6234  df-fn 6235  df-f 6236  df-f1 6237  df-fo 6238  df-f1o 6239  df-fv 6240  df-riota 6984  df-ov 7026  df-oprab 7027  df-mpo 7028  df-of 7274  df-1st 7552  df-2nd 7553  df-supp 7689  df-map 8265  df-0g 16548  df-mgm 17685  df-sgrp 17727  df-mnd 17738
This theorem is referenced by:  mndpsuppfi  43925
  Copyright terms: Public domain W3C validator