poml6N - Mathbox for Norm Megill

	Mathbox for Norm Megill		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > poml6N		Structured version Visualization version GIF version

Theorem poml6N 40127

Description: Orthomodular law for projective lattices. (Contributed by NM, 25-Mar-2012.) (New usage is discouraged.)

**Hypotheses**
Ref	Expression
poml6.c	⊢ 𝐶 = (PSubCl‘𝐾)
poml6.p	⊢ ⊥ = (⊥_𝑃‘𝐾)

**Assertion**
Ref	Expression
poml6N	⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐶 ∧ 𝑌 ∈ 𝐶) ∧ 𝑋 ⊆ 𝑌) → (( ⊥ ‘(( ⊥ ‘𝑋) ∩ 𝑌)) ∩ 𝑌) = 𝑋)

**Proof of Theorem poml6N**
Step	Hyp	Ref	Expression
1		simpl1 1192	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐶 ∧ 𝑌 ∈ 𝐶) ∧ 𝑋 ⊆ 𝑌) → 𝐾 ∈ HL)
2		simpl2 1193	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐶 ∧ 𝑌 ∈ 𝐶) ∧ 𝑋 ⊆ 𝑌) → 𝑋 ∈ 𝐶)
3		eqid 2733	. . . . 5 ⊢ (Atoms‘𝐾) = (Atoms‘𝐾)
4		poml6.c	. . . . 5 ⊢ 𝐶 = (PSubCl‘𝐾)
5	3, 4	psubclssatN 40113	. . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐶) → 𝑋 ⊆ (Atoms‘𝐾))
6	1, 2, 5	syl2anc 584	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐶 ∧ 𝑌 ∈ 𝐶) ∧ 𝑋 ⊆ 𝑌) → 𝑋 ⊆ (Atoms‘𝐾))
7		simpl3 1194	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐶 ∧ 𝑌 ∈ 𝐶) ∧ 𝑋 ⊆ 𝑌) → 𝑌 ∈ 𝐶)
8	3, 4	psubclssatN 40113	. . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ∈ 𝐶) → 𝑌 ⊆ (Atoms‘𝐾))
9	1, 7, 8	syl2anc 584	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐶 ∧ 𝑌 ∈ 𝐶) ∧ 𝑋 ⊆ 𝑌) → 𝑌 ⊆ (Atoms‘𝐾))
10		simpr 484	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐶 ∧ 𝑌 ∈ 𝐶) ∧ 𝑋 ⊆ 𝑌) → 𝑋 ⊆ 𝑌)
11		poml6.p	. . . . 5 ⊢ ⊥ = (⊥_𝑃‘𝐾)
12	11, 4	psubcli2N 40111	. . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ∈ 𝐶) → ( ⊥ ‘( ⊥ ‘𝑌)) = 𝑌)
13	1, 7, 12	syl2anc 584	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐶 ∧ 𝑌 ∈ 𝐶) ∧ 𝑋 ⊆ 𝑌) → ( ⊥ ‘( ⊥ ‘𝑌)) = 𝑌)
14	3, 11	poml4N 40125	. . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ (Atoms‘𝐾) ∧ 𝑌 ⊆ (Atoms‘𝐾)) → ((𝑋 ⊆ 𝑌 ∧ ( ⊥ ‘( ⊥ ‘𝑌)) = 𝑌) → (( ⊥ ‘(( ⊥ ‘𝑋) ∩ 𝑌)) ∩ 𝑌) = ( ⊥ ‘( ⊥ ‘𝑋))))
15	14	imp 406	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ⊆ (Atoms‘𝐾) ∧ 𝑌 ⊆ (Atoms‘𝐾)) ∧ (𝑋 ⊆ 𝑌 ∧ ( ⊥ ‘( ⊥ ‘𝑌)) = 𝑌)) → (( ⊥ ‘(( ⊥ ‘𝑋) ∩ 𝑌)) ∩ 𝑌) = ( ⊥ ‘( ⊥ ‘𝑋)))
16	1, 6, 9, 10, 13, 15	syl32anc 1380	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐶 ∧ 𝑌 ∈ 𝐶) ∧ 𝑋 ⊆ 𝑌) → (( ⊥ ‘(( ⊥ ‘𝑋) ∩ 𝑌)) ∩ 𝑌) = ( ⊥ ‘( ⊥ ‘𝑋)))
17	11, 4	psubcli2N 40111	. . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐶) → ( ⊥ ‘( ⊥ ‘𝑋)) = 𝑋)
18	1, 2, 17	syl2anc 584	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐶 ∧ 𝑌 ∈ 𝐶) ∧ 𝑋 ⊆ 𝑌) → ( ⊥ ‘( ⊥ ‘𝑋)) = 𝑋)
19	16, 18	eqtrd 2768	1 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐶 ∧ 𝑌 ∈ 𝐶) ∧ 𝑋 ⊆ 𝑌) → (( ⊥ ‘(( ⊥ ‘𝑋) ∩ 𝑌)) ∩ 𝑌) = 𝑋)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1541 ∈ wcel 2113 ∩ cin 3897 ⊆ wss 3898 ‘cfv 6489 Atomscatm 39435 HLchlt 39522 ⊥_𝑃cpolN 40074 PSubClcpscN 40106

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2705 ax-rep 5221 ax-sep 5238 ax-nul 5248 ax-pow 5307 ax-pr 5374 ax-un 7677

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2566 df-clab 2712 df-cleq 2725 df-clel 2808 df-nfc 2882 df-ne 2930 df-ral 3049 df-rex 3058 df-rmo 3347 df-reu 3348 df-rab 3397 df-v 3439 df-sbc 3738 df-csb 3847 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-nul 4283 df-if 4477 df-pw 4553 df-sn 4578 df-pr 4580 df-op 4584 df-uni 4861 df-iun 4945 df-iin 4946 df-br 5096 df-opab 5158 df-mpt 5177 df-id 5516 df-xp 5627 df-rel 5628 df-cnv 5629 df-co 5630 df-dm 5631 df-rn 5632 df-res 5633 df-ima 5634 df-iota 6445 df-fun 6491 df-fn 6492 df-f 6493 df-f1 6494 df-fo 6495 df-f1o 6496 df-fv 6497 df-riota 7312 df-ov 7358 df-oprab 7359 df-proset 18208 df-poset 18227 df-plt 18242 df-lub 18258 df-glb 18259 df-join 18260 df-meet 18261 df-p0 18337 df-p1 18338 df-lat 18346 df-clat 18413 df-oposet 39348 df-ol 39350 df-oml 39351 df-covers 39438 df-ats 39439 df-atl 39470 df-cvlat 39494 df-hlat 39523 df-pmap 39676 df-polarityN 40075 df-psubclN 40107

This theorem is referenced by: osumcllem9N 40136

W3C validator