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 37109. (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 4313 | . . . 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 37113 | . . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (𝑋 ≠ ∅ ∧ 𝑞 ∈ (( ⊥ ‘𝑋) ∩ 𝑀))) → 𝑝 ∈ (𝑋 + ( ⊥ ‘𝑋))) |
9 | 8 | expr 459 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ 𝑋 ≠ ∅) → (𝑞 ∈ (( ⊥ ‘𝑋) ∩ 𝑀) → 𝑝 ∈ (𝑋 + ( ⊥ ‘𝑋)))) |
10 | 9 | exlimdv 1933 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ 𝑋 ≠ ∅) → (∃𝑞 𝑞 ∈ (( ⊥ ‘𝑋) ∩ 𝑀) → 𝑝 ∈ (𝑋 + ( ⊥ ‘𝑋)))) |
11 | 1, 10 | syl5bi 244 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ 𝑋 ≠ ∅) → ((( ⊥ ‘𝑋) ∩ 𝑀) ≠ ∅ → 𝑝 ∈ (𝑋 + ( ⊥ ‘𝑋)))) |
12 | 11 | necon1bd 3037 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ 𝑋 ≠ ∅) → (¬ 𝑝 ∈ (𝑋 + ( ⊥ ‘𝑋)) → (( ⊥ ‘𝑋) ∩ 𝑀) = ∅)) |
13 | 12 | impr 457 | 1 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑝 ∈ 𝐴) ∧ (𝑋 ≠ ∅ ∧ ¬ 𝑝 ∈ (𝑋 + ( ⊥ ‘𝑋)))) → (( ⊥ ‘𝑋) ∩ 𝑀) = ∅) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 398 ∧ w3a 1083 = wceq 1536 ∃wex 1779 ∈ wcel 2113 ≠ wne 3019 ∩ cin 3938 ⊆ wss 3939 ∅c0 4294 {csn 4570 ‘cfv 6358 (class class class)co 7159 lecple 16575 joincjn 17557 Atomscatm 36403 HLchlt 36490 +𝑃cpadd 36935 ⊥𝑃cpolN 37042 |
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 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2796 ax-rep 5193 ax-sep 5206 ax-nul 5213 ax-pow 5269 ax-pr 5333 ax-un 7464 ax-riotaBAD 36093 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-mo 2621 df-eu 2653 df-clab 2803 df-cleq 2817 df-clel 2896 df-nfc 2966 df-ne 3020 df-ral 3146 df-rex 3147 df-reu 3148 df-rmo 3149 df-rab 3150 df-v 3499 df-sbc 3776 df-csb 3887 df-dif 3942 df-un 3944 df-in 3946 df-ss 3955 df-nul 4295 df-if 4471 df-pw 4544 df-sn 4571 df-pr 4573 df-op 4577 df-uni 4842 df-iun 4924 df-iin 4925 df-br 5070 df-opab 5132 df-mpt 5150 df-id 5463 df-xp 5564 df-rel 5565 df-cnv 5566 df-co 5567 df-dm 5568 df-rn 5569 df-res 5570 df-ima 5571 df-iota 6317 df-fun 6360 df-fn 6361 df-f 6362 df-f1 6363 df-fo 6364 df-f1o 6365 df-fv 6366 df-riota 7117 df-ov 7162 df-oprab 7163 df-mpo 7164 df-1st 7692 df-2nd 7693 df-undef 7942 df-proset 17541 df-poset 17559 df-plt 17571 df-lub 17587 df-glb 17588 df-join 17589 df-meet 17590 df-p0 17652 df-p1 17653 df-lat 17659 df-clat 17721 df-oposet 36316 df-ol 36318 df-oml 36319 df-covers 36406 df-ats 36407 df-atl 36438 df-cvlat 36462 df-hlat 36491 df-psubsp 36643 df-pmap 36644 df-padd 36936 df-polarityN 37043 |
This theorem is referenced by: pexmidlem6N 37115 |
Copyright terms: Public domain | W3C validator |