| Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > rrx2pnedifcoorneor | Structured version Visualization version GIF version | ||
| Description: If two different points 𝑋 and 𝑌 in a real Euclidean space of dimension 2 are different, then at least one difference of two corresponding coordinates is not 0. (Contributed by AV, 26-Feb-2023.) |
| Ref | Expression |
|---|---|
| rrx2pnecoorneor.i | ⊢ 𝐼 = {1, 2} |
| rrx2pnecoorneor.b | ⊢ 𝑃 = (ℝ ↑m 𝐼) |
| rrx2pnedifcoorneor.a | ⊢ 𝐴 = ((𝑌‘1) − (𝑋‘1)) |
| rrx2pnedifcoorneor.b | ⊢ 𝐵 = ((𝑌‘2) − (𝑋‘2)) |
| Ref | Expression |
|---|---|
| rrx2pnedifcoorneor | ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑌 ∈ 𝑃 ∧ 𝑋 ≠ 𝑌) → (𝐴 ≠ 0 ∨ 𝐵 ≠ 0)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rrx2pnecoorneor.i | . . 3 ⊢ 𝐼 = {1, 2} | |
| 2 | rrx2pnecoorneor.b | . . 3 ⊢ 𝑃 = (ℝ ↑m 𝐼) | |
| 3 | 1, 2 | rrx2pnecoorneor 49749 | . 2 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑌 ∈ 𝑃 ∧ 𝑋 ≠ 𝑌) → ((𝑋‘1) ≠ (𝑌‘1) ∨ (𝑋‘2) ≠ (𝑌‘2))) |
| 4 | rrx2pnedifcoorneor.a | . . . . . 6 ⊢ 𝐴 = ((𝑌‘1) − (𝑋‘1)) | |
| 5 | 4 | neeq1i 3019 | . . . . 5 ⊢ (𝐴 ≠ 0 ↔ ((𝑌‘1) − (𝑋‘1)) ≠ 0) |
| 6 | rrx2pnedifcoorneor.b | . . . . . 6 ⊢ 𝐵 = ((𝑌‘2) − (𝑋‘2)) | |
| 7 | 6 | neeq1i 3019 | . . . . 5 ⊢ (𝐵 ≠ 0 ↔ ((𝑌‘2) − (𝑋‘2)) ≠ 0) |
| 8 | 5, 7 | orbi12i 928 | . . . 4 ⊢ ((𝐴 ≠ 0 ∨ 𝐵 ≠ 0) ↔ (((𝑌‘1) − (𝑋‘1)) ≠ 0 ∨ ((𝑌‘2) − (𝑋‘2)) ≠ 0)) |
| 9 | 1, 2 | rrx2pxel 49745 | . . . . . . . . 9 ⊢ (𝑌 ∈ 𝑃 → (𝑌‘1) ∈ ℝ) |
| 10 | 9 | recnd 11308 | . . . . . . . 8 ⊢ (𝑌 ∈ 𝑃 → (𝑌‘1) ∈ ℂ) |
| 11 | 1, 2 | rrx2pxel 49745 | . . . . . . . . 9 ⊢ (𝑋 ∈ 𝑃 → (𝑋‘1) ∈ ℝ) |
| 12 | 11 | recnd 11308 | . . . . . . . 8 ⊢ (𝑋 ∈ 𝑃 → (𝑋‘1) ∈ ℂ) |
| 13 | subeq0 11555 | . . . . . . . 8 ⊢ (((𝑌‘1) ∈ ℂ ∧ (𝑋‘1) ∈ ℂ) → (((𝑌‘1) − (𝑋‘1)) = 0 ↔ (𝑌‘1) = (𝑋‘1))) | |
| 14 | 10, 12, 13 | syl2anr 609 | . . . . . . 7 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑌 ∈ 𝑃) → (((𝑌‘1) − (𝑋‘1)) = 0 ↔ (𝑌‘1) = (𝑋‘1))) |
| 15 | 14 | necon3bid 2999 | . . . . . 6 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑌 ∈ 𝑃) → (((𝑌‘1) − (𝑋‘1)) ≠ 0 ↔ (𝑌‘1) ≠ (𝑋‘1))) |
| 16 | 1, 2 | rrx2pyel 49746 | . . . . . . . . 9 ⊢ (𝑌 ∈ 𝑃 → (𝑌‘2) ∈ ℝ) |
| 17 | 16 | recnd 11308 | . . . . . . . 8 ⊢ (𝑌 ∈ 𝑃 → (𝑌‘2) ∈ ℂ) |
| 18 | 1, 2 | rrx2pyel 49746 | . . . . . . . . 9 ⊢ (𝑋 ∈ 𝑃 → (𝑋‘2) ∈ ℝ) |
| 19 | 18 | recnd 11308 | . . . . . . . 8 ⊢ (𝑋 ∈ 𝑃 → (𝑋‘2) ∈ ℂ) |
| 20 | subeq0 11555 | . . . . . . . 8 ⊢ (((𝑌‘2) ∈ ℂ ∧ (𝑋‘2) ∈ ℂ) → (((𝑌‘2) − (𝑋‘2)) = 0 ↔ (𝑌‘2) = (𝑋‘2))) | |
| 21 | 17, 19, 20 | syl2anr 609 | . . . . . . 7 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑌 ∈ 𝑃) → (((𝑌‘2) − (𝑋‘2)) = 0 ↔ (𝑌‘2) = (𝑋‘2))) |
| 22 | 21 | necon3bid 2999 | . . . . . 6 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑌 ∈ 𝑃) → (((𝑌‘2) − (𝑋‘2)) ≠ 0 ↔ (𝑌‘2) ≠ (𝑋‘2))) |
| 23 | 15, 22 | orbi12d 932 | . . . . 5 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑌 ∈ 𝑃) → ((((𝑌‘1) − (𝑋‘1)) ≠ 0 ∨ ((𝑌‘2) − (𝑋‘2)) ≠ 0) ↔ ((𝑌‘1) ≠ (𝑋‘1) ∨ (𝑌‘2) ≠ (𝑋‘2)))) |
| 24 | necom 3008 | . . . . . 6 ⊢ ((𝑌‘1) ≠ (𝑋‘1) ↔ (𝑋‘1) ≠ (𝑌‘1)) | |
| 25 | necom 3008 | . . . . . 6 ⊢ ((𝑌‘2) ≠ (𝑋‘2) ↔ (𝑋‘2) ≠ (𝑌‘2)) | |
| 26 | 24, 25 | orbi12i 928 | . . . . 5 ⊢ (((𝑌‘1) ≠ (𝑋‘1) ∨ (𝑌‘2) ≠ (𝑋‘2)) ↔ ((𝑋‘1) ≠ (𝑌‘1) ∨ (𝑋‘2) ≠ (𝑌‘2))) |
| 27 | 23, 26 | bitrdi 290 | . . . 4 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑌 ∈ 𝑃) → ((((𝑌‘1) − (𝑋‘1)) ≠ 0 ∨ ((𝑌‘2) − (𝑋‘2)) ≠ 0) ↔ ((𝑋‘1) ≠ (𝑌‘1) ∨ (𝑋‘2) ≠ (𝑌‘2)))) |
| 28 | 8, 27 | bitrid 286 | . . 3 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑌 ∈ 𝑃) → ((𝐴 ≠ 0 ∨ 𝐵 ≠ 0) ↔ ((𝑋‘1) ≠ (𝑌‘1) ∨ (𝑋‘2) ≠ (𝑌‘2)))) |
| 29 | 28 | 3adant3 1150 | . 2 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑌 ∈ 𝑃 ∧ 𝑋 ≠ 𝑌) → ((𝐴 ≠ 0 ∨ 𝐵 ≠ 0) ↔ ((𝑋‘1) ≠ (𝑌‘1) ∨ (𝑋‘2) ≠ (𝑌‘2)))) |
| 30 | 3, 29 | mpbird 260 | 1 ⊢ ((𝑋 ∈ 𝑃 ∧ 𝑌 ∈ 𝑃 ∧ 𝑋 ≠ 𝑌) → (𝐴 ≠ 0 ∨ 𝐵 ≠ 0)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∨ wo 861 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 ≠ wne 2955 {cpr 4585 ‘cfv 6527 (class class class)co 7408 ↑m cmap 8825 ℂcc 11169 ℝcr 11170 0cc0 11171 1c1 11172 − cmin 11512 2c2 12366 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7734 ax-resscn 11228 ax-1cn 11229 ax-icn 11230 ax-addcl 11231 ax-addrcl 11232 ax-mulcl 11233 ax-mulrcl 11234 ax-mulcom 11235 ax-addass 11236 ax-mulass 11237 ax-distr 11238 ax-i2m1 11239 ax-1ne0 11240 ax-1rid 11241 ax-rnegex 11242 ax-rrecex 11243 ax-cnre 11244 ax-pre-lttri 11245 ax-pre-lttrn 11246 ax-pre-ltadd 11247 |
| 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 2100 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-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5542 df-po 5555 df-so 5556 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-iota 6483 df-fun 6529 df-fn 6530 df-f 6531 df-f1 6532 df-fo 6533 df-f1o 6534 df-fv 6535 df-riota 7365 df-ov 7411 df-oprab 7412 df-mpo 7413 df-1st 7984 df-2nd 7985 df-er 8695 df-map 8827 df-en 8952 df-dom 8953 df-sdom 8954 df-pnf 11316 df-mnf 11317 df-ltxr 11319 df-sub 11514 df-2 12374 |
| This theorem is used by: rrx2pnedifcoorneorr 49751 |
| Copyright terms: Public domain | W3C validator |