| Hilbert Space Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > HSE Home > Th. List > 3oalem1 | Structured version Visualization version GIF version | ||
| Description: Lemma for 3OA (weak) orthoarguesian law. (Contributed by NM, 19-Oct-1999.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| 3oalem1.1 | ⊢ 𝐵 ∈ Cℋ |
| 3oalem1.2 | ⊢ 𝐶 ∈ Cℋ |
| 3oalem1.3 | ⊢ 𝑅 ∈ Cℋ |
| 3oalem1.4 | ⊢ 𝑆 ∈ Cℋ |
| Ref | Expression |
|---|---|
| 3oalem1 | ⊢ ((((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝑅) ∧ 𝑣 = (𝑥 +ℎ 𝑦)) ∧ ((𝑧 ∈ 𝐶 ∧ 𝑤 ∈ 𝑆) ∧ 𝑣 = (𝑧 +ℎ 𝑤))) → (((𝑥 ∈ ℋ ∧ 𝑦 ∈ ℋ) ∧ 𝑣 ∈ ℋ) ∧ (𝑧 ∈ ℋ ∧ 𝑤 ∈ ℋ))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 3oalem1.1 | . . . . 5 ⊢ 𝐵 ∈ Cℋ | |
| 2 | 1 | cheli 31713 | . . . 4 ⊢ (𝑥 ∈ 𝐵 → 𝑥 ∈ ℋ) |
| 3 | 3oalem1.3 | . . . . 5 ⊢ 𝑅 ∈ Cℋ | |
| 4 | 3 | cheli 31713 | . . . 4 ⊢ (𝑦 ∈ 𝑅 → 𝑦 ∈ ℋ) |
| 5 | 2, 4 | anim12i 625 | . . 3 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝑅) → (𝑥 ∈ ℋ ∧ 𝑦 ∈ ℋ)) |
| 6 | hvaddcl 31493 | . . . . 5 ⊢ ((𝑥 ∈ ℋ ∧ 𝑦 ∈ ℋ) → (𝑥 +ℎ 𝑦) ∈ ℋ) | |
| 7 | eleq1 2848 | . . . . 5 ⊢ (𝑣 = (𝑥 +ℎ 𝑦) → (𝑣 ∈ ℋ ↔ (𝑥 +ℎ 𝑦) ∈ ℋ)) | |
| 8 | 6, 7 | syl5ibrcom 250 | . . . 4 ⊢ ((𝑥 ∈ ℋ ∧ 𝑦 ∈ ℋ) → (𝑣 = (𝑥 +ℎ 𝑦) → 𝑣 ∈ ℋ)) |
| 9 | 8 | imdistani 579 | . . 3 ⊢ (((𝑥 ∈ ℋ ∧ 𝑦 ∈ ℋ) ∧ 𝑣 = (𝑥 +ℎ 𝑦)) → ((𝑥 ∈ ℋ ∧ 𝑦 ∈ ℋ) ∧ 𝑣 ∈ ℋ)) |
| 10 | 5, 9 | sylan 592 | . 2 ⊢ (((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝑅) ∧ 𝑣 = (𝑥 +ℎ 𝑦)) → ((𝑥 ∈ ℋ ∧ 𝑦 ∈ ℋ) ∧ 𝑣 ∈ ℋ)) |
| 11 | 3oalem1.2 | . . . . 5 ⊢ 𝐶 ∈ Cℋ | |
| 12 | 11 | cheli 31713 | . . . 4 ⊢ (𝑧 ∈ 𝐶 → 𝑧 ∈ ℋ) |
| 13 | 3oalem1.4 | . . . . 5 ⊢ 𝑆 ∈ Cℋ | |
| 14 | 13 | cheli 31713 | . . . 4 ⊢ (𝑤 ∈ 𝑆 → 𝑤 ∈ ℋ) |
| 15 | 12, 14 | anim12i 625 | . . 3 ⊢ ((𝑧 ∈ 𝐶 ∧ 𝑤 ∈ 𝑆) → (𝑧 ∈ ℋ ∧ 𝑤 ∈ ℋ)) |
| 16 | 15 | adantr 486 | . 2 ⊢ (((𝑧 ∈ 𝐶 ∧ 𝑤 ∈ 𝑆) ∧ 𝑣 = (𝑧 +ℎ 𝑤)) → (𝑧 ∈ ℋ ∧ 𝑤 ∈ ℋ)) |
| 17 | 10, 16 | anim12i 625 | 1 ⊢ ((((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝑅) ∧ 𝑣 = (𝑥 +ℎ 𝑦)) ∧ ((𝑧 ∈ 𝐶 ∧ 𝑤 ∈ 𝑆) ∧ 𝑣 = (𝑧 +ℎ 𝑤))) → (((𝑥 ∈ ℋ ∧ 𝑦 ∈ ℋ) ∧ 𝑣 ∈ ℋ) ∧ (𝑧 ∈ ℋ ∧ 𝑤 ∈ ℋ))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 (class class class)co 7413 ℋchba 31400 +ℎ cva 31401 Cℋ cch 31410 |
| 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 5251 ax-nul 5263 ax-pr 5398 ax-hilex 31480 ax-hfvadd 31481 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 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-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5550 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-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-fv 6541 df-ov 7416 df-sh 31688 df-ch 31702 |
| This theorem is used by: 3oalem2 32144 |
| Copyright terms: Public domain | W3C validator |