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 26693. (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 1128 | . 2 ⊢ ((𝜑 ∧ 𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁)) → 𝐶 = (𝑖 ∈ (1...𝑁) ↦ ((𝐴‘𝑖) − (𝐵‘𝑖)))) |
3 | fveere 26683 | . . . . . . 7 ⊢ ((𝐴 ∈ (𝔼‘𝑁) ∧ 𝑖 ∈ (1...𝑁)) → (𝐴‘𝑖) ∈ ℝ) | |
4 | fveere 26683 | . . . . . . 7 ⊢ ((𝐵 ∈ (𝔼‘𝑁) ∧ 𝑖 ∈ (1...𝑁)) → (𝐵‘𝑖) ∈ ℝ) | |
5 | resubcl 10943 | . . . . . . 7 ⊢ (((𝐴‘𝑖) ∈ ℝ ∧ (𝐵‘𝑖) ∈ ℝ) → ((𝐴‘𝑖) − (𝐵‘𝑖)) ∈ ℝ) | |
6 | 3, 4, 5 | syl2an 597 | . . . . . 6 ⊢ (((𝐴 ∈ (𝔼‘𝑁) ∧ 𝑖 ∈ (1...𝑁)) ∧ (𝐵 ∈ (𝔼‘𝑁) ∧ 𝑖 ∈ (1...𝑁))) → ((𝐴‘𝑖) − (𝐵‘𝑖)) ∈ ℝ) |
7 | 6 | anandirs 677 | . . . . 5 ⊢ (((𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁)) ∧ 𝑖 ∈ (1...𝑁)) → ((𝐴‘𝑖) − (𝐵‘𝑖)) ∈ ℝ) |
8 | 7 | ralrimiva 3181 | . . . 4 ⊢ ((𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁)) → ∀𝑖 ∈ (1...𝑁)((𝐴‘𝑖) − (𝐵‘𝑖)) ∈ ℝ) |
9 | eleenn 26678 | . . . . . 6 ⊢ (𝐴 ∈ (𝔼‘𝑁) → 𝑁 ∈ ℕ) | |
10 | mptelee 26677 | . . . . . 6 ⊢ (𝑁 ∈ ℕ → ((𝑖 ∈ (1...𝑁) ↦ ((𝐴‘𝑖) − (𝐵‘𝑖))) ∈ (𝔼‘𝑁) ↔ ∀𝑖 ∈ (1...𝑁)((𝐴‘𝑖) − (𝐵‘𝑖)) ∈ ℝ)) | |
11 | 9, 10 | syl 17 | . . . . 5 ⊢ (𝐴 ∈ (𝔼‘𝑁) → ((𝑖 ∈ (1...𝑁) ↦ ((𝐴‘𝑖) − (𝐵‘𝑖))) ∈ (𝔼‘𝑁) ↔ ∀𝑖 ∈ (1...𝑁)((𝐴‘𝑖) − (𝐵‘𝑖)) ∈ ℝ)) |
12 | 11 | adantr 483 | . . . 4 ⊢ ((𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁)) → ((𝑖 ∈ (1...𝑁) ↦ ((𝐴‘𝑖) − (𝐵‘𝑖))) ∈ (𝔼‘𝑁) ↔ ∀𝑖 ∈ (1...𝑁)((𝐴‘𝑖) − (𝐵‘𝑖)) ∈ ℝ)) |
13 | 8, 12 | mpbird 259 | . . 3 ⊢ ((𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁)) → (𝑖 ∈ (1...𝑁) ↦ ((𝐴‘𝑖) − (𝐵‘𝑖))) ∈ (𝔼‘𝑁)) |
14 | 13 | 3adant1 1125 | . 2 ⊢ ((𝜑 ∧ 𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁)) → (𝑖 ∈ (1...𝑁) ↦ ((𝐴‘𝑖) − (𝐵‘𝑖))) ∈ (𝔼‘𝑁)) |
15 | 2, 14 | eqeltrd 2912 | 1 ⊢ ((𝜑 ∧ 𝐴 ∈ (𝔼‘𝑁) ∧ 𝐵 ∈ (𝔼‘𝑁)) → 𝐶 ∈ (𝔼‘𝑁)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 ∧ w3a 1082 = wceq 1536 ∈ wcel 2113 ∀wral 3137 ↦ cmpt 5139 ‘cfv 6348 (class class class)co 7149 ℝcr 10529 1c1 10531 − cmin 10863 ℕcn 11631 ...cfz 12889 𝔼cee 26670 |
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 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2792 ax-sep 5196 ax-nul 5203 ax-pow 5259 ax-pr 5323 ax-un 7454 ax-cnex 10586 ax-resscn 10587 ax-1cn 10588 ax-icn 10589 ax-addcl 10590 ax-addrcl 10591 ax-mulcl 10592 ax-mulrcl 10593 ax-mulcom 10594 ax-addass 10595 ax-mulass 10596 ax-distr 10597 ax-i2m1 10598 ax-1ne0 10599 ax-1rid 10600 ax-rnegex 10601 ax-rrecex 10602 ax-cnre 10603 ax-pre-lttri 10604 ax-pre-lttrn 10605 ax-pre-ltadd 10606 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1083 df-3an 1084 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-mo 2621 df-eu 2653 df-clab 2799 df-cleq 2813 df-clel 2892 df-nfc 2962 df-ne 3016 df-nel 3123 df-ral 3142 df-rex 3143 df-reu 3144 df-rab 3146 df-v 3493 df-sbc 3769 df-csb 3877 df-dif 3932 df-un 3934 df-in 3936 df-ss 3945 df-nul 4285 df-if 4461 df-pw 4534 df-sn 4561 df-pr 4563 df-op 4567 df-uni 4832 df-br 5060 df-opab 5122 df-mpt 5140 df-id 5453 df-po 5467 df-so 5468 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-rn 5559 df-res 5560 df-ima 5561 df-iota 6307 df-fun 6350 df-fn 6351 df-f 6352 df-f1 6353 df-fo 6354 df-f1o 6355 df-fv 6356 df-riota 7107 df-ov 7152 df-oprab 7153 df-mpo 7154 df-er 8282 df-map 8401 df-en 8503 df-dom 8504 df-sdom 8505 df-pnf 10670 df-mnf 10671 df-ltxr 10673 df-sub 10865 df-neg 10866 df-ee 26673 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |