| 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 15124 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝑍 = {〈0, 𝐴〉, 〈1, 𝐵〉} ↔ ((𝑍 ∈ Word ℝ ∧ (♯‘𝑍) = 2) ∧ ((𝑍‘0) = 𝐴 ∧ (𝑍‘1) = 𝐵)))) | |
| 4 | 1, 2, 3 | syl2anc 596 | . 2 ⊢ (𝜑 → (𝑍 = {〈0, 𝐴〉, 〈1, 𝐵〉} ↔ ((𝑍 ∈ Word ℝ ∧ (♯‘𝑍) = 2) ∧ ((𝑍‘0) = 𝐴 ∧ (𝑍‘1) = 𝐵)))) |
| 5 | s2prop 15087 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → 〈“𝐴𝐵”〉 = {〈0, 𝐴〉, 〈1, 𝐵〉}) | |
| 6 | 1, 2, 5 | syl2anc 596 | . . 3 ⊢ (𝜑 → 〈“𝐴𝐵”〉 = {〈0, 𝐴〉, 〈1, 𝐵〉}) |
| 7 | 6 | eqeq2d 2774 | . 2 ⊢ (𝜑 → (𝑍 = 〈“𝐴𝐵”〉 ↔ 𝑍 = {〈0, 𝐴〉, 〈1, 𝐵〉})) |
| 8 | prelrrx2.b | . . . . . . . . . 10 ⊢ 𝑃 = (ℝ ↑m 𝐼) | |
| 9 | prelrrx2.i | . . . . . . . . . . 11 ⊢ 𝐼 = (0..^2) | |
| 10 | 9 | oveq2i 7454 | . . . . . . . . . 10 ⊢ (ℝ ↑m 𝐼) = (ℝ ↑m (0..^2)) |
| 11 | 8, 10 | eqtri 2786 | . . . . . . . . 9 ⊢ 𝑃 = (ℝ ↑m (0..^2)) |
| 12 | 11 | eleq2i 2856 | . . . . . . . 8 ⊢ (𝑍 ∈ 𝑃 ↔ 𝑍 ∈ (ℝ ↑m (0..^2))) |
| 13 | 12 | bilani 510 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑍 ∈ 𝑃) → 𝑍 ∈ (ℝ ↑m (0..^2))) |
| 14 | 13 | elmaprd 8898 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑍 ∈ 𝑃) → 𝑍:(0..^2)⟶ℝ) |
| 15 | iswrdi 14689 | . . . . . 6 ⊢ (𝑍:(0..^2)⟶ℝ → 𝑍 ∈ Word ℝ) | |
| 16 | 14, 15 | syl 18 | . . . . 5 ⊢ ((𝜑 ∧ 𝑍 ∈ 𝑃) → 𝑍 ∈ Word ℝ) |
| 17 | 2nn0 12650 | . . . . . . 7 ⊢ 2 ∈ ℕ0 | |
| 18 | 17 | a1i 11 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑍 ∈ 𝑃) → 2 ∈ ℕ0) |
| 19 | fnfzo0hash 14622 | . . . . . 6 ⊢ ((2 ∈ ℕ0 ∧ 𝑍:(0..^2)⟶ℝ) → (♯‘𝑍) = 2) | |
| 20 | 18, 14, 19 | syl2anc 596 | . . . . 5 ⊢ ((𝜑 ∧ 𝑍 ∈ 𝑃) → (♯‘𝑍) = 2) |
| 21 | 16, 20 | jca 521 | . . . 4 ⊢ ((𝜑 ∧ 𝑍 ∈ 𝑃) → (𝑍 ∈ Word ℝ ∧ (♯‘𝑍) = 2)) |
| 22 | reex 11318 | . . . . . . . 8 ⊢ ℝ ∈ V | |
| 23 | 22 | a1i 11 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑍 ∈ Word ℝ) ∧ (♯‘𝑍) = 2) → ℝ ∈ V) |
| 24 | ovexd 7478 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑍 ∈ Word ℝ) ∧ (♯‘𝑍) = 2) → (0..^2) ∈ V) | |
| 25 | simpr 490 | . . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑍 ∈ Word ℝ) ∧ (♯‘𝑍) = 2) → (♯‘𝑍) = 2) | |
| 26 | 25 | eqcomd 2769 | . . . . . . . 8 ⊢ (((𝜑 ∧ 𝑍 ∈ Word ℝ) ∧ (♯‘𝑍) = 2) → 2 = (♯‘𝑍)) |
| 27 | simplr 781 | . . . . . . . 8 ⊢ (((𝜑 ∧ 𝑍 ∈ Word ℝ) ∧ (♯‘𝑍) = 2) → 𝑍 ∈ Word ℝ) | |
| 28 | 26, 27 | wrdfd 14691 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑍 ∈ Word ℝ) ∧ (♯‘𝑍) = 2) → 𝑍:(0..^2)⟶ℝ) |
| 29 | 23, 24, 28 | elmapdd 8889 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑍 ∈ Word ℝ) ∧ (♯‘𝑍) = 2) → 𝑍 ∈ (ℝ ↑m (0..^2))) |
| 30 | 29, 11 | eleqtrrdi 2875 | . . . . 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 1570 ∈ wcel 2147 Vcvv 3454 {cpr 4590 〈cop 4838 ⟶wf 6554 ‘cfv 6558 (class class class)co 7443 ↑m cmap 8875 ℝcr 11226 0cc0 11227 1c1 11228 2c2 12424 ℕ0cn0 12633 ..^cfzo 13815 ♯chash 14501 Word cword 14685 〈“cs2 15020 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5235 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7775 ax-cnex 11283 ax-resscn 11284 ax-1cn 11285 ax-icn 11286 ax-addcl 11287 ax-addrcl 11288 ax-mulcl 11289 ax-mulrcl 11290 ax-mulcom 11291 ax-addass 11292 ax-mulass 11293 ax-distr 11294 ax-i2m1 11295 ax-1ne0 11296 ax-1rid 11297 ax-rnegex 11298 ax-rrecex 11299 ax-cnre 11300 ax-pre-lttri 11301 ax-pre-lttrn 11302 ax-pre-ltadd 11303 ax-pre-mulgt0 11304 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-int 4911 df-iun 4956 df-br 5107 df-opab 5171 df-mpt 5190 df-tr 5216 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6322 df-ord 6383 df-on 6384 df-lim 6385 df-suc 6386 df-iota 6512 df-fun 6560 df-fn 6561 df-f 6562 df-f1 6563 df-fo 6564 df-f1o 6565 df-fv 6566 df-riota 7400 df-ov 7446 df-oprab 7447 df-mpo 7448 df-om 7902 df-1st 8025 df-2nd 8026 df-frecs 8327 df-wrecs 8358 df-recs 8407 df-rdg 8446 df-1o 8504 df-oadd 8508 df-er 8745 df-map 8877 df-en 9002 df-dom 9003 df-sdom 9004 df-fin 9005 df-dju 10009 df-card 10047 df-pnf 11372 df-mnf 11373 df-xr 11374 df-ltxr 11375 df-le 11376 df-sub 11570 df-neg 11571 df-nn 12363 df-2 12432 df-n0 12634 df-z 12721 df-uz 12993 df-fz 13667 df-fzo 13816 df-hash 14502 df-word 14686 df-concat 14743 df-s1 14770 df-s2 15027 |
| This theorem is used by: prelrrx2b 50032 rrx2xpref1o 50036 |
| Copyright terms: Public domain | W3C validator |