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

Theorem mndpsuppss 18875
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 ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅m 𝑉) ∧ 𝐵 ∈ (𝑅m 𝑉))) → ((𝐴f (+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 999 . . . . . 6 (¬ ((𝐴𝑥) ≠ (0g𝑀) ∨ (𝐵𝑥) ≠ (0g𝑀)) ↔ (¬ (𝐴𝑥) ≠ (0g𝑀) ∧ ¬ (𝐵𝑥) ≠ (0g𝑀)))
2 nne 2959 . . . . . . 7 (¬ (𝐴𝑥) ≠ (0g𝑀) ↔ (𝐴𝑥) = (0g𝑀))
3 nne 2959 . . . . . . 7 (¬ (𝐵𝑥) ≠ (0g𝑀) ↔ (𝐵𝑥) = (0g𝑀))
42, 3anbi12i 640 . . . . . 6 ((¬ (𝐴𝑥) ≠ (0g𝑀) ∧ ¬ (𝐵𝑥) ≠ (0g𝑀)) ↔ ((𝐴𝑥) = (0g𝑀) ∧ (𝐵𝑥) = (0g𝑀)))
51, 4bitri 278 . . . . 5 (¬ ((𝐴𝑥) ≠ (0g𝑀) ∨ (𝐵𝑥) ≠ (0g𝑀)) ↔ ((𝐴𝑥) = (0g𝑀) ∧ (𝐵𝑥) = (0g𝑀)))
6 elmapfn 8869 . . . . . . . . . . . 12 (𝐴 ∈ (𝑅m 𝑉) → 𝐴 Fn 𝑉)
76ad2antrl 741 . . . . . . . . . . 11 (((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅m 𝑉) ∧ 𝐵 ∈ (𝑅m 𝑉))) → 𝐴 Fn 𝑉)
87adantr 486 . . . . . . . . . 10 ((((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅m 𝑉) ∧ 𝐵 ∈ (𝑅m 𝑉))) ∧ ((𝐴𝑥) = (0g𝑀) ∧ (𝐵𝑥) = (0g𝑀))) → 𝐴 Fn 𝑉)
9 elmapfn 8869 . . . . . . . . . . . 12 (𝐵 ∈ (𝑅m 𝑉) → 𝐵 Fn 𝑉)
109ad2antll 742 . . . . . . . . . . 11 (((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅m 𝑉) ∧ 𝐵 ∈ (𝑅m 𝑉))) → 𝐵 Fn 𝑉)
1110adantr 486 . . . . . . . . . 10 ((((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅m 𝑉) ∧ 𝐵 ∈ (𝑅m 𝑉))) ∧ ((𝐴𝑥) = (0g𝑀) ∧ (𝐵𝑥) = (0g𝑀))) → 𝐵 Fn 𝑉)
12 simplr 781 . . . . . . . . . . 11 (((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅m 𝑉) ∧ 𝐵 ∈ (𝑅m 𝑉))) → 𝑉𝑋)
1312adantr 486 . . . . . . . . . 10 ((((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅m 𝑉) ∧ 𝐵 ∈ (𝑅m 𝑉))) ∧ ((𝐴𝑥) = (0g𝑀) ∧ (𝐵𝑥) = (0g𝑀))) → 𝑉𝑋)
14 inidm 4172 . . . . . . . . . 10 (𝑉𝑉) = 𝑉
15 simplrl 789 . . . . . . . . . 10 (((((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅m 𝑉) ∧ 𝐵 ∈ (𝑅m 𝑉))) ∧ ((𝐴𝑥) = (0g𝑀) ∧ (𝐵𝑥) = (0g𝑀))) ∧ 𝑥𝑉) → (𝐴𝑥) = (0g𝑀))
16 simplrr 790 . . . . . . . . . 10 (((((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅m 𝑉) ∧ 𝐵 ∈ (𝑅m 𝑉))) ∧ ((𝐴𝑥) = (0g𝑀) ∧ (𝐵𝑥) = (0g𝑀))) ∧ 𝑥𝑉) → (𝐵𝑥) = (0g𝑀))
178, 11, 13, 13, 14, 15, 16ofval 7690 . . . . . . . . 9 (((((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅m 𝑉) ∧ 𝐵 ∈ (𝑅m 𝑉))) ∧ ((𝐴𝑥) = (0g𝑀) ∧ (𝐵𝑥) = (0g𝑀))) ∧ 𝑥𝑉) → ((𝐴f (+g𝑀)𝐵)‘𝑥) = ((0g𝑀)(+g𝑀)(0g𝑀)))
1817an32s 665 . . . . . . . 8 (((((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅m 𝑉) ∧ 𝐵 ∈ (𝑅m 𝑉))) ∧ 𝑥𝑉) ∧ ((𝐴𝑥) = (0g𝑀) ∧ (𝐵𝑥) = (0g𝑀))) → ((𝐴f (+g𝑀)𝐵)‘𝑥) = ((0g𝑀)(+g𝑀)(0g𝑀)))
19 eqid 2760 . . . . . . . . . . . 12 (Base‘𝑀) = (Base‘𝑀)
20 eqid 2760 . . . . . . . . . . . 12 (0g𝑀) = (0g𝑀)
2119, 20mndidcl 18855 . . . . . . . . . . 11 (𝑀 ∈ Mnd → (0g𝑀) ∈ (Base‘𝑀))
2221ancli 558 . . . . . . . . . 10 (𝑀 ∈ Mnd → (𝑀 ∈ Mnd ∧ (0g𝑀) ∈ (Base‘𝑀)))
2322ad4antr 745 . . . . . . . . 9 (((((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅m 𝑉) ∧ 𝐵 ∈ (𝑅m 𝑉))) ∧ 𝑥𝑉) ∧ ((𝐴𝑥) = (0g𝑀) ∧ (𝐵𝑥) = (0g𝑀))) → (𝑀 ∈ Mnd ∧ (0g𝑀) ∈ (Base‘𝑀)))
24 eqid 2760 . . . . . . . . . 10 (+g𝑀) = (+g𝑀)
2519, 24, 20mndlid 18860 . . . . . . . . 9 ((𝑀 ∈ Mnd ∧ (0g𝑀) ∈ (Base‘𝑀)) → ((0g𝑀)(+g𝑀)(0g𝑀)) = (0g𝑀))
2623, 25syl 18 . . . . . . . 8 (((((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅m 𝑉) ∧ 𝐵 ∈ (𝑅m 𝑉))) ∧ 𝑥𝑉) ∧ ((𝐴𝑥) = (0g𝑀) ∧ (𝐵𝑥) = (0g𝑀))) → ((0g𝑀)(+g𝑀)(0g𝑀)) = (0g𝑀))
2718, 26eqtrd 2795 . . . . . . 7 (((((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅m 𝑉) ∧ 𝐵 ∈ (𝑅m 𝑉))) ∧ 𝑥𝑉) ∧ ((𝐴𝑥) = (0g𝑀) ∧ (𝐵𝑥) = (0g𝑀))) → ((𝐴f (+g𝑀)𝐵)‘𝑥) = (0g𝑀))
28 nne 2959 . . . . . . 7 (¬ ((𝐴f (+g𝑀)𝐵)‘𝑥) ≠ (0g𝑀) ↔ ((𝐴f (+g𝑀)𝐵)‘𝑥) = (0g𝑀))
2927, 28sylibr 237 . . . . . 6 (((((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅m 𝑉) ∧ 𝐵 ∈ (𝑅m 𝑉))) ∧ 𝑥𝑉) ∧ ((𝐴𝑥) = (0g𝑀) ∧ (𝐵𝑥) = (0g𝑀))) → ¬ ((𝐴f (+g𝑀)𝐵)‘𝑥) ≠ (0g𝑀))
3029ex 418 . . . . 5 ((((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅m 𝑉) ∧ 𝐵 ∈ (𝑅m 𝑉))) ∧ 𝑥𝑉) → (((𝐴𝑥) = (0g𝑀) ∧ (𝐵𝑥) = (0g𝑀)) → ¬ ((𝐴f (+g𝑀)𝐵)‘𝑥) ≠ (0g𝑀)))
315, 30biimtrid 245 . . . 4 ((((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅m 𝑉) ∧ 𝐵 ∈ (𝑅m 𝑉))) ∧ 𝑥𝑉) → (¬ ((𝐴𝑥) ≠ (0g𝑀) ∨ (𝐵𝑥) ≠ (0g𝑀)) → ¬ ((𝐴f (+g𝑀)𝐵)‘𝑥) ≠ (0g𝑀)))
3231con4d 116 . . 3 ((((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅m 𝑉) ∧ 𝐵 ∈ (𝑅m 𝑉))) ∧ 𝑥𝑉) → (((𝐴f (+g𝑀)𝐵)‘𝑥) ≠ (0g𝑀) → ((𝐴𝑥) ≠ (0g𝑀) ∨ (𝐵𝑥) ≠ (0g𝑀))))
3332ss2rabdv 4023 . 2 (((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅m 𝑉) ∧ 𝐵 ∈ (𝑅m 𝑉))) → {𝑥𝑉 ∣ ((𝐴f (+g𝑀)𝐵)‘𝑥) ≠ (0g𝑀)} ⊆ {𝑥𝑉 ∣ ((𝐴𝑥) ≠ (0g𝑀) ∨ (𝐵𝑥) ≠ (0g𝑀))})
347, 10, 12, 12offun 7693 . . . 4 (((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅m 𝑉) ∧ 𝐵 ∈ (𝑅m 𝑉))) → Fun (𝐴f (+g𝑀)𝐵))
35 ovexd 7449 . . . 4 (((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅m 𝑉) ∧ 𝐵 ∈ (𝑅m 𝑉))) → (𝐴f (+g𝑀)𝐵) ∈ V)
36 fvexd 6894 . . . 4 (((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅m 𝑉) ∧ 𝐵 ∈ (𝑅m 𝑉))) → (0g𝑀) ∈ V)
37 suppval1 8165 . . . 4 ((Fun (𝐴f (+g𝑀)𝐵) ∧ (𝐴f (+g𝑀)𝐵) ∈ V ∧ (0g𝑀) ∈ V) → ((𝐴f (+g𝑀)𝐵) supp (0g𝑀)) = {𝑥 ∈ dom (𝐴f (+g𝑀)𝐵) ∣ ((𝐴f (+g𝑀)𝐵)‘𝑥) ≠ (0g𝑀)})
3834, 35, 36, 37syl3anc 1398 . . 3 (((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅m 𝑉) ∧ 𝐵 ∈ (𝑅m 𝑉))) → ((𝐴f (+g𝑀)𝐵) supp (0g𝑀)) = {𝑥 ∈ dom (𝐴f (+g𝑀)𝐵) ∣ ((𝐴f (+g𝑀)𝐵)‘𝑥) ≠ (0g𝑀)})
3912, 7, 10offvalfv 7701 . . . . . 6 (((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅m 𝑉) ∧ 𝐵 ∈ (𝑅m 𝑉))) → (𝐴f (+g𝑀)𝐵) = (𝑣𝑉 ↦ ((𝐴𝑣)(+g𝑀)(𝐵𝑣))))
4039dmeqd 5889 . . . . 5 (((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅m 𝑉) ∧ 𝐵 ∈ (𝑅m 𝑉))) → dom (𝐴f (+g𝑀)𝐵) = dom (𝑣𝑉 ↦ ((𝐴𝑣)(+g𝑀)(𝐵𝑣))))
41 ovex 7447 . . . . . 6 ((𝐴𝑣)(+g𝑀)(𝐵𝑣)) ∈ V
42 eqid 2760 . . . . . 6 (𝑣𝑉 ↦ ((𝐴𝑣)(+g𝑀)(𝐵𝑣))) = (𝑣𝑉 ↦ ((𝐴𝑣)(+g𝑀)(𝐵𝑣)))
4341, 42dmmpti 6677 . . . . 5 dom (𝑣𝑉 ↦ ((𝐴𝑣)(+g𝑀)(𝐵𝑣))) = 𝑉
4440, 43eqtrdi 2811 . . . 4 (((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅m 𝑉) ∧ 𝐵 ∈ (𝑅m 𝑉))) → dom (𝐴f (+g𝑀)𝐵) = 𝑉)
4544rabeqdv 3427 . . 3 (((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅m 𝑉) ∧ 𝐵 ∈ (𝑅m 𝑉))) → {𝑥 ∈ dom (𝐴f (+g𝑀)𝐵) ∣ ((𝐴f (+g𝑀)𝐵)‘𝑥) ≠ (0g𝑀)} = {𝑥𝑉 ∣ ((𝐴f (+g𝑀)𝐵)‘𝑥) ≠ (0g𝑀)})
4638, 45eqtrd 2795 . 2 (((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅m 𝑉) ∧ 𝐵 ∈ (𝑅m 𝑉))) → ((𝐴f (+g𝑀)𝐵) supp (0g𝑀)) = {𝑥𝑉 ∣ ((𝐴f (+g𝑀)𝐵)‘𝑥) ≠ (0g𝑀)})
47 elmapfun 8870 . . . . . . 7 (𝐴 ∈ (𝑅m 𝑉) → Fun 𝐴)
48 id 23 . . . . . . 7 (𝐴 ∈ (𝑅m 𝑉) → 𝐴 ∈ (𝑅m 𝑉))
49 fvexd 6894 . . . . . . 7 (𝐴 ∈ (𝑅m 𝑉) → (0g𝑀) ∈ V)
50 suppval1 8165 . . . . . . 7 ((Fun 𝐴𝐴 ∈ (𝑅m 𝑉) ∧ (0g𝑀) ∈ V) → (𝐴 supp (0g𝑀)) = {𝑥 ∈ dom 𝐴 ∣ (𝐴𝑥) ≠ (0g𝑀)})
5147, 48, 49, 50syl3anc 1398 . . . . . 6 (𝐴 ∈ (𝑅m 𝑉) → (𝐴 supp (0g𝑀)) = {𝑥 ∈ dom 𝐴 ∣ (𝐴𝑥) ≠ (0g𝑀)})
52 elmapi 8851 . . . . . . 7 (𝐴 ∈ (𝑅m 𝑉) → 𝐴:𝑉𝑅)
53 fdm 6713 . . . . . . 7 (𝐴:𝑉𝑅 → dom 𝐴 = 𝑉)
54 rabeq 3426 . . . . . . 7 (dom 𝐴 = 𝑉 → {𝑥 ∈ dom 𝐴 ∣ (𝐴𝑥) ≠ (0g𝑀)} = {𝑥𝑉 ∣ (𝐴𝑥) ≠ (0g𝑀)})
5552, 53, 543syl 19 . . . . . 6 (𝐴 ∈ (𝑅m 𝑉) → {𝑥 ∈ dom 𝐴 ∣ (𝐴𝑥) ≠ (0g𝑀)} = {𝑥𝑉 ∣ (𝐴𝑥) ≠ (0g𝑀)})
5651, 55eqtrd 2795 . . . . 5 (𝐴 ∈ (𝑅m 𝑉) → (𝐴 supp (0g𝑀)) = {𝑥𝑉 ∣ (𝐴𝑥) ≠ (0g𝑀)})
5756ad2antrl 741 . . . 4 (((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅m 𝑉) ∧ 𝐵 ∈ (𝑅m 𝑉))) → (𝐴 supp (0g𝑀)) = {𝑥𝑉 ∣ (𝐴𝑥) ≠ (0g𝑀)})
58 elmapfun 8870 . . . . . . 7 (𝐵 ∈ (𝑅m 𝑉) → Fun 𝐵)
5958ad2antll 742 . . . . . 6 (((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅m 𝑉) ∧ 𝐵 ∈ (𝑅m 𝑉))) → Fun 𝐵)
60 simprr 785 . . . . . 6 (((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅m 𝑉) ∧ 𝐵 ∈ (𝑅m 𝑉))) → 𝐵 ∈ (𝑅m 𝑉))
61 suppval1 8165 . . . . . 6 ((Fun 𝐵𝐵 ∈ (𝑅m 𝑉) ∧ (0g𝑀) ∈ V) → (𝐵 supp (0g𝑀)) = {𝑥 ∈ dom 𝐵 ∣ (𝐵𝑥) ≠ (0g𝑀)})
6259, 60, 36, 61syl3anc 1398 . . . . 5 (((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅m 𝑉) ∧ 𝐵 ∈ (𝑅m 𝑉))) → (𝐵 supp (0g𝑀)) = {𝑥 ∈ dom 𝐵 ∣ (𝐵𝑥) ≠ (0g𝑀)})
63 elmapi 8851 . . . . . . . 8 (𝐵 ∈ (𝑅m 𝑉) → 𝐵:𝑉𝑅)
6463fdmd 6714 . . . . . . 7 (𝐵 ∈ (𝑅m 𝑉) → dom 𝐵 = 𝑉)
6564ad2antll 742 . . . . . 6 (((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅m 𝑉) ∧ 𝐵 ∈ (𝑅m 𝑉))) → dom 𝐵 = 𝑉)
6665rabeqdv 3427 . . . . 5 (((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅m 𝑉) ∧ 𝐵 ∈ (𝑅m 𝑉))) → {𝑥 ∈ dom 𝐵 ∣ (𝐵𝑥) ≠ (0g𝑀)} = {𝑥𝑉 ∣ (𝐵𝑥) ≠ (0g𝑀)})
6762, 66eqtrd 2795 . . . 4 (((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅m 𝑉) ∧ 𝐵 ∈ (𝑅m 𝑉))) → (𝐵 supp (0g𝑀)) = {𝑥𝑉 ∣ (𝐵𝑥) ≠ (0g𝑀)})
6857, 67uneq12d 4116 . . 3 (((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅m 𝑉) ∧ 𝐵 ∈ (𝑅m 𝑉))) → ((𝐴 supp (0g𝑀)) ∪ (𝐵 supp (0g𝑀))) = ({𝑥𝑉 ∣ (𝐴𝑥) ≠ (0g𝑀)} ∪ {𝑥𝑉 ∣ (𝐵𝑥) ≠ (0g𝑀)}))
69 unrab 4261 . . 3 ({𝑥𝑉 ∣ (𝐴𝑥) ≠ (0g𝑀)} ∪ {𝑥𝑉 ∣ (𝐵𝑥) ≠ (0g𝑀)}) = {𝑥𝑉 ∣ ((𝐴𝑥) ≠ (0g𝑀) ∨ (𝐵𝑥) ≠ (0g𝑀))}
7068, 69eqtrdi 2811 . 2 (((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅m 𝑉) ∧ 𝐵 ∈ (𝑅m 𝑉))) → ((𝐴 supp (0g𝑀)) ∪ (𝐵 supp (0g𝑀))) = {𝑥𝑉 ∣ ((𝐴𝑥) ≠ (0g𝑀) ∨ (𝐵𝑥) ≠ (0g𝑀))})
7133, 46, 703sstr4d 3986 1 (((𝑀 ∈ Mnd ∧ 𝑉𝑋) ∧ (𝐴 ∈ (𝑅m 𝑉) ∧ 𝐵 ∈ (𝑅m 𝑉))) → ((𝐴f (+g𝑀)𝐵) supp (0g𝑀)) ⊆ ((𝐴 supp (0g𝑀)) ∪ (𝐵 supp (0g𝑀))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wi 4  wa 401  wo 861   = wceq 1570  wcel 2145  wne 2955  {crab 3412  Vcvv 3450  cun 3897  wss 3899  cmpt 5186  dom cdm 5655  Fun wfun 6527   Fn wfn 6528  wf 6529  cfv 6533  (class class class)co 7414  f cof 7677   supp csupp 8159  m cmap 8829  Basecbs 17304  +gcplusg 17345  0gc0g 17527  Mndcmnd 18839
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 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7737
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  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-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-riota 7371  df-ov 7417  df-oprab 7418  df-mpo 7419  df-of 7679  df-1st 7987  df-2nd 7988  df-supp 8160  df-map 8831  df-0g 17529  df-mgm 18733  df-sgrp 18824  df-mnd 18840
This theorem is used by:  mndpsuppfi  18876
  Copyright terms: Public domain W3C validator