Metamath Proof Explorer


Theorem fsuppmapnn0fiublem

Description: Lemma for fsuppmapnn0fiub and fsuppmapnn0fiubex . (Contributed by AV, 2-Oct-2019)

Ref Expression
Hypotheses fsuppmapnn0fiub.u ⊢ U = ⋃ f ∈ M supp Z⁡ f
fsuppmapnn0fiub.s ⊢ S = sup U ℝ <
Assertion fsuppmapnn0fiublem ⊢ M ⊆ R ℕ 0 ∧ M ∈ Fin ∧ Z ∈ V → ∀ f ∈ M finSupp Z⁡ f ∧ U ≠ ∅ → S ∈ ℕ 0

Proof

Step Hyp Ref Expression
1 fsuppmapnn0fiub.u ⊢ U = ⋃ f ∈ M supp Z⁡ f
2 fsuppmapnn0fiub.s ⊢ S = sup U ℝ <
3 nfv ⊢ Ⅎ f M ⊆ R ℕ 0 ∧ M ∈ Fin ∧ Z ∈ V
4 nfra1 ⊢ Ⅎ f ∀ f ∈ M finSupp Z⁡ f
5 nfv ⊢ Ⅎ f U ≠ ∅
6 4 5 nfan ⊢ Ⅎ f ∀ f ∈ M finSupp Z⁡ f ∧ U ≠ ∅
7 3 6 nfan ⊢ Ⅎ f M ⊆ R ℕ 0 ∧ M ∈ Fin ∧ Z ∈ V ∧ ∀ f ∈ M finSupp Z⁡ f ∧ U ≠ ∅
8 suppssdm ⊢ f supp Z ⊆ dom ⁡ f
9 ssel2 ⊢ M ⊆ R ℕ 0 ∧ f ∈ M → f ∈ R ℕ 0
10 elmapfn ⊢ f ∈ R ℕ 0 → f Fn ℕ 0
11 fndm ⊢ f Fn ℕ 0 → dom ⁡ f = ℕ 0
12 eqimss ⊢ dom ⁡ f = ℕ 0 → dom ⁡ f ⊆ ℕ 0
13 9 10 11 12 4syl ⊢ M ⊆ R ℕ 0 ∧ f ∈ M → dom ⁡ f ⊆ ℕ 0
14 13 ex ⊢ M ⊆ R ℕ 0 → f ∈ M → dom ⁡ f ⊆ ℕ 0
15 14 3ad2ant1 ⊢ M ⊆ R ℕ 0 ∧ M ∈ Fin ∧ Z ∈ V → f ∈ M → dom ⁡ f ⊆ ℕ 0
16 15 adantr ⊢ M ⊆ R ℕ 0 ∧ M ∈ Fin ∧ Z ∈ V ∧ ∀ f ∈ M finSupp Z⁡ f ∧ U ≠ ∅ → f ∈ M → dom ⁡ f ⊆ ℕ 0
17 16 imp ⊢ M ⊆ R ℕ 0 ∧ M ∈ Fin ∧ Z ∈ V ∧ ∀ f ∈ M finSupp Z⁡ f ∧ U ≠ ∅ ∧ f ∈ M → dom ⁡ f ⊆ ℕ 0
18 8 17 sstrid ⊢ M ⊆ R ℕ 0 ∧ M ∈ Fin ∧ Z ∈ V ∧ ∀ f ∈ M finSupp Z⁡ f ∧ U ≠ ∅ ∧ f ∈ M → f supp Z ⊆ ℕ 0
19 18 ex ⊢ M ⊆ R ℕ 0 ∧ M ∈ Fin ∧ Z ∈ V ∧ ∀ f ∈ M finSupp Z⁡ f ∧ U ≠ ∅ → f ∈ M → f supp Z ⊆ ℕ 0
20 7 19 ralrimi ⊢ M ⊆ R ℕ 0 ∧ M ∈ Fin ∧ Z ∈ V ∧ ∀ f ∈ M finSupp Z⁡ f ∧ U ≠ ∅ → ∀ f ∈ M f supp Z ⊆ ℕ 0
21 iunss ⊢ ⋃ f ∈ M supp Z⁡ f ⊆ ℕ 0 ↔ ∀ f ∈ M f supp Z ⊆ ℕ 0
22 20 21 sylibr ⊢ M ⊆ R ℕ 0 ∧ M ∈ Fin ∧ Z ∈ V ∧ ∀ f ∈ M finSupp Z⁡ f ∧ U ≠ ∅ → ⋃ f ∈ M supp Z⁡ f ⊆ ℕ 0
23 1 22 eqsstrid ⊢ M ⊆ R ℕ 0 ∧ M ∈ Fin ∧ Z ∈ V ∧ ∀ f ∈ M finSupp Z⁡ f ∧ U ≠ ∅ → U ⊆ ℕ 0
24 ltso ⊢ < Or ℝ
25 24 a1i ⊢ M ⊆ R ℕ 0 ∧ M ∈ Fin ∧ Z ∈ V ∧ ∀ f ∈ M finSupp Z⁡ f ∧ U ≠ ∅ → < Or ℝ
26 simp2 ⊢ M ⊆ R ℕ 0 ∧ M ∈ Fin ∧ Z ∈ V → M ∈ Fin
27 id ⊢ finSupp Z⁡ f → finSupp Z⁡ f
28 27 fsuppimpd ⊢ finSupp Z⁡ f → f supp Z ∈ Fin
29 28 ralimi ⊢ ∀ f ∈ M finSupp Z⁡ f → ∀ f ∈ M f supp Z ∈ Fin
30 29 adantr ⊢ ∀ f ∈ M finSupp Z⁡ f ∧ U ≠ ∅ → ∀ f ∈ M f supp Z ∈ Fin
31 iunfi ⊢ M ∈ Fin ∧ ∀ f ∈ M f supp Z ∈ Fin → ⋃ f ∈ M supp Z⁡ f ∈ Fin
32 26 30 31 syl2an ⊢ M ⊆ R ℕ 0 ∧ M ∈ Fin ∧ Z ∈ V ∧ ∀ f ∈ M finSupp Z⁡ f ∧ U ≠ ∅ → ⋃ f ∈ M supp Z⁡ f ∈ Fin
33 1 32 eqeltrid ⊢ M ⊆ R ℕ 0 ∧ M ∈ Fin ∧ Z ∈ V ∧ ∀ f ∈ M finSupp Z⁡ f ∧ U ≠ ∅ → U ∈ Fin
34 simprr ⊢ M ⊆ R ℕ 0 ∧ M ∈ Fin ∧ Z ∈ V ∧ ∀ f ∈ M finSupp Z⁡ f ∧ U ≠ ∅ → U ≠ ∅
35 9 10 11 3syl ⊢ M ⊆ R ℕ 0 ∧ f ∈ M → dom ⁡ f = ℕ 0
36 35 ex ⊢ M ⊆ R ℕ 0 → f ∈ M → dom ⁡ f = ℕ 0
37 36 3ad2ant1 ⊢ M ⊆ R ℕ 0 ∧ M ∈ Fin ∧ Z ∈ V → f ∈ M → dom ⁡ f = ℕ 0
38 37 adantr ⊢ M ⊆ R ℕ 0 ∧ M ∈ Fin ∧ Z ∈ V ∧ ∀ f ∈ M finSupp Z⁡ f ∧ U ≠ ∅ → f ∈ M → dom ⁡ f = ℕ 0
39 38 imp ⊢ M ⊆ R ℕ 0 ∧ M ∈ Fin ∧ Z ∈ V ∧ ∀ f ∈ M finSupp Z⁡ f ∧ U ≠ ∅ ∧ f ∈ M → dom ⁡ f = ℕ 0
40 nn0ssre ⊢ ℕ 0 ⊆ ℝ
41 39 40 eqsstrdi ⊢ M ⊆ R ℕ 0 ∧ M ∈ Fin ∧ Z ∈ V ∧ ∀ f ∈ M finSupp Z⁡ f ∧ U ≠ ∅ ∧ f ∈ M → dom ⁡ f ⊆ ℝ
42 8 41 sstrid ⊢ M ⊆ R ℕ 0 ∧ M ∈ Fin ∧ Z ∈ V ∧ ∀ f ∈ M finSupp Z⁡ f ∧ U ≠ ∅ ∧ f ∈ M → f supp Z ⊆ ℝ
43 42 ex ⊢ M ⊆ R ℕ 0 ∧ M ∈ Fin ∧ Z ∈ V ∧ ∀ f ∈ M finSupp Z⁡ f ∧ U ≠ ∅ → f ∈ M → f supp Z ⊆ ℝ
44 7 43 ralrimi ⊢ M ⊆ R ℕ 0 ∧ M ∈ Fin ∧ Z ∈ V ∧ ∀ f ∈ M finSupp Z⁡ f ∧ U ≠ ∅ → ∀ f ∈ M f supp Z ⊆ ℝ
45 1 sseq1i ⊢ U ⊆ ℝ ↔ ⋃ f ∈ M supp Z⁡ f ⊆ ℝ
46 iunss ⊢ ⋃ f ∈ M supp Z⁡ f ⊆ ℝ ↔ ∀ f ∈ M f supp Z ⊆ ℝ
47 45 46 bitri ⊢ U ⊆ ℝ ↔ ∀ f ∈ M f supp Z ⊆ ℝ
48 44 47 sylibr ⊢ M ⊆ R ℕ 0 ∧ M ∈ Fin ∧ Z ∈ V ∧ ∀ f ∈ M finSupp Z⁡ f ∧ U ≠ ∅ → U ⊆ ℝ
49 fisupcl ⊢ < Or ℝ ∧ U ∈ Fin ∧ U ≠ ∅ ∧ U ⊆ ℝ → sup U ℝ < ∈ U
50 2 49 eqeltrid ⊢ < Or ℝ ∧ U ∈ Fin ∧ U ≠ ∅ ∧ U ⊆ ℝ → S ∈ U
51 25 33 34 48 50 syl13anc ⊢ M ⊆ R ℕ 0 ∧ M ∈ Fin ∧ Z ∈ V ∧ ∀ f ∈ M finSupp Z⁡ f ∧ U ≠ ∅ → S ∈ U
52 23 51 sseldd ⊢ M ⊆ R ℕ 0 ∧ M ∈ Fin ∧ Z ∈ V ∧ ∀ f ∈ M finSupp Z⁡ f ∧ U ≠ ∅ → S ∈ ℕ 0
53 52 ex ⊢ M ⊆ R ℕ 0 ∧ M ∈ Fin ∧ Z ∈ V → ∀ f ∈ M finSupp Z⁡ f ∧ U ≠ ∅ → S ∈ ℕ 0