Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > eleesubd | Structured version Visualization version GIF version |
Description: Membership of a subtraction mapping in a Euclidean space. Deduction form of eleesub 25591. (Contributed by Scott Fenton, 17-Jul-2013.) |
Ref | Expression |
---|---|
eleesubd.1 | ⊢ (𝜑 → 𝐶 = (𝑖 ∈ (1...𝑁) ↦ ((𝐴‘𝑖) − (𝐵‘𝑖)))) |
Ref | Expression |
---|---|
eleesubd | ⊢ ((𝜑 ∧ 𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁)) → 𝐶 ∈ (𝔼‘𝑁)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eleesubd.1 | . . 3 ⊢ (𝜑 → 𝐶 = (𝑖 ∈ (1...𝑁) ↦ ((𝐴‘𝑖) − (𝐵‘𝑖)))) | |
2 | 1 | 3ad2ant1 1075 | . 2 ⊢ ((𝜑 ∧ 𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁)) → 𝐶 = (𝑖 ∈ (1...𝑁) ↦ ((𝐴‘𝑖) − (𝐵‘𝑖)))) |
3 | fveere 25581 | . . . . . . 7 ⊢ ((𝐴 ∈ (𝔼‘𝑁) ∧ 𝑖 ∈ (1...𝑁)) → (𝐴‘𝑖) ∈ ℝ) | |
4 | fveere 25581 | . . . . . . 7 ⊢ ((𝐵 ∈ (𝔼‘𝑁) ∧ 𝑖 ∈ (1...𝑁)) → (𝐵‘𝑖) ∈ ℝ) | |
5 | resubcl 10224 | . . . . . . 7 ⊢ (((𝐴‘𝑖) ∈ ℝ ∧ (𝐵‘𝑖) ∈ ℝ) → ((𝐴‘𝑖) − (𝐵‘𝑖)) ∈ ℝ) | |
6 | 3, 4, 5 | syl2an 493 | . . . . . 6 ⊢ (((𝐴 ∈ (𝔼‘𝑁) ∧ 𝑖 ∈ (1...𝑁)) ∧ (𝐵 ∈ (𝔼‘𝑁) ∧ 𝑖 ∈ (1...𝑁))) → ((𝐴‘𝑖) − (𝐵‘𝑖)) ∈ ℝ) |
7 | 6 | anandirs 870 | . . . . 5 ⊢ (((𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁)) ∧ 𝑖 ∈ (1...𝑁)) → ((𝐴‘𝑖) − (𝐵‘𝑖)) ∈ ℝ) |
8 | 7 | ralrimiva 2949 | . . . 4 ⊢ ((𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁)) → ∀𝑖 ∈ (1...𝑁)((𝐴‘𝑖) − (𝐵‘𝑖)) ∈ ℝ) |
9 | eleenn 25576 | . . . . . 6 ⊢ (𝐴 ∈ (𝔼‘𝑁) → 𝑁 ∈ ℕ) | |
10 | mptelee 25575 | . . . . . 6 ⊢ (𝑁 ∈ ℕ → ((𝑖 ∈ (1...𝑁) ↦ ((𝐴‘𝑖) − (𝐵‘𝑖))) ∈ (𝔼‘𝑁) ↔ ∀𝑖 ∈ (1...𝑁)((𝐴‘𝑖) − (𝐵‘𝑖)) ∈ ℝ)) | |
11 | 9, 10 | syl 17 | . . . . 5 ⊢ (𝐴 ∈ (𝔼‘𝑁) → ((𝑖 ∈ (1...𝑁) ↦ ((𝐴‘𝑖) − (𝐵‘𝑖))) ∈ (𝔼‘𝑁) ↔ ∀𝑖 ∈ (1...𝑁)((𝐴‘𝑖) − (𝐵‘𝑖)) ∈ ℝ)) |
12 | 11 | adantr 480 | . . . 4 ⊢ ((𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁)) → ((𝑖 ∈ (1...𝑁) ↦ ((𝐴‘𝑖) − (𝐵‘𝑖))) ∈ (𝔼‘𝑁) ↔ ∀𝑖 ∈ (1...𝑁)((𝐴‘𝑖) − (𝐵‘𝑖)) ∈ ℝ)) |
13 | 8, 12 | mpbird 246 | . . 3 ⊢ ((𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁)) → (𝑖 ∈ (1...𝑁) ↦ ((𝐴‘𝑖) − (𝐵‘𝑖))) ∈ (𝔼‘𝑁)) |
14 | 13 | 3adant1 1072 | . 2 ⊢ ((𝜑 ∧ 𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁)) → (𝑖 ∈ (1...𝑁) ↦ ((𝐴‘𝑖) − (𝐵‘𝑖))) ∈ (𝔼‘𝑁)) |
15 | 2, 14 | eqeltrd 2688 | 1 ⊢ ((𝜑 ∧ 𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁)) → 𝐶 ∈ (𝔼‘𝑁)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 195 ∧ wa 383 ∧ w3a 1031 = wceq 1475 ∈ wcel 1977 ∀wral 2896 ↦ cmpt 4643 ‘cfv 5804 (class class class)co 6549 ℝcr 9814 1c1 9816 − cmin 10145 ℕcn 10897 ...cfz 12197 𝔼cee 25568 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 ax-cnex 9871 ax-resscn 9872 ax-1cn 9873 ax-icn 9874 ax-addcl 9875 ax-addrcl 9876 ax-mulcl 9877 ax-mulrcl 9878 ax-mulcom 9879 ax-addass 9880 ax-mulass 9881 ax-distr 9882 ax-i2m1 9883 ax-1ne0 9884 ax-1rid 9885 ax-rnegex 9886 ax-rrecex 9887 ax-cnre 9888 ax-pre-lttri 9889 ax-pre-lttrn 9890 ax-pre-ltadd 9891 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-nel 2783 df-ral 2901 df-rex 2902 df-reu 2903 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-op 4132 df-uni 4373 df-br 4584 df-opab 4644 df-mpt 4645 df-id 4953 df-po 4959 df-so 4960 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-riota 6511 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-er 7629 df-map 7746 df-en 7842 df-dom 7843 df-sdom 7844 df-pnf 9955 df-mnf 9956 df-ltxr 9958 df-sub 10147 df-neg 10148 df-ee 25571 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |