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

Theorem mptelee 28829
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 28828 . 2 (𝑁 ∈ ℕ → ((𝑘 ∈ (1...𝑁) ↦ (𝐴𝐹𝐵)) ∈ (𝔼‘𝑁) ↔ (𝑘 ∈ (1...𝑁) ↦ (𝐴𝐹𝐵)):(1...𝑁)⟶ℝ))
2 ovex 7457 . . . . 5 (𝐴𝐹𝐵) ∈ V
3 eqid 2726 . . . . 5 (𝑘 ∈ (1...𝑁) ↦ (𝐴𝐹𝐵)) = (𝑘 ∈ (1...𝑁) ↦ (𝐴𝐹𝐵))
42, 3fnmpti 6704 . . . 4 (𝑘 ∈ (1...𝑁) ↦ (𝐴𝐹𝐵)) Fn (1...𝑁)
5 df-f 6558 . . . 4 ((𝑘 ∈ (1...𝑁) ↦ (𝐴𝐹𝐵)):(1...𝑁)⟶ℝ ↔ ((𝑘 ∈ (1...𝑁) ↦ (𝐴𝐹𝐵)) Fn (1...𝑁) ∧ ran (𝑘 ∈ (1...𝑁) ↦ (𝐴𝐹𝐵)) ⊆ ℝ))
64, 5mpbiran 707 . . 3 ((𝑘 ∈ (1...𝑁) ↦ (𝐴𝐹𝐵)):(1...𝑁)⟶ℝ ↔ ran (𝑘 ∈ (1...𝑁) ↦ (𝐴𝐹𝐵)) ⊆ ℝ)
73rnmpt 5961 . . . . 5 ran (𝑘 ∈ (1...𝑁) ↦ (𝐴𝐹𝐵)) = {𝑎 ∣ ∃𝑘 ∈ (1...𝑁)𝑎 = (𝐴𝐹𝐵)}
87sseq1i 4008 . . . 4 (ran (𝑘 ∈ (1...𝑁) ↦ (𝐴𝐹𝐵)) ⊆ ℝ ↔ {𝑎 ∣ ∃𝑘 ∈ (1...𝑁)𝑎 = (𝐴𝐹𝐵)} ⊆ ℝ)
9 abss 4057 . . . . 5 ({𝑎 ∣ ∃𝑘 ∈ (1...𝑁)𝑎 = (𝐴𝐹𝐵)} ⊆ ℝ ↔ ∀𝑎(∃𝑘 ∈ (1...𝑁)𝑎 = (𝐴𝐹𝐵) → 𝑎 ∈ ℝ))
10 nfre1 3273 . . . . . . . . 9 𝑘𝑘 ∈ (1...𝑁)𝑎 = (𝐴𝐹𝐵)
11 nfv 1910 . . . . . . . . 9 𝑘 𝑎 ∈ ℝ
1210, 11nfim 1892 . . . . . . . 8 𝑘(∃𝑘 ∈ (1...𝑁)𝑎 = (𝐴𝐹𝐵) → 𝑎 ∈ ℝ)
1312nfal 2312 . . . . . . 7 𝑘𝑎(∃𝑘 ∈ (1...𝑁)𝑎 = (𝐴𝐹𝐵) → 𝑎 ∈ ℝ)
14 r19.23v 3173 . . . . . . . . 9 (∀𝑘 ∈ (1...𝑁)(𝑎 = (𝐴𝐹𝐵) → 𝑎 ∈ ℝ) ↔ (∃𝑘 ∈ (1...𝑁)𝑎 = (𝐴𝐹𝐵) → 𝑎 ∈ ℝ))
1514albii 1814 . . . . . . . 8 (∀𝑎𝑘 ∈ (1...𝑁)(𝑎 = (𝐴𝐹𝐵) → 𝑎 ∈ ℝ) ↔ ∀𝑎(∃𝑘 ∈ (1...𝑁)𝑎 = (𝐴𝐹𝐵) → 𝑎 ∈ ℝ))
16 ralcom4 3274 . . . . . . . . 9 (∀𝑘 ∈ (1...𝑁)∀𝑎(𝑎 = (𝐴𝐹𝐵) → 𝑎 ∈ ℝ) ↔ ∀𝑎𝑘 ∈ (1...𝑁)(𝑎 = (𝐴𝐹𝐵) → 𝑎 ∈ ℝ))
17 rsp 3235 . . . . . . . . . 10 (∀𝑘 ∈ (1...𝑁)∀𝑎(𝑎 = (𝐴𝐹𝐵) → 𝑎 ∈ ℝ) → (𝑘 ∈ (1...𝑁) → ∀𝑎(𝑎 = (𝐴𝐹𝐵) → 𝑎 ∈ ℝ)))
182clel2 3646 . . . . . . . . . 10 ((𝐴𝐹𝐵) ∈ ℝ ↔ ∀𝑎(𝑎 = (𝐴𝐹𝐵) → 𝑎 ∈ ℝ))
1917, 18imbitrrdi 251 . . . . . . . . 9 (∀𝑘 ∈ (1...𝑁)∀𝑎(𝑎 = (𝐴𝐹𝐵) → 𝑎 ∈ ℝ) → (𝑘 ∈ (1...𝑁) → (𝐴𝐹𝐵) ∈ ℝ))
2016, 19sylbir 234 . . . . . . . 8 (∀𝑎𝑘 ∈ (1...𝑁)(𝑎 = (𝐴𝐹𝐵) → 𝑎 ∈ ℝ) → (𝑘 ∈ (1...𝑁) → (𝐴𝐹𝐵) ∈ ℝ))
2115, 20sylbir 234 . . . . . . 7 (∀𝑎(∃𝑘 ∈ (1...𝑁)𝑎 = (𝐴𝐹𝐵) → 𝑎 ∈ ℝ) → (𝑘 ∈ (1...𝑁) → (𝐴𝐹𝐵) ∈ ℝ))
2213, 21ralrimi 3245 . . . . . 6 (∀𝑎(∃𝑘 ∈ (1...𝑁)𝑎 = (𝐴𝐹𝐵) → 𝑎 ∈ ℝ) → ∀𝑘 ∈ (1...𝑁)(𝐴𝐹𝐵) ∈ ℝ)
23 nfra1 3272 . . . . . . . 8 𝑘𝑘 ∈ (1...𝑁)(𝐴𝐹𝐵) ∈ ℝ
24 rsp 3235 . . . . . . . . 9 (∀𝑘 ∈ (1...𝑁)(𝐴𝐹𝐵) ∈ ℝ → (𝑘 ∈ (1...𝑁) → (𝐴𝐹𝐵) ∈ ℝ))
25 eleq1a 2821 . . . . . . . . 9 ((𝐴𝐹𝐵) ∈ ℝ → (𝑎 = (𝐴𝐹𝐵) → 𝑎 ∈ ℝ))
2624, 25syl6 35 . . . . . . . 8 (∀𝑘 ∈ (1...𝑁)(𝐴𝐹𝐵) ∈ ℝ → (𝑘 ∈ (1...𝑁) → (𝑎 = (𝐴𝐹𝐵) → 𝑎 ∈ ℝ)))
2723, 11, 26rexlimd 3254 . . . . . . 7 (∀𝑘 ∈ (1...𝑁)(𝐴𝐹𝐵) ∈ ℝ → (∃𝑘 ∈ (1...𝑁)𝑎 = (𝐴𝐹𝐵) → 𝑎 ∈ ℝ))
2827alrimiv 1923 . . . . . 6 (∀𝑘 ∈ (1...𝑁)(𝐴𝐹𝐵) ∈ ℝ → ∀𝑎(∃𝑘 ∈ (1...𝑁)𝑎 = (𝐴𝐹𝐵) → 𝑎 ∈ ℝ))
2922, 28impbii 208 . . . . 5 (∀𝑎(∃𝑘 ∈ (1...𝑁)𝑎 = (𝐴𝐹𝐵) → 𝑎 ∈ ℝ) ↔ ∀𝑘 ∈ (1...𝑁)(𝐴𝐹𝐵) ∈ ℝ)
309, 29bitri 274 . . . 4 ({𝑎 ∣ ∃𝑘 ∈ (1...𝑁)𝑎 = (𝐴𝐹𝐵)} ⊆ ℝ ↔ ∀𝑘 ∈ (1...𝑁)(𝐴𝐹𝐵) ∈ ℝ)
318, 30bitri 274 . . 3 (ran (𝑘 ∈ (1...𝑁) ↦ (𝐴𝐹𝐵)) ⊆ ℝ ↔ ∀𝑘 ∈ (1...𝑁)(𝐴𝐹𝐵) ∈ ℝ)
326, 31bitri 274 . 2 ((𝑘 ∈ (1...𝑁) ↦ (𝐴𝐹𝐵)):(1...𝑁)⟶ℝ ↔ ∀𝑘 ∈ (1...𝑁)(𝐴𝐹𝐵) ∈ ℝ)
331, 32bitrdi 286 1 (𝑁 ∈ ℕ → ((𝑘 ∈ (1...𝑁) ↦ (𝐴𝐹𝐵)) ∈ (𝔼‘𝑁) ↔ ∀𝑘 ∈ (1...𝑁)(𝐴𝐹𝐵) ∈ ℝ))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wal 1532   = wceq 1534  wcel 2099  {cab 2703  wral 3051  wrex 3060  wss 3947  cmpt 5236  ran crn 5683   Fn wfn 6549  wf 6550  cfv 6554  (class class class)co 7424  cr 11157  1c1 11159  cn 12264  ...cfz 13538  𝔼cee 28822
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2101  ax-9 2109  ax-10 2130  ax-11 2147  ax-12 2167  ax-ext 2697  ax-sep 5304  ax-nul 5311  ax-pow 5369  ax-pr 5433  ax-un 7746  ax-cnex 11214  ax-resscn 11215
This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3an 1086  df-tru 1537  df-fal 1547  df-ex 1775  df-nf 1779  df-sb 2061  df-mo 2529  df-eu 2558  df-clab 2704  df-cleq 2718  df-clel 2803  df-nfc 2878  df-ne 2931  df-ral 3052  df-rex 3061  df-rab 3420  df-v 3464  df-sbc 3777  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-nul 4326  df-if 4534  df-pw 4609  df-sn 4634  df-pr 4636  df-op 4640  df-uni 4914  df-br 5154  df-opab 5216  df-mpt 5237  df-id 5580  df-xp 5688  df-rel 5689  df-cnv 5690  df-co 5691  df-dm 5692  df-rn 5693  df-iota 6506  df-fun 6556  df-fn 6557  df-f 6558  df-fv 6562  df-ov 7427  df-oprab 7428  df-mpo 7429  df-map 8857  df-ee 28825
This theorem is referenced by:  eleesub  28845  eleesubd  28846  axsegconlem1  28851  axsegconlem8  28858  axpasch  28875  axeuclidlem  28896  axcontlem2  28899
  Copyright terms: Public domain W3C validator
OSZAR »