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 36985. 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 4296 | . . 3 ⊢ (𝑟 ∈ (𝑋 ∩ ( ⊥ ‘𝑋)) → ¬ (𝑋 ∩ ( ⊥ ‘𝑋)) = ∅) | |
2 | pexmidlem.a | . . . . 5 ⊢ 𝐴 = (Atoms‘𝐾) | |
3 | pexmidlem.o | . . . . 5 ⊢ ⊥ = (⊥𝑃‘𝐾) | |
4 | 2, 3 | pnonsingN 36949 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) → (𝑋 ∩ ( ⊥ ‘𝑋)) = ∅) |
5 | 4 | adantr 481 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋))) → (𝑋 ∩ ( ⊥ ‘𝑋)) = ∅) |
6 | 1, 5 | nsyl3 140 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋))) → ¬ 𝑟 ∈ (𝑋 ∩ ( ⊥ ‘𝑋))) |
7 | simprr 769 | . . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋))) → 𝑞 ∈ ( ⊥ ‘𝑋)) | |
8 | eleq1w 2892 | . . . . . 6 ⊢ (𝑞 = 𝑟 → (𝑞 ∈ ( ⊥ ‘𝑋) ↔ 𝑟 ∈ ( ⊥ ‘𝑋))) | |
9 | 7, 8 | syl5ibcom 246 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋))) → (𝑞 = 𝑟 → 𝑟 ∈ ( ⊥ ‘𝑋))) |
10 | simprl 767 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋))) → 𝑟 ∈ 𝑋) | |
11 | 9, 10 | jctild 526 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋))) → (𝑞 = 𝑟 → (𝑟 ∈ 𝑋 ∧ 𝑟 ∈ ( ⊥ ‘𝑋)))) |
12 | elin 4166 | . . . 4 ⊢ (𝑟 ∈ (𝑋 ∩ ( ⊥ ‘𝑋)) ↔ (𝑟 ∈ 𝑋 ∧ 𝑟 ∈ ( ⊥ ‘𝑋))) | |
13 | 11, 12 | syl6ibr 253 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋))) → (𝑞 = 𝑟 → 𝑟 ∈ (𝑋 ∩ ( ⊥ ‘𝑋)))) |
14 | 13 | necon3bd 3027 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋))) → (¬ 𝑟 ∈ (𝑋 ∩ ( ⊥ ‘𝑋)) → 𝑞 ≠ 𝑟)) |
15 | 6, 14 | mpd 15 | 1 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋))) → 𝑞 ≠ 𝑟) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 396 = wceq 1528 ∈ wcel 2105 ≠ wne 3013 ∩ cin 3932 ⊆ wss 3933 ∅c0 4288 {csn 4557 ‘cfv 6348 (class class class)co 7145 lecple 16560 joincjn 17542 Atomscatm 36279 HLchlt 36366 +𝑃cpadd 36811 ⊥𝑃cpolN 36918 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-ext 2790 ax-rep 5181 ax-sep 5194 ax-nul 5201 ax-pow 5257 ax-pr 5320 ax-un 7450 ax-riotaBAD 35969 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-3an 1081 df-tru 1531 df-ex 1772 df-nf 1776 df-sb 2061 df-mo 2615 df-eu 2647 df-clab 2797 df-cleq 2811 df-clel 2890 df-nfc 2960 df-ne 3014 df-ral 3140 df-rex 3141 df-reu 3142 df-rmo 3143 df-rab 3144 df-v 3494 df-sbc 3770 df-csb 3881 df-dif 3936 df-un 3938 df-in 3940 df-ss 3949 df-nul 4289 df-if 4464 df-pw 4537 df-sn 4558 df-pr 4560 df-op 4564 df-uni 4831 df-iun 4912 df-iin 4913 df-br 5058 df-opab 5120 df-mpt 5138 df-id 5453 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-rn 5559 df-res 5560 df-ima 5561 df-iota 6307 df-fun 6350 df-fn 6351 df-f 6352 df-f1 6353 df-fo 6354 df-f1o 6355 df-fv 6356 df-riota 7103 df-ov 7148 df-oprab 7149 df-undef 7928 df-proset 17526 df-poset 17544 df-plt 17556 df-lub 17572 df-glb 17573 df-join 17574 df-meet 17575 df-p0 17637 df-p1 17638 df-lat 17644 df-clat 17706 df-oposet 36192 df-ol 36194 df-oml 36195 df-covers 36282 df-ats 36283 df-atl 36314 df-cvlat 36338 df-hlat 36367 df-pmap 36520 df-polarityN 36919 |
This theorem is referenced by: pexmidlem3N 36988 |
Copyright terms: Public domain | W3C validator |