| Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > prelrrx2bd | Structured version Visualization version GIF version | ||
| Description: Equivalent condition for 𝑍 being a point in a real Euclidean space of dimension 2, determined by its coordinates. (Contributed by Thierry Arnoux, 10-Oct-2026.) |
| Ref | Expression |
|---|---|
| prelrrx2.i | ⊢ 𝐼 = (0..^2) |
| prelrrx2.b | ⊢ 𝑃 = (ℝ ↑m 𝐼) |
| prelrrx2bd.1 | ⊢ (𝜑 → 𝐴 ∈ ℝ) |
| prelrrx2bd.2 | ⊢ (𝜑 → 𝐵 ∈ ℝ) |
| Ref | Expression |
|---|---|
| prelrrx2bd | ⊢ (𝜑 → (𝑍 = 〈“𝐴𝐵”〉 ↔ (𝑍 ∈ 𝑃 ∧ ((𝑍‘0) = 𝐴 ∧ (𝑍‘1) = 𝐵)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | prelrrx2bd.1 | . . 3 ⊢ (𝜑 → 𝐴 ∈ ℝ) | |
| 2 | prelrrx2bd.2 | . . 3 ⊢ (𝜑 → 𝐵 ∈ ℝ) | |
| 3 | wrdlen2 15100 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝑍 = {〈0, 𝐴〉, 〈1, 𝐵〉} ↔ ((𝑍 ∈ Word ℝ ∧ (♯‘𝑍) = 2) ∧ ((𝑍‘0) = 𝐴 ∧ (𝑍‘1) = 𝐵)))) | |
| 4 | 1, 2, 3 | syl2anc 596 | . 2 ⊢ (𝜑 → (𝑍 = {〈0, 𝐴〉, 〈1, 𝐵〉} ↔ ((𝑍 ∈ Word ℝ ∧ (♯‘𝑍) = 2) ∧ ((𝑍‘0) = 𝐴 ∧ (𝑍‘1) = 𝐵)))) |
| 5 | s2prop 15063 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → 〈“𝐴𝐵”〉 = {〈0, 𝐴〉, 〈1, 𝐵〉}) | |
| 6 | 1, 2, 5 | syl2anc 596 | . . 3 ⊢ (𝜑 → 〈“𝐴𝐵”〉 = {〈0, 𝐴〉, 〈1, 𝐵〉}) |
| 7 | 6 | eqeq2d 2771 | . 2 ⊢ (𝜑 → (𝑍 = 〈“𝐴𝐵”〉 ↔ 𝑍 = {〈0, 𝐴〉, 〈1, 𝐵〉})) |
| 8 | prelrrx2.b | . . . . . . . . . 10 ⊢ 𝑃 = (ℝ ↑m 𝐼) | |
| 9 | prelrrx2.i | . . . . . . . . . . 11 ⊢ 𝐼 = (0..^2) | |
| 10 | 9 | oveq2i 7431 | . . . . . . . . . 10 ⊢ (ℝ ↑m 𝐼) = (ℝ ↑m (0..^2)) |
| 11 | 8, 10 | eqtri 2783 | . . . . . . . . 9 ⊢ 𝑃 = (ℝ ↑m (0..^2)) |
| 12 | 11 | eleq2i 2852 | . . . . . . . 8 ⊢ (𝑍 ∈ 𝑃 ↔ 𝑍 ∈ (ℝ ↑m (0..^2))) |
| 13 | 12 | bilani 510 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑍 ∈ 𝑃) → 𝑍 ∈ (ℝ ↑m (0..^2))) |
| 14 | 13 | elmaprd 8873 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑍 ∈ 𝑃) → 𝑍:(0..^2)⟶ℝ) |
| 15 | iswrdi 14665 | . . . . . 6 ⊢ (𝑍:(0..^2)⟶ℝ → 𝑍 ∈ Word ℝ) | |
| 16 | 14, 15 | syl 18 | . . . . 5 ⊢ ((𝜑 ∧ 𝑍 ∈ 𝑃) → 𝑍 ∈ Word ℝ) |
| 17 | 2nn0 12626 | . . . . . . 7 ⊢ 2 ∈ ℕ0 | |
| 18 | 17 | a1i 11 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑍 ∈ 𝑃) → 2 ∈ ℕ0) |
| 19 | fnfzo0hash 14598 | . . . . . 6 ⊢ ((2 ∈ ℕ0 ∧ 𝑍:(0..^2)⟶ℝ) → (♯‘𝑍) = 2) | |
| 20 | 18, 14, 19 | syl2anc 596 | . . . . 5 ⊢ ((𝜑 ∧ 𝑍 ∈ 𝑃) → (♯‘𝑍) = 2) |
| 21 | 16, 20 | jca 521 | . . . 4 ⊢ ((𝜑 ∧ 𝑍 ∈ 𝑃) → (𝑍 ∈ Word ℝ ∧ (♯‘𝑍) = 2)) |
| 22 | reex 11294 | . . . . . . . 8 ⊢ ℝ ∈ V | |
| 23 | 22 | a1i 11 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑍 ∈ Word ℝ) ∧ (♯‘𝑍) = 2) → ℝ ∈ V) |
| 24 | ovexd 7455 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑍 ∈ Word ℝ) ∧ (♯‘𝑍) = 2) → (0..^2) ∈ V) | |
| 25 | simpr 490 | . . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑍 ∈ Word ℝ) ∧ (♯‘𝑍) = 2) → (♯‘𝑍) = 2) | |
| 26 | 25 | eqcomd 2766 | . . . . . . . 8 ⊢ (((𝜑 ∧ 𝑍 ∈ Word ℝ) ∧ (♯‘𝑍) = 2) → 2 = (♯‘𝑍)) |
| 27 | simplr 781 | . . . . . . . 8 ⊢ (((𝜑 ∧ 𝑍 ∈ Word ℝ) ∧ (♯‘𝑍) = 2) → 𝑍 ∈ Word ℝ) | |
| 28 | 26, 27 | wrdfd 14667 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑍 ∈ Word ℝ) ∧ (♯‘𝑍) = 2) → 𝑍:(0..^2)⟶ℝ) |
| 29 | 23, 24, 28 | elmapdd 8864 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑍 ∈ Word ℝ) ∧ (♯‘𝑍) = 2) → 𝑍 ∈ (ℝ ↑m (0..^2))) |
| 30 | 29, 11 | eleqtrrdi 2871 | . . . . 5 ⊢ (((𝜑 ∧ 𝑍 ∈ Word ℝ) ∧ (♯‘𝑍) = 2) → 𝑍 ∈ 𝑃) |
| 31 | 30 | anasss 472 | . . . 4 ⊢ ((𝜑 ∧ (𝑍 ∈ Word ℝ ∧ (♯‘𝑍) = 2)) → 𝑍 ∈ 𝑃) |
| 32 | 21, 31 | impbida 813 | . . 3 ⊢ (𝜑 → (𝑍 ∈ 𝑃 ↔ (𝑍 ∈ Word ℝ ∧ (♯‘𝑍) = 2))) |
| 33 | 32 | anbi1d 643 | . 2 ⊢ (𝜑 → ((𝑍 ∈ 𝑃 ∧ ((𝑍‘0) = 𝐴 ∧ (𝑍‘1) = 𝐵)) ↔ ((𝑍 ∈ Word ℝ ∧ (♯‘𝑍) = 2) ∧ ((𝑍‘0) = 𝐴 ∧ (𝑍‘1) = 𝐵)))) |
| 34 | 4, 7, 33 | 3bitr4d 314 | 1 ⊢ (𝜑 → (𝑍 = 〈“𝐴𝐵”〉 ↔ (𝑍 ∈ 𝑃 ∧ ((𝑍‘0) = 𝐴 ∧ (𝑍‘1) = 𝐵)))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1569 ∈ wcel 2144 Vcvv 3450 {cpr 4586 〈cop 4834 ⟶wf 6534 ‘cfv 6538 (class class class)co 7420 ↑m cmap 8850 ℝcr 11202 0cc0 11203 1c1 11204 2c2 12400 ℕ0cn0 12609 ..^cfzo 13791 ♯chash 14477 Word cword 14661 〈“cs2 14996 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7751 ax-cnex 11259 ax-resscn 11260 ax-1cn 11261 ax-icn 11262 ax-addcl 11263 ax-addrcl 11264 ax-mulcl 11265 ax-mulrcl 11266 ax-mulcom 11267 ax-addass 11268 ax-mulass 11269 ax-distr 11270 ax-i2m1 11271 ax-1ne0 11272 ax-1rid 11273 ax-rnegex 11274 ax-rrecex 11275 ax-cnre 11276 ax-pre-lttri 11277 ax-pre-lttrn 11278 ax-pre-ltadd 11279 ax-pre-mulgt0 11280 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-int 4907 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7878 df-1st 8001 df-2nd 8002 df-frecs 8302 df-wrecs 8333 df-recs 8382 df-rdg 8421 df-1o 8479 df-oadd 8483 df-er 8720 df-map 8852 df-en 8977 df-dom 8978 df-sdom 8979 df-fin 8980 df-dju 9985 df-card 10023 df-pnf 11348 df-mnf 11349 df-xr 11350 df-ltxr 11351 df-le 11352 df-sub 11546 df-neg 11547 df-nn 12339 df-2 12408 df-n0 12610 df-z 12697 df-uz 12969 df-fz 13643 df-fzo 13792 df-hash 14478 df-word 14662 df-concat 14719 df-s1 14746 df-s2 15003 |
| This theorem is used by: prelrrx2b 49920 rrx2xpref1o 49924 |
| Copyright terms: Public domain | W3C validator |