| 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 40349. 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 4294 | . . 3 ⊢ (𝑟 ∈ (𝑋 ∩ ( ⊥ ‘𝑋)) → ¬ (𝑋 ∩ ( ⊥ ‘𝑋)) = ∅) | |
| 2 | pexmidlem.a | . . . . 5 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 3 | pexmidlem.o | . . . . 5 ⊢ ⊥ = (⊥𝑃‘𝐾) | |
| 4 | 2, 3 | pnonsingN 40313 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) → (𝑋 ∩ ( ⊥ ‘𝑋)) = ∅) |
| 5 | 4 | adantr 480 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋))) → (𝑋 ∩ ( ⊥ ‘𝑋)) = ∅) |
| 6 | 1, 5 | nsyl3 138 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋))) → ¬ 𝑟 ∈ (𝑋 ∩ ( ⊥ ‘𝑋))) |
| 7 | simprr 773 | . . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋))) → 𝑞 ∈ ( ⊥ ‘𝑋)) | |
| 8 | eleq1w 2820 | . . . . . 6 ⊢ (𝑞 = 𝑟 → (𝑞 ∈ ( ⊥ ‘𝑋) ↔ 𝑟 ∈ ( ⊥ ‘𝑋))) | |
| 9 | 7, 8 | syl5ibcom 245 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋))) → (𝑞 = 𝑟 → 𝑟 ∈ ( ⊥ ‘𝑋))) |
| 10 | simprl 771 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋))) → 𝑟 ∈ 𝑋) | |
| 11 | 9, 10 | jctild 525 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋))) → (𝑞 = 𝑟 → (𝑟 ∈ 𝑋 ∧ 𝑟 ∈ ( ⊥ ‘𝑋)))) |
| 12 | elin 3919 | . . . 4 ⊢ (𝑟 ∈ (𝑋 ∩ ( ⊥ ‘𝑋)) ↔ (𝑟 ∈ 𝑋 ∧ 𝑟 ∈ ( ⊥ ‘𝑋))) | |
| 13 | 11, 12 | imbitrrdi 252 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋))) → (𝑞 = 𝑟 → 𝑟 ∈ (𝑋 ∩ ( ⊥ ‘𝑋)))) |
| 14 | 13 | necon3bd 2947 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋))) → (¬ 𝑟 ∈ (𝑋 ∩ ( ⊥ ‘𝑋)) → 𝑞 ≠ 𝑟)) |
| 15 | 6, 14 | mpd 15 | 1 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) ∧ (𝑟 ∈ 𝑋 ∧ 𝑞 ∈ ( ⊥ ‘𝑋))) → 𝑞 ≠ 𝑟) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ≠ wne 2933 ∩ cin 3902 ⊆ wss 3903 ∅c0 4287 {csn 4582 ‘cfv 6500 (class class class)co 7368 lecple 17196 joincjn 18246 Atomscatm 39643 HLchlt 39730 +𝑃cpadd 40175 ⊥𝑃cpolN 40282 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5226 ax-sep 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-rmo 3352 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-iun 4950 df-iin 4951 df-br 5101 df-opab 5163 df-mpt 5182 df-id 5527 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-riota 7325 df-ov 7371 df-oprab 7372 df-proset 18229 df-poset 18248 df-plt 18263 df-lub 18279 df-glb 18280 df-join 18281 df-meet 18282 df-p0 18358 df-p1 18359 df-lat 18367 df-clat 18434 df-oposet 39556 df-ol 39558 df-oml 39559 df-covers 39646 df-ats 39647 df-atl 39678 df-cvlat 39702 df-hlat 39731 df-pmap 39884 df-polarityN 40283 |
| This theorem is referenced by: pexmidlem3N 40352 |
| Copyright terms: Public domain | W3C validator |