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

Theorem mptelee 25775
Description: A condition for a mapping to be an element of a Euclidean space. (Contributed by Scott Fenton, 7-Jun-2013.)
Assertion
Ref Expression
mptelee (𝑁 ∈ ℕ → ((𝑘 ∈ (1...𝑁) ↦ (𝐴𝐹𝐵)) ∈ (𝔼‘𝑁) ↔ ∀𝑘 ∈ (1...𝑁)(𝐴𝐹𝐵) ∈ ℝ))
Distinct variable group:   𝑘,𝑁
Allowed substitution hints:   𝐴(𝑘)   𝐵(𝑘)   𝐹(𝑘)

Proof of Theorem mptelee
Dummy variable 𝑎 is distinct from all other variables.
StepHypRef Expression
1 elee 25774 . 2 (𝑁 ∈ ℕ → ((𝑘 ∈ (1...𝑁) ↦ (𝐴𝐹𝐵)) ∈ (𝔼‘𝑁) ↔ (𝑘 ∈ (1...𝑁) ↦ (𝐴𝐹𝐵)):(1...𝑁)⟶ℝ))
2 ovex 6678 . . . . 5 (𝐴𝐹𝐵) ∈ V
3 eqid 2622 . . . . 5 (𝑘 ∈ (1...𝑁) ↦ (𝐴𝐹𝐵)) = (𝑘 ∈ (1...𝑁) ↦ (𝐴𝐹𝐵))
42, 3fnmpti 6022 . . . 4 (𝑘 ∈ (1...𝑁) ↦ (𝐴𝐹𝐵)) Fn (1...𝑁)
5 df-f 5892 . . . 4 ((𝑘 ∈ (1...𝑁) ↦ (𝐴𝐹𝐵)):(1...𝑁)⟶ℝ ↔ ((𝑘 ∈ (1...𝑁) ↦ (𝐴𝐹𝐵)) Fn (1...𝑁) ∧ ran (𝑘 ∈ (1...𝑁) ↦ (𝐴𝐹𝐵)) ⊆ ℝ))
64, 5mpbiran 953 . . 3 ((𝑘 ∈ (1...𝑁) ↦ (𝐴𝐹𝐵)):(1...𝑁)⟶ℝ ↔ ran (𝑘 ∈ (1...𝑁) ↦ (𝐴𝐹𝐵)) ⊆ ℝ)
73rnmpt 5371 . . . . 5 ran (𝑘 ∈ (1...𝑁) ↦ (𝐴𝐹𝐵)) = {𝑎 ∣ ∃𝑘 ∈ (1...𝑁)𝑎 = (𝐴𝐹𝐵)}
87sseq1i 3629 . . . 4 (ran (𝑘 ∈ (1...𝑁) ↦ (𝐴𝐹𝐵)) ⊆ ℝ ↔ {𝑎 ∣ ∃𝑘 ∈ (1...𝑁)𝑎 = (𝐴𝐹𝐵)} ⊆ ℝ)
9 abss 3671 . . . . 5 ({𝑎 ∣ ∃𝑘 ∈ (1...𝑁)𝑎 = (𝐴𝐹𝐵)} ⊆ ℝ ↔ ∀𝑎(∃𝑘 ∈ (1...𝑁)𝑎 = (𝐴𝐹𝐵) → 𝑎 ∈ ℝ))
10 nfre1 3005 . . . . . . . . 9 𝑘𝑘 ∈ (1...𝑁)𝑎 = (𝐴𝐹𝐵)
11 nfv 1843 . . . . . . . . 9 𝑘 𝑎 ∈ ℝ
1210, 11nfim 1825 . . . . . . . 8 𝑘(∃𝑘 ∈ (1...𝑁)𝑎 = (𝐴𝐹𝐵) → 𝑎 ∈ ℝ)
1312nfal 2153 . . . . . . 7 𝑘𝑎(∃𝑘 ∈ (1...𝑁)𝑎 = (𝐴𝐹𝐵) → 𝑎 ∈ ℝ)
14 r19.23v 3023 . . . . . . . . 9 (∀𝑘 ∈ (1...𝑁)(𝑎 = (𝐴𝐹𝐵) → 𝑎 ∈ ℝ) ↔ (∃𝑘 ∈ (1...𝑁)𝑎 = (𝐴𝐹𝐵) → 𝑎 ∈ ℝ))
1514albii 1747 . . . . . . . 8 (∀𝑎𝑘 ∈ (1...𝑁)(𝑎 = (𝐴𝐹𝐵) → 𝑎 ∈ ℝ) ↔ ∀𝑎(∃𝑘 ∈ (1...𝑁)𝑎 = (𝐴𝐹𝐵) → 𝑎 ∈ ℝ))
16 ralcom4 3224 . . . . . . . . 9 (∀𝑘 ∈ (1...𝑁)∀𝑎(𝑎 = (𝐴𝐹𝐵) → 𝑎 ∈ ℝ) ↔ ∀𝑎𝑘 ∈ (1...𝑁)(𝑎 = (𝐴𝐹𝐵) → 𝑎 ∈ ℝ))
17 rsp 2929 . . . . . . . . . 10 (∀𝑘 ∈ (1...𝑁)∀𝑎(𝑎 = (𝐴𝐹𝐵) → 𝑎 ∈ ℝ) → (𝑘 ∈ (1...𝑁) → ∀𝑎(𝑎 = (𝐴𝐹𝐵) → 𝑎 ∈ ℝ)))
182clel2 3339 . . . . . . . . . 10 ((𝐴𝐹𝐵) ∈ ℝ ↔ ∀𝑎(𝑎 = (𝐴𝐹𝐵) → 𝑎 ∈ ℝ))
1917, 18syl6ibr 242 . . . . . . . . 9 (∀𝑘 ∈ (1...𝑁)∀𝑎(𝑎 = (𝐴𝐹𝐵) → 𝑎 ∈ ℝ) → (𝑘 ∈ (1...𝑁) → (𝐴𝐹𝐵) ∈ ℝ))
2016, 19sylbir 225 . . . . . . . 8 (∀𝑎𝑘 ∈ (1...𝑁)(𝑎 = (𝐴𝐹𝐵) → 𝑎 ∈ ℝ) → (𝑘 ∈ (1...𝑁) → (𝐴𝐹𝐵) ∈ ℝ))
2115, 20sylbir 225 . . . . . . 7 (∀𝑎(∃𝑘 ∈ (1...𝑁)𝑎 = (𝐴𝐹𝐵) → 𝑎 ∈ ℝ) → (𝑘 ∈ (1...𝑁) → (𝐴𝐹𝐵) ∈ ℝ))
2213, 21ralrimi 2957 . . . . . 6 (∀𝑎(∃𝑘 ∈ (1...𝑁)𝑎 = (𝐴𝐹𝐵) → 𝑎 ∈ ℝ) → ∀𝑘 ∈ (1...𝑁)(𝐴𝐹𝐵) ∈ ℝ)
23 nfra1 2941 . . . . . . . 8 𝑘𝑘 ∈ (1...𝑁)(𝐴𝐹𝐵) ∈ ℝ
24 rsp 2929 . . . . . . . . 9 (∀𝑘 ∈ (1...𝑁)(𝐴𝐹𝐵) ∈ ℝ → (𝑘 ∈ (1...𝑁) → (𝐴𝐹𝐵) ∈ ℝ))
25 eleq1a 2696 . . . . . . . . 9 ((𝐴𝐹𝐵) ∈ ℝ → (𝑎 = (𝐴𝐹𝐵) → 𝑎 ∈ ℝ))
2624, 25syl6 35 . . . . . . . 8 (∀𝑘 ∈ (1...𝑁)(𝐴𝐹𝐵) ∈ ℝ → (𝑘 ∈ (1...𝑁) → (𝑎 = (𝐴𝐹𝐵) → 𝑎 ∈ ℝ)))
2723, 11, 26rexlimd 3026 . . . . . . 7 (∀𝑘 ∈ (1...𝑁)(𝐴𝐹𝐵) ∈ ℝ → (∃𝑘 ∈ (1...𝑁)𝑎 = (𝐴𝐹𝐵) → 𝑎 ∈ ℝ))
2827alrimiv 1855 . . . . . 6 (∀𝑘 ∈ (1...𝑁)(𝐴𝐹𝐵) ∈ ℝ → ∀𝑎(∃𝑘 ∈ (1...𝑁)𝑎 = (𝐴𝐹𝐵) → 𝑎 ∈ ℝ))
2922, 28impbii 199 . . . . 5 (∀𝑎(∃𝑘 ∈ (1...𝑁)𝑎 = (𝐴𝐹𝐵) → 𝑎 ∈ ℝ) ↔ ∀𝑘 ∈ (1...𝑁)(𝐴𝐹𝐵) ∈ ℝ)
309, 29bitri 264 . . . 4 ({𝑎 ∣ ∃𝑘 ∈ (1...𝑁)𝑎 = (𝐴𝐹𝐵)} ⊆ ℝ ↔ ∀𝑘 ∈ (1...𝑁)(𝐴𝐹𝐵) ∈ ℝ)
318, 30bitri 264 . . 3 (ran (𝑘 ∈ (1...𝑁) ↦ (𝐴𝐹𝐵)) ⊆ ℝ ↔ ∀𝑘 ∈ (1...𝑁)(𝐴𝐹𝐵) ∈ ℝ)
326, 31bitri 264 . 2 ((𝑘 ∈ (1...𝑁) ↦ (𝐴𝐹𝐵)):(1...𝑁)⟶ℝ ↔ ∀𝑘 ∈ (1...𝑁)(𝐴𝐹𝐵) ∈ ℝ)
331, 32syl6bb 276 1 (𝑁 ∈ ℕ → ((𝑘 ∈ (1...𝑁) ↦ (𝐴𝐹𝐵)) ∈ (𝔼‘𝑁) ↔ ∀𝑘 ∈ (1...𝑁)(𝐴𝐹𝐵) ∈ ℝ))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wal 1481   = wceq 1483  wcel 1990  {cab 2608  wral 2912  wrex 2913  wss 3574  cmpt 4729  ran crn 5115   Fn wfn 5883  wf 5884  cfv 5888  (class class class)co 6650  cr 9935  1c1 9937  cn 11020  ...cfz 12326  𝔼cee 25768
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949  ax-cnex 9992  ax-resscn 9993
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-sbc 3436  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-fv 5896  df-ov 6653  df-oprab 6654  df-mpt2 6655  df-map 7859  df-ee 25771
This theorem is referenced by:  eleesub  25791  eleesubd  25792  axsegconlem1  25797  axsegconlem8  25804  axpasch  25821  axeuclidlem  25842  axcontlem2  25845
  Copyright terms: Public domain W3C validator