![]() |
Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > pexmidlem5N | Structured version Visualization version GIF version |
Description: Lemma for pexmidN 39926. (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 |
---|---|
pexmidlem5N | ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (𝑋 ≠ ∅ ∧ ¬ 𝑝 ∈ (𝑋 + ( ⊥ ‘𝑋)))) → (( ⊥ ‘𝑋) ∩ 𝑀) = ∅) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | n0 4376 | . . . 4 ⊢ ((( ⊥ ‘𝑋) ∩ 𝑀) ≠ ∅ ↔ ∃𝑞 𝑞 ∈ (( ⊥ ‘𝑋) ∩ 𝑀)) | |
2 | pexmidlem.l | . . . . . . 7 ⊢ ≤ = (le‘𝐾) | |
3 | pexmidlem.j | . . . . . . 7 ⊢ ∨ = (join‘𝐾) | |
4 | pexmidlem.a | . . . . . . 7 ⊢ 𝐴 = (Atoms‘𝐾) | |
5 | pexmidlem.p | . . . . . . 7 ⊢ + = (+𝑃‘𝐾) | |
6 | pexmidlem.o | . . . . . . 7 ⊢ ⊥ = (⊥𝑃‘𝐾) | |
7 | pexmidlem.m | . . . . . . 7 ⊢ 𝑀 = (𝑋 + {𝑝}) | |
8 | 2, 3, 4, 5, 6, 7 | pexmidlem4N 39930 | . . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (𝑋 ≠ ∅ ∧ 𝑞 ∈ (( ⊥ ‘𝑋) ∩ 𝑀))) → 𝑝 ∈ (𝑋 + ( ⊥ ‘𝑋))) |
9 | 8 | expr 456 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ 𝑋 ≠ ∅) → (𝑞 ∈ (( ⊥ ‘𝑋) ∩ 𝑀) → 𝑝 ∈ (𝑋 + ( ⊥ ‘𝑋)))) |
10 | 9 | exlimdv 1932 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ 𝑋 ≠ ∅) → (∃𝑞 𝑞 ∈ (( ⊥ ‘𝑋) ∩ 𝑀) → 𝑝 ∈ (𝑋 + ( ⊥ ‘𝑋)))) |
11 | 1, 10 | biimtrid 242 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ 𝑋 ≠ ∅) → ((( ⊥ ‘𝑋) ∩ 𝑀) ≠ ∅ → 𝑝 ∈ (𝑋 + ( ⊥ ‘𝑋)))) |
12 | 11 | necon1bd 2964 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ 𝑋 ≠ ∅) → (¬ 𝑝 ∈ (𝑋 + ( ⊥ ‘𝑋)) → (( ⊥ ‘𝑋) ∩ 𝑀) = ∅)) |
13 | 12 | impr 454 | 1 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (𝑋 ≠ ∅ ∧ ¬ 𝑝 ∈ (𝑋 + ( ⊥ ‘𝑋)))) → (( ⊥ ‘𝑋) ∩ 𝑀) = ∅) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 ∧ w3a 1087 = wceq 1537 ∃wex 1777 ∈ wcel 2108 ≠ wne 2946 ∩ cin 3975 ⊆ wss 3976 ∅c0 4352 {csn 4648 ‘cfv 6573 (class class class)co 7448 lecple 17318 joincjn 18381 Atomscatm 39219 HLchlt 39306 +𝑃cpadd 39752 ⊥𝑃cpolN 39859 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-rep 5303 ax-sep 5317 ax-nul 5324 ax-pow 5383 ax-pr 5447 ax-un 7770 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-ral 3068 df-rex 3077 df-rmo 3388 df-reu 3389 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-iun 5017 df-iin 5018 df-br 5167 df-opab 5229 df-mpt 5250 df-id 5593 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-iota 6525 df-fun 6575 df-fn 6576 df-f 6577 df-f1 6578 df-fo 6579 df-f1o 6580 df-fv 6581 df-riota 7404 df-ov 7451 df-oprab 7452 df-mpo 7453 df-1st 8030 df-2nd 8031 df-proset 18365 df-poset 18383 df-plt 18400 df-lub 18416 df-glb 18417 df-join 18418 df-meet 18419 df-p0 18495 df-p1 18496 df-lat 18502 df-clat 18569 df-oposet 39132 df-ol 39134 df-oml 39135 df-covers 39222 df-ats 39223 df-atl 39254 df-cvlat 39278 df-hlat 39307 df-psubsp 39460 df-pmap 39461 df-padd 39753 df-polarityN 39860 |
This theorem is referenced by: pexmidlem6N 39932 |
Copyright terms: Public domain | W3C validator |