| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > pexmidlem1N | Structured version Visualization version GIF version | ||
| Description: Lemma for pexmidN 39963. Holland's proof implicitly requires 𝑞 ≠ 𝑟, which we prove here. (Contributed by NM, 2-Feb-2012.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| pexmidlem.l | ⊢ ≤ = (le‘𝐾) |
| pexmidlem.j | ⊢ ∨ = (join‘𝐾) |
| pexmidlem.a | ⊢ 𝐴 = (Atoms‘𝐾) |
| pexmidlem.p | ⊢ + = (+𝑃‘𝐾) |
| pexmidlem.o | ⊢ ⊥ = (⊥𝑃‘𝐾) |
| pexmidlem.m | ⊢ 𝑀 = (𝑋 + {𝑝}) |
| Ref | Expression |
|---|---|
| pexmidlem1N | ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋))) → 𝑞 ≠ 𝑟) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | n0i 4303 | . . 3 ⊢ (𝑟 ∈ (𝑋 ∩ ( ⊥ ‘𝑋)) → ¬ (𝑋 ∩ ( ⊥ ‘𝑋)) = ∅) | |
| 2 | pexmidlem.a | . . . . 5 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 3 | pexmidlem.o | . . . . 5 ⊢ ⊥ = (⊥𝑃‘𝐾) | |
| 4 | 2, 3 | pnonsingN 39927 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) → (𝑋 ∩ ( ⊥ ‘𝑋)) = ∅) |
| 5 | 4 | adantr 480 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋))) → (𝑋 ∩ ( ⊥ ‘𝑋)) = ∅) |
| 6 | 1, 5 | nsyl3 138 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋))) → ¬ 𝑟 ∈ (𝑋 ∩ ( ⊥ ‘𝑋))) |
| 7 | simprr 772 | . . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋))) → 𝑞 ∈ ( ⊥ ‘𝑋)) | |
| 8 | eleq1w 2811 | . . . . . 6 ⊢ (𝑞 = 𝑟 → (𝑞 ∈ ( ⊥ ‘𝑋) ↔ 𝑟 ∈ ( ⊥ ‘𝑋))) | |
| 9 | 7, 8 | syl5ibcom 245 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋))) → (𝑞 = 𝑟 → 𝑟 ∈ ( ⊥ ‘𝑋))) |
| 10 | simprl 770 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋))) → 𝑟 ∈ 𝑋) | |
| 11 | 9, 10 | jctild 525 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋))) → (𝑞 = 𝑟 → (𝑟 ∈ 𝑋 ∧ 𝑟 ∈ ( ⊥ ‘𝑋)))) |
| 12 | elin 3930 | . . . 4 ⊢ (𝑟 ∈ (𝑋 ∩ ( ⊥ ‘𝑋)) ↔ (𝑟 ∈ 𝑋 ∧ 𝑟 ∈ ( ⊥ ‘𝑋))) | |
| 13 | 11, 12 | imbitrrdi 252 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋))) → (𝑞 = 𝑟 → 𝑟 ∈ (𝑋 ∩ ( ⊥ ‘𝑋)))) |
| 14 | 13 | necon3bd 2939 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋))) → (¬ 𝑟 ∈ (𝑋 ∩ ( ⊥ ‘𝑋)) → 𝑞 ≠ 𝑟)) |
| 15 | 6, 14 | mpd 15 | 1 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋))) → 𝑞 ≠ 𝑟) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2109 ≠ wne 2925 ∩ cin 3913 ⊆ wss 3914 ∅c0 4296 {csn 4589 ‘cfv 6511 (class class class)co 7387 lecple 17227 joincjn 18272 Atomscatm 39256 HLchlt 39343 +𝑃cpadd 39789 ⊥𝑃cpolN 39896 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5234 ax-sep 5251 ax-nul 5261 ax-pow 5320 ax-pr 5387 ax-un 7711 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-ral 3045 df-rex 3054 df-rmo 3354 df-reu 3355 df-rab 3406 df-v 3449 df-sbc 3754 df-csb 3863 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-nul 4297 df-if 4489 df-pw 4565 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4872 df-iun 4957 df-iin 4958 df-br 5108 df-opab 5170 df-mpt 5189 df-id 5533 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-res 5650 df-ima 5651 df-iota 6464 df-fun 6513 df-fn 6514 df-f 6515 df-f1 6516 df-fo 6517 df-f1o 6518 df-fv 6519 df-riota 7344 df-ov 7390 df-oprab 7391 df-proset 18255 df-poset 18274 df-plt 18289 df-lub 18305 df-glb 18306 df-join 18307 df-meet 18308 df-p0 18384 df-p1 18385 df-lat 18391 df-clat 18458 df-oposet 39169 df-ol 39171 df-oml 39172 df-covers 39259 df-ats 39260 df-atl 39291 df-cvlat 39315 df-hlat 39344 df-pmap 39498 df-polarityN 39897 |
| This theorem is referenced by: pexmidlem3N 39966 |
| Copyright terms: Public domain | W3C validator |