| 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 31613 | . . . 4 ⊢ (𝑥 ∈ 𝐵 → 𝑥 ∈ ℋ) |
| 3 | 3oalem1.3 | . . . . 5 ⊢ 𝑅 ∈ Cℋ | |
| 4 | 3 | cheli 31613 | . . . 4 ⊢ (𝑦 ∈ 𝑅 → 𝑦 ∈ ℋ) |
| 5 | 2, 4 | anim12i 625 | . . 3 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝑅) → (𝑥 ∈ ℋ ∧ 𝑦 ∈ ℋ)) |
| 6 | hvaddcl 31393 | . . . . 5 ⊢ ((𝑥 ∈ ℋ ∧ 𝑦 ∈ ℋ) → (𝑥 +ℎ 𝑦) ∈ ℋ) | |
| 7 | eleq1 2853 | . . . . 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 31613 | . . . 4 ⊢ (𝑧 ∈ 𝐶 → 𝑧 ∈ ℋ) |
| 13 | 3oalem1.4 | . . . . 5 ⊢ 𝑆 ∈ Cℋ | |
| 14 | 13 | cheli 31613 | . . . 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 2146 (class class class)co 7416 ℋchba 31300 +ℎ cva 31301 Cℋ cch 31310 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-sep 5259 ax-nul 5271 ax-pr 5406 ax-hilex 31380 ax-hfvadd 31381 |
| 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 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3082 df-rex 3092 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-id 5558 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-fv 6548 df-ov 7419 df-sh 31588 df-ch 31602 |
| This theorem is used by: 3oalem2 32044 |
| Copyright terms: Public domain | W3C validator |