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

Theorem mptelee 28858
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 28857 . 2 (𝑁 ∈ ℕ → ((𝑘 ∈ (1...𝑁) ↦ (𝐴𝐹𝐵)) ∈ (𝔼‘𝑁) ↔ (𝑘 ∈ (1...𝑁) ↦ (𝐴𝐹𝐵)):(1...𝑁)⟶ℝ))
2 ovex 7386 . . . . 5 (𝐴𝐹𝐵) ∈ V
3 eqid 2729 . . . . 5 (𝑘 ∈ (1...𝑁) ↦ (𝐴𝐹𝐵)) = (𝑘 ∈ (1...𝑁) ↦ (𝐴𝐹𝐵))
42, 3fnmpti 6629 . . . 4 (𝑘 ∈ (1...𝑁) ↦ (𝐴𝐹𝐵)) Fn (1...𝑁)
5 df-f 6490 . . . 4 ((𝑘 ∈ (1...𝑁) ↦ (𝐴𝐹𝐵)):(1...𝑁)⟶ℝ ↔ ((𝑘 ∈ (1...𝑁) ↦ (𝐴𝐹𝐵)) Fn (1...𝑁) ∧ ran (𝑘 ∈ (1...𝑁) ↦ (𝐴𝐹𝐵)) ⊆ ℝ))
64, 5mpbiran 709 . . 3 ((𝑘 ∈ (1...𝑁) ↦ (𝐴𝐹𝐵)):(1...𝑁)⟶ℝ ↔ ran (𝑘 ∈ (1...𝑁) ↦ (𝐴𝐹𝐵)) ⊆ ℝ)
73rnmpt 5903 . . . . 5 ran (𝑘 ∈ (1...𝑁) ↦ (𝐴𝐹𝐵)) = {𝑎 ∣ ∃𝑘 ∈ (1...𝑁)𝑎 = (𝐴𝐹𝐵)}
87sseq1i 3966 . . . 4 (ran (𝑘 ∈ (1...𝑁) ↦ (𝐴𝐹𝐵)) ⊆ ℝ ↔ {𝑎 ∣ ∃𝑘 ∈ (1...𝑁)𝑎 = (𝐴𝐹𝐵)} ⊆ ℝ)
9 abss 4017 . . . . 5 ({𝑎 ∣ ∃𝑘 ∈ (1...𝑁)𝑎 = (𝐴𝐹𝐵)} ⊆ ℝ ↔ ∀𝑎(∃𝑘 ∈ (1...𝑁)𝑎 = (𝐴𝐹𝐵) → 𝑎 ∈ ℝ))
10 nfre1 3254 . . . . . . . . 9 𝑘𝑘 ∈ (1...𝑁)𝑎 = (𝐴𝐹𝐵)
11 nfv 1914 . . . . . . . . 9 𝑘 𝑎 ∈ ℝ
1210, 11nfim 1896 . . . . . . . 8 𝑘(∃𝑘 ∈ (1...𝑁)𝑎 = (𝐴𝐹𝐵) → 𝑎 ∈ ℝ)
1312nfal 2322 . . . . . . 7 𝑘𝑎(∃𝑘 ∈ (1...𝑁)𝑎 = (𝐴𝐹𝐵) → 𝑎 ∈ ℝ)
14 r19.23v 3156 . . . . . . . . 9 (∀𝑘 ∈ (1...𝑁)(𝑎 = (𝐴𝐹𝐵) → 𝑎 ∈ ℝ) ↔ (∃𝑘 ∈ (1...𝑁)𝑎 = (𝐴𝐹𝐵) → 𝑎 ∈ ℝ))
1514albii 1819 . . . . . . . 8 (∀𝑎𝑘 ∈ (1...𝑁)(𝑎 = (𝐴𝐹𝐵) → 𝑎 ∈ ℝ) ↔ ∀𝑎(∃𝑘 ∈ (1...𝑁)𝑎 = (𝐴𝐹𝐵) → 𝑎 ∈ ℝ))
16 ralcom4 3255 . . . . . . . . 9 (∀𝑘 ∈ (1...𝑁)∀𝑎(𝑎 = (𝐴𝐹𝐵) → 𝑎 ∈ ℝ) ↔ ∀𝑎𝑘 ∈ (1...𝑁)(𝑎 = (𝐴𝐹𝐵) → 𝑎 ∈ ℝ))
17 rsp 3217 . . . . . . . . . 10 (∀𝑘 ∈ (1...𝑁)∀𝑎(𝑎 = (𝐴𝐹𝐵) → 𝑎 ∈ ℝ) → (𝑘 ∈ (1...𝑁) → ∀𝑎(𝑎 = (𝐴𝐹𝐵) → 𝑎 ∈ ℝ)))
182clel2 3617 . . . . . . . . . 10 ((𝐴𝐹𝐵) ∈ ℝ ↔ ∀𝑎(𝑎 = (𝐴𝐹𝐵) → 𝑎 ∈ ℝ))
1917, 18imbitrrdi 252 . . . . . . . . 9 (∀𝑘 ∈ (1...𝑁)∀𝑎(𝑎 = (𝐴𝐹𝐵) → 𝑎 ∈ ℝ) → (𝑘 ∈ (1...𝑁) → (𝐴𝐹𝐵) ∈ ℝ))
2016, 19sylbir 235 . . . . . . . 8 (∀𝑎𝑘 ∈ (1...𝑁)(𝑎 = (𝐴𝐹𝐵) → 𝑎 ∈ ℝ) → (𝑘 ∈ (1...𝑁) → (𝐴𝐹𝐵) ∈ ℝ))
2115, 20sylbir 235 . . . . . . 7 (∀𝑎(∃𝑘 ∈ (1...𝑁)𝑎 = (𝐴𝐹𝐵) → 𝑎 ∈ ℝ) → (𝑘 ∈ (1...𝑁) → (𝐴𝐹𝐵) ∈ ℝ))
2213, 21ralrimi 3227 . . . . . 6 (∀𝑎(∃𝑘 ∈ (1...𝑁)𝑎 = (𝐴𝐹𝐵) → 𝑎 ∈ ℝ) → ∀𝑘 ∈ (1...𝑁)(𝐴𝐹𝐵) ∈ ℝ)
23 nfra1 3253 . . . . . . . 8 𝑘𝑘 ∈ (1...𝑁)(𝐴𝐹𝐵) ∈ ℝ
24 rsp 3217 . . . . . . . . 9 (∀𝑘 ∈ (1...𝑁)(𝐴𝐹𝐵) ∈ ℝ → (𝑘 ∈ (1...𝑁) → (𝐴𝐹𝐵) ∈ ℝ))
25 eleq1a 2823 . . . . . . . . 9 ((𝐴𝐹𝐵) ∈ ℝ → (𝑎 = (𝐴𝐹𝐵) → 𝑎 ∈ ℝ))
2624, 25syl6 35 . . . . . . . 8 (∀𝑘 ∈ (1...𝑁)(𝐴𝐹𝐵) ∈ ℝ → (𝑘 ∈ (1...𝑁) → (𝑎 = (𝐴𝐹𝐵) → 𝑎 ∈ ℝ)))
2723, 11, 26rexlimd 3236 . . . . . . 7 (∀𝑘 ∈ (1...𝑁)(𝐴𝐹𝐵) ∈ ℝ → (∃𝑘 ∈ (1...𝑁)𝑎 = (𝐴𝐹𝐵) → 𝑎 ∈ ℝ))
2827alrimiv 1927 . . . . . 6 (∀𝑘 ∈ (1...𝑁)(𝐴𝐹𝐵) ∈ ℝ → ∀𝑎(∃𝑘 ∈ (1...𝑁)𝑎 = (𝐴𝐹𝐵) → 𝑎 ∈ ℝ))
2922, 28impbii 209 . . . . 5 (∀𝑎(∃𝑘 ∈ (1...𝑁)𝑎 = (𝐴𝐹𝐵) → 𝑎 ∈ ℝ) ↔ ∀𝑘 ∈ (1...𝑁)(𝐴𝐹𝐵) ∈ ℝ)
309, 29bitri 275 . . . 4 ({𝑎 ∣ ∃𝑘 ∈ (1...𝑁)𝑎 = (𝐴𝐹𝐵)} ⊆ ℝ ↔ ∀𝑘 ∈ (1...𝑁)(𝐴𝐹𝐵) ∈ ℝ)
318, 30bitri 275 . . 3 (ran (𝑘 ∈ (1...𝑁) ↦ (𝐴𝐹𝐵)) ⊆ ℝ ↔ ∀𝑘 ∈ (1...𝑁)(𝐴𝐹𝐵) ∈ ℝ)
326, 31bitri 275 . 2 ((𝑘 ∈ (1...𝑁) ↦ (𝐴𝐹𝐵)):(1...𝑁)⟶ℝ ↔ ∀𝑘 ∈ (1...𝑁)(𝐴𝐹𝐵) ∈ ℝ)
331, 32bitrdi 287 1 (𝑁 ∈ ℕ → ((𝑘 ∈ (1...𝑁) ↦ (𝐴𝐹𝐵)) ∈ (𝔼‘𝑁) ↔ ∀𝑘 ∈ (1...𝑁)(𝐴𝐹𝐵) ∈ ℝ))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wal 1538   = wceq 1540  wcel 2109  {cab 2707  wral 3044  wrex 3053  wss 3905  cmpt 5176  ran crn 5624   Fn wfn 6481  wf 6482  cfv 6486  (class class class)co 7353  cr 11027  1c1 11029  cn 12146  ...cfz 13428  𝔼cee 28851
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5238  ax-nul 5248  ax-pow 5307  ax-pr 5374  ax-un 7675  ax-cnex 11084  ax-resscn 11085
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rab 3397  df-v 3440  df-sbc 3745  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4479  df-pw 4555  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4862  df-br 5096  df-opab 5158  df-mpt 5177  df-id 5518  df-xp 5629  df-rel 5630  df-cnv 5631  df-co 5632  df-dm 5633  df-rn 5634  df-iota 6442  df-fun 6488  df-fn 6489  df-f 6490  df-fv 6494  df-ov 7356  df-oprab 7357  df-mpo 7358  df-map 8762  df-ee 28854
This theorem is referenced by:  eleesub  28874  eleesubd  28875  axsegconlem1  28880  axsegconlem8  28887  axpasch  28904  axeuclidlem  28925  axcontlem2  28928
  Copyright terms: Public domain W3C validator