| 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 28838. (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 1133 | . 2 ⊢ ((𝜑 ∧ 𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁)) → 𝐶 = (𝑖 ∈ (1...𝑁) ↦ ((𝐴‘𝑖) − (𝐵‘𝑖)))) |
| 3 | fveere 28828 | . . . . . . 7 ⊢ ((𝐴 ∈ (𝔼‘𝑁) ∧ 𝑖 ∈ (1...𝑁)) → (𝐴‘𝑖) ∈ ℝ) | |
| 4 | fveere 28828 | . . . . . . 7 ⊢ ((𝐵 ∈ (𝔼‘𝑁) ∧ 𝑖 ∈ (1...𝑁)) → (𝐵‘𝑖) ∈ ℝ) | |
| 5 | resubcl 11486 | . . . . . . 7 ⊢ (((𝐴‘𝑖) ∈ ℝ ∧ (𝐵‘𝑖) ∈ ℝ) → ((𝐴‘𝑖) − (𝐵‘𝑖)) ∈ ℝ) | |
| 6 | 3, 4, 5 | syl2an 596 | . . . . . 6 ⊢ (((𝐴 ∈ (𝔼‘𝑁) ∧ 𝑖 ∈ (1...𝑁)) ∧ (𝐵 ∈ (𝔼‘𝑁) ∧ 𝑖 ∈ (1...𝑁))) → ((𝐴‘𝑖) − (𝐵‘𝑖)) ∈ ℝ) |
| 7 | 6 | anandirs 679 | . . . . 5 ⊢ (((𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁)) ∧ 𝑖 ∈ (1...𝑁)) → ((𝐴‘𝑖) − (𝐵‘𝑖)) ∈ ℝ) |
| 8 | 7 | ralrimiva 3125 | . . . 4 ⊢ ((𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁)) → ∀𝑖 ∈ (1...𝑁)((𝐴‘𝑖) − (𝐵‘𝑖)) ∈ ℝ) |
| 9 | eleenn 28823 | . . . . . 6 ⊢ (𝐴 ∈ (𝔼‘𝑁) → 𝑁 ∈ ℕ) | |
| 10 | mptelee 28822 | . . . . . 6 ⊢ (𝑁 ∈ ℕ → ((𝑖 ∈ (1...𝑁) ↦ ((𝐴‘𝑖) − (𝐵‘𝑖))) ∈ (𝔼‘𝑁) ↔ ∀𝑖 ∈ (1...𝑁)((𝐴‘𝑖) − (𝐵‘𝑖)) ∈ ℝ)) | |
| 11 | 9, 10 | syl 17 | . . . . 5 ⊢ (𝐴 ∈ (𝔼‘𝑁) → ((𝑖 ∈ (1...𝑁) ↦ ((𝐴‘𝑖) − (𝐵‘𝑖))) ∈ (𝔼‘𝑁) ↔ ∀𝑖 ∈ (1...𝑁)((𝐴‘𝑖) − (𝐵‘𝑖)) ∈ ℝ)) |
| 12 | 11 | adantr 480 | . . . 4 ⊢ ((𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁)) → ((𝑖 ∈ (1...𝑁) ↦ ((𝐴‘𝑖) − (𝐵‘𝑖))) ∈ (𝔼‘𝑁) ↔ ∀𝑖 ∈ (1...𝑁)((𝐴‘𝑖) − (𝐵‘𝑖)) ∈ ℝ)) |
| 13 | 8, 12 | mpbird 257 | . . 3 ⊢ ((𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁)) → (𝑖 ∈ (1...𝑁) ↦ ((𝐴‘𝑖) − (𝐵‘𝑖))) ∈ (𝔼‘𝑁)) |
| 14 | 13 | 3adant1 1130 | . 2 ⊢ ((𝜑 ∧ 𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁)) → (𝑖 ∈ (1...𝑁) ↦ ((𝐴‘𝑖) − (𝐵‘𝑖))) ∈ (𝔼‘𝑁)) |
| 15 | 2, 14 | eqeltrd 2828 | 1 ⊢ ((𝜑 ∧ 𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁)) → 𝐶 ∈ (𝔼‘𝑁)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1540 ∈ wcel 2109 ∀wral 3044 ↦ cmpt 5188 ‘cfv 6511 (class class class)co 7387 ℝcr 11067 1c1 11069 − cmin 11405 ℕcn 12186 ...cfz 13468 𝔼cee 28815 |
| 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 5251 ax-nul 5261 ax-pow 5320 ax-pr 5387 ax-un 7711 ax-cnex 11124 ax-resscn 11125 ax-1cn 11126 ax-icn 11127 ax-addcl 11128 ax-addrcl 11129 ax-mulcl 11130 ax-mulrcl 11131 ax-mulcom 11132 ax-addass 11133 ax-mulass 11134 ax-distr 11135 ax-i2m1 11136 ax-1ne0 11137 ax-1rid 11138 ax-rnegex 11139 ax-rrecex 11140 ax-cnre 11141 ax-pre-lttri 11142 ax-pre-lttrn 11143 ax-pre-ltadd 11144 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 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-nel 3030 df-ral 3045 df-rex 3054 df-reu 3355 df-rab 3406 df-v 3449 df-sbc 3754 df-csb 3863 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-nul 4297 df-if 4489 df-pw 4565 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4872 df-br 5108 df-opab 5170 df-mpt 5189 df-id 5533 df-po 5546 df-so 5547 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-res 5650 df-ima 5651 df-iota 6464 df-fun 6513 df-fn 6514 df-f 6515 df-f1 6516 df-fo 6517 df-f1o 6518 df-fv 6519 df-riota 7344 df-ov 7390 df-oprab 7391 df-mpo 7392 df-er 8671 df-map 8801 df-en 8919 df-dom 8920 df-sdom 8921 df-pnf 11210 df-mnf 11211 df-ltxr 11213 df-sub 11407 df-neg 11408 df-ee 28818 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |