Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > dalem18 | Structured version Visualization version GIF version |
Description: Lemma for dath 36874. Show that a dummy atom 𝑐 exists outside of the 𝑌 and 𝑍 planes (when those planes are equal). This requires that the projective space be 3-dimensional. (Desargues's theorem does not always hold in 2 dimensions.) (Contributed by NM, 29-Jul-2012.) |
Ref | Expression |
---|---|
dalema.ph | ⊢ (𝜑 ↔ (((𝐾 ∈ HL ∧ 𝐶 ∈ (Base‘𝐾)) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴 ∧ 𝑈 ∈ 𝐴)) ∧ (𝑌 ∈ 𝑂 ∧ 𝑍 ∈ 𝑂) ∧ ((¬ 𝐶 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝐶 ≤ (𝑄 ∨ 𝑅) ∧ ¬ 𝐶 ≤ (𝑅 ∨ 𝑃)) ∧ (¬ 𝐶 ≤ (𝑆 ∨ 𝑇) ∧ ¬ 𝐶 ≤ (𝑇 ∨ 𝑈) ∧ ¬ 𝐶 ≤ (𝑈 ∨ 𝑆)) ∧ (𝐶 ≤ (𝑃 ∨ 𝑆) ∧ 𝐶 ≤ (𝑄 ∨ 𝑇) ∧ 𝐶 ≤ (𝑅 ∨ 𝑈))))) |
dalemc.l | ⊢ ≤ = (le‘𝐾) |
dalemc.j | ⊢ ∨ = (join‘𝐾) |
dalemc.a | ⊢ 𝐴 = (Atoms‘𝐾) |
dalem18.y | ⊢ 𝑌 = ((𝑃 ∨ 𝑄) ∨ 𝑅) |
Ref | Expression |
---|---|
dalem18 | ⊢ (𝜑 → ∃𝑐 ∈ 𝐴 ¬ 𝑐 ≤ 𝑌) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dalema.ph | . . . 4 ⊢ (𝜑 ↔ (((𝐾 ∈ HL ∧ 𝐶 ∈ (Base‘𝐾)) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴 ∧ 𝑈 ∈ 𝐴)) ∧ (𝑌 ∈ 𝑂 ∧ 𝑍 ∈ 𝑂) ∧ ((¬ 𝐶 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝐶 ≤ (𝑄 ∨ 𝑅) ∧ ¬ 𝐶 ≤ (𝑅 ∨ 𝑃)) ∧ (¬ 𝐶 ≤ (𝑆 ∨ 𝑇) ∧ ¬ 𝐶 ≤ (𝑇 ∨ 𝑈) ∧ ¬ 𝐶 ≤ (𝑈 ∨ 𝑆)) ∧ (𝐶 ≤ (𝑃 ∨ 𝑆) ∧ 𝐶 ≤ (𝑄 ∨ 𝑇) ∧ 𝐶 ≤ (𝑅 ∨ 𝑈))))) | |
2 | 1 | dalemkehl 36761 | . . 3 ⊢ (𝜑 → 𝐾 ∈ HL) |
3 | 1 | dalempea 36764 | . . 3 ⊢ (𝜑 → 𝑃 ∈ 𝐴) |
4 | 1 | dalemqea 36765 | . . 3 ⊢ (𝜑 → 𝑄 ∈ 𝐴) |
5 | 1 | dalemrea 36766 | . . 3 ⊢ (𝜑 → 𝑅 ∈ 𝐴) |
6 | dalemc.j | . . . 4 ⊢ ∨ = (join‘𝐾) | |
7 | dalemc.l | . . . 4 ⊢ ≤ = (le‘𝐾) | |
8 | dalemc.a | . . . 4 ⊢ 𝐴 = (Atoms‘𝐾) | |
9 | 6, 7, 8 | 3dim3 36607 | . . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴)) → ∃𝑐 ∈ 𝐴 ¬ 𝑐 ≤ ((𝑃 ∨ 𝑄) ∨ 𝑅)) |
10 | 2, 3, 4, 5, 9 | syl13anc 1368 | . 2 ⊢ (𝜑 → ∃𝑐 ∈ 𝐴 ¬ 𝑐 ≤ ((𝑃 ∨ 𝑄) ∨ 𝑅)) |
11 | dalem18.y | . . . . 5 ⊢ 𝑌 = ((𝑃 ∨ 𝑄) ∨ 𝑅) | |
12 | 11 | breq2i 5076 | . . . 4 ⊢ (𝑐 ≤ 𝑌 ↔ 𝑐 ≤ ((𝑃 ∨ 𝑄) ∨ 𝑅)) |
13 | 12 | notbii 322 | . . 3 ⊢ (¬ 𝑐 ≤ 𝑌 ↔ ¬ 𝑐 ≤ ((𝑃 ∨ 𝑄) ∨ 𝑅)) |
14 | 13 | rexbii 3249 | . 2 ⊢ (∃𝑐 ∈ 𝐴 ¬ 𝑐 ≤ 𝑌 ↔ ∃𝑐 ∈ 𝐴 ¬ 𝑐 ≤ ((𝑃 ∨ 𝑄) ∨ 𝑅)) |
15 | 10, 14 | sylibr 236 | 1 ⊢ (𝜑 → ∃𝑐 ∈ 𝐴 ¬ 𝑐 ≤ 𝑌) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 ∧ wa 398 ∧ w3a 1083 = wceq 1537 ∈ wcel 2114 ∃wrex 3141 class class class wbr 5068 ‘cfv 6357 (class class class)co 7158 Basecbs 16485 lecple 16574 joincjn 17556 Atomscatm 36401 HLchlt 36488 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-rep 5192 ax-sep 5205 ax-nul 5212 ax-pow 5268 ax-pr 5332 ax-un 7463 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ne 3019 df-ral 3145 df-rex 3146 df-reu 3147 df-rab 3149 df-v 3498 df-sbc 3775 df-csb 3886 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-nul 4294 df-if 4470 df-pw 4543 df-sn 4570 df-pr 4572 df-op 4576 df-uni 4841 df-iun 4923 df-br 5069 df-opab 5131 df-mpt 5149 df-id 5462 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-rn 5568 df-res 5569 df-ima 5570 df-iota 6316 df-fun 6359 df-fn 6360 df-f 6361 df-f1 6362 df-fo 6363 df-f1o 6364 df-fv 6365 df-riota 7116 df-ov 7161 df-oprab 7162 df-proset 17540 df-poset 17558 df-plt 17570 df-lub 17586 df-glb 17587 df-join 17588 df-meet 17589 df-p0 17651 df-p1 17652 df-lat 17658 df-clat 17720 df-oposet 36314 df-ol 36316 df-oml 36317 df-covers 36404 df-ats 36405 df-atl 36436 df-cvlat 36460 df-hlat 36489 |
This theorem is referenced by: dalem20 36831 |
Copyright terms: Public domain | W3C validator |