atlatmstc - Mathbox for Norm Megill

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

Theorem atlatmstc 38275

Description: An atomic, complete, orthomodular lattice is atomistic i.e. every element is the join of the atoms under it. See remark before Proposition 1 in [Kalmbach] p. 140; also remark in [BeltramettiCassinelli] p. 98. (hatomistici 31653 analog.) (Contributed by NM, 5-Nov-2012.)

**Hypotheses**
Ref	Expression
atlatmstc.b	⊢ 𝐵 = (Base‘𝐾)
atlatmstc.l	⊢ ≤ = (le‘𝐾)
atlatmstc.u	⊢ 1 = (lub‘𝐾)
atlatmstc.a	⊢ 𝐴 = (Atoms‘𝐾)

**Assertion**
Ref	Expression
atlatmstc	⊢ (((𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ AtLat) ∧ 𝑋 ∈ 𝐵) → ( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋}) = 𝑋)

Distinct variable groups: 𝑦, ≤ 𝑦,𝐴 𝑦,𝐵 𝑦,𝑋 Allowed substitution hints: 1 (𝑦) 𝐾(𝑦)

Proof of Theorem atlatmstc Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpl2 1192	. . . 4 ⊢ (((𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ AtLat) ∧ 𝑋 ∈ 𝐵) → 𝐾 ∈ CLat)
2		ssrab2 4077	. . . . 5 ⊢ {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑋} ⊆ 𝐵
3		atlatmstc.b	. . . . . . 7 ⊢ 𝐵 = (Base‘𝐾)
4		atlatmstc.a	. . . . . . 7 ⊢ 𝐴 = (Atoms‘𝐾)
5	3, 4	atssbase 38246	. . . . . 6 ⊢ 𝐴 ⊆ 𝐵
6		rabss2 4075	. . . . . 6 ⊢ (𝐴 ⊆ 𝐵 → {𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋} ⊆ {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑋})
7	5, 6	ax-mp 5	. . . . 5 ⊢ {𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋} ⊆ {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑋}
8		atlatmstc.l	. . . . . 6 ⊢ ≤ = (le‘𝐾)
9		atlatmstc.u	. . . . . 6 ⊢ 1 = (lub‘𝐾)
10	3, 8, 9	lubss 18468	. . . . 5 ⊢ ((𝐾 ∈ CLat ∧ {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑋} ⊆ 𝐵 ∧ {𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋} ⊆ {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑋}) → ( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋}) ≤ ( 1 ‘{𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑋}))
11	2, 7, 10	mp3an23 1453	. . . 4 ⊢ (𝐾 ∈ CLat → ( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋}) ≤ ( 1 ‘{𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑋}))
12	1, 11	syl 17	. . 3 ⊢ (((𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ AtLat) ∧ 𝑋 ∈ 𝐵) → ( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋}) ≤ ( 1 ‘{𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑋}))
13		atlpos 38257	. . . . 5 ⊢ (𝐾 ∈ AtLat → 𝐾 ∈ Poset)
14	13	3ad2ant3 1135	. . . 4 ⊢ ((𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ AtLat) → 𝐾 ∈ Poset)
15		simpl 483	. . . . 5 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵) → 𝐾 ∈ Poset)
16		simpr 485	. . . . 5 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵) → 𝑋 ∈ 𝐵)
17	3, 8, 9, 15, 16	lubid 18317	. . . 4 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵) → ( 1 ‘{𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑋}) = 𝑋)
18	14, 17	sylan 580	. . 3 ⊢ (((𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ AtLat) ∧ 𝑋 ∈ 𝐵) → ( 1 ‘{𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑋}) = 𝑋)
19	12, 18	breqtrd 5174	. 2 ⊢ (((𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ AtLat) ∧ 𝑋 ∈ 𝐵) → ( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋}) ≤ 𝑋)
20		breq1 5151	. . . . . . . . . 10 ⊢ (𝑦 = 𝑥 → (𝑦 ≤ 𝑋 ↔ 𝑥 ≤ 𝑋))
21	20	elrab 3683	. . . . . . . . 9 ⊢ (𝑥 ∈ {𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋} ↔ (𝑥 ∈ 𝐴 ∧ 𝑥 ≤ 𝑋))
22		simpll2 1213	. . . . . . . . . . 11 ⊢ ((((𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ AtLat) ∧ 𝑋 ∈ 𝐵) ∧ 𝑥 ∈ {𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋}) → 𝐾 ∈ CLat)
23		ssrab2 4077	. . . . . . . . . . . . 13 ⊢ {𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋} ⊆ 𝐴
24	23, 5	sstri 3991	. . . . . . . . . . . 12 ⊢ {𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋} ⊆ 𝐵
25	3, 8, 9	lubel 18469	. . . . . . . . . . . 12 ⊢ ((𝐾 ∈ CLat ∧ 𝑥 ∈ {𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋} ∧ {𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋} ⊆ 𝐵) → 𝑥 ≤ ( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋}))
26	24, 25	mp3an3 1450	. . . . . . . . . . 11 ⊢ ((𝐾 ∈ CLat ∧ 𝑥 ∈ {𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋}) → 𝑥 ≤ ( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋}))
27	22, 26	sylancom 588	. . . . . . . . . 10 ⊢ ((((𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ AtLat) ∧ 𝑋 ∈ 𝐵) ∧ 𝑥 ∈ {𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋}) → 𝑥 ≤ ( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋}))
28	27	ex 413	. . . . . . . . 9 ⊢ (((𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ AtLat) ∧ 𝑋 ∈ 𝐵) → (𝑥 ∈ {𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋} → 𝑥 ≤ ( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋})))
29	21, 28	biimtrrid 242	. . . . . . . 8 ⊢ (((𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ AtLat) ∧ 𝑋 ∈ 𝐵) → ((𝑥 ∈ 𝐴 ∧ 𝑥 ≤ 𝑋) → 𝑥 ≤ ( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋})))
30	29	expdimp 453	. . . . . . 7 ⊢ ((((𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ AtLat) ∧ 𝑋 ∈ 𝐵) ∧ 𝑥 ∈ 𝐴) → (𝑥 ≤ 𝑋 → 𝑥 ≤ ( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋})))
31		simpll3 1214	. . . . . . . . . . 11 ⊢ ((((𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ AtLat) ∧ 𝑋 ∈ 𝐵) ∧ 𝑥 ∈ 𝐴) → 𝐾 ∈ AtLat)
32		eqid 2732	. . . . . . . . . . . 12 ⊢ (0.‘𝐾) = (0.‘𝐾)
33	32, 4	atn0 38264	. . . . . . . . . . 11 ⊢ ((𝐾 ∈ AtLat ∧ 𝑥 ∈ 𝐴) → 𝑥 ≠ (0.‘𝐾))
34	31, 33	sylancom 588	. . . . . . . . . 10 ⊢ ((((𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ AtLat) ∧ 𝑋 ∈ 𝐵) ∧ 𝑥 ∈ 𝐴) → 𝑥 ≠ (0.‘𝐾))
35	34	adantr 481	. . . . . . . . 9 ⊢ (((((𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ AtLat) ∧ 𝑋 ∈ 𝐵) ∧ 𝑥 ∈ 𝐴) ∧ 𝑥 ≤ ( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋})) → 𝑥 ≠ (0.‘𝐾))
36		simpl3 1193	. . . . . . . . . . . . . . . 16 ⊢ (((𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ AtLat) ∧ 𝑋 ∈ 𝐵) → 𝐾 ∈ AtLat)
37		atllat 38256	. . . . . . . . . . . . . . . 16 ⊢ (𝐾 ∈ AtLat → 𝐾 ∈ Lat)
38	36, 37	syl 17	. . . . . . . . . . . . . . 15 ⊢ (((𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ AtLat) ∧ 𝑋 ∈ 𝐵) → 𝐾 ∈ Lat)
39	38	adantr 481	. . . . . . . . . . . . . 14 ⊢ ((((𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ AtLat) ∧ 𝑋 ∈ 𝐵) ∧ 𝑥 ∈ 𝐴) → 𝐾 ∈ Lat)
40	3, 4	atbase 38245	. . . . . . . . . . . . . . 15 ⊢ (𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐵)
41	40	adantl 482	. . . . . . . . . . . . . 14 ⊢ ((((𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ AtLat) ∧ 𝑋 ∈ 𝐵) ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝐵)
42	3, 9	clatlubcl 18458	. . . . . . . . . . . . . . . 16 ⊢ ((𝐾 ∈ CLat ∧ {𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋} ⊆ 𝐵) → ( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋}) ∈ 𝐵)
43	1, 24, 42	sylancl 586	. . . . . . . . . . . . . . 15 ⊢ (((𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ AtLat) ∧ 𝑋 ∈ 𝐵) → ( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋}) ∈ 𝐵)
44	43	adantr 481	. . . . . . . . . . . . . 14 ⊢ ((((𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ AtLat) ∧ 𝑋 ∈ 𝐵) ∧ 𝑥 ∈ 𝐴) → ( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋}) ∈ 𝐵)
45		simpl1 1191	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ AtLat) ∧ 𝑋 ∈ 𝐵) → 𝐾 ∈ OML)
46		omlop 38197	. . . . . . . . . . . . . . . . 17 ⊢ (𝐾 ∈ OML → 𝐾 ∈ OP)
47	45, 46	syl 17	. . . . . . . . . . . . . . . 16 ⊢ (((𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ AtLat) ∧ 𝑋 ∈ 𝐵) → 𝐾 ∈ OP)
48		eqid 2732	. . . . . . . . . . . . . . . . 17 ⊢ (oc‘𝐾) = (oc‘𝐾)
49	3, 48	opoccl 38150	. . . . . . . . . . . . . . . 16 ⊢ ((𝐾 ∈ OP ∧ ( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋}) ∈ 𝐵) → ((oc‘𝐾)‘( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋})) ∈ 𝐵)
50	47, 43, 49	syl2anc 584	. . . . . . . . . . . . . . 15 ⊢ (((𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ AtLat) ∧ 𝑋 ∈ 𝐵) → ((oc‘𝐾)‘( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋})) ∈ 𝐵)
51	50	adantr 481	. . . . . . . . . . . . . 14 ⊢ ((((𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ AtLat) ∧ 𝑋 ∈ 𝐵) ∧ 𝑥 ∈ 𝐴) → ((oc‘𝐾)‘( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋})) ∈ 𝐵)
52		eqid 2732	. . . . . . . . . . . . . . 15 ⊢ (meet‘𝐾) = (meet‘𝐾)
53	3, 8, 52	latlem12 18421	. . . . . . . . . . . . . 14 ⊢ ((𝐾 ∈ Lat ∧ (𝑥 ∈ 𝐵 ∧ ( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋}) ∈ 𝐵 ∧ ((oc‘𝐾)‘( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋})) ∈ 𝐵)) → ((𝑥 ≤ ( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋}) ∧ 𝑥 ≤ ((oc‘𝐾)‘( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋}))) ↔ 𝑥 ≤ (( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋})(meet‘𝐾)((oc‘𝐾)‘( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋})))))
54	39, 41, 44, 51, 53	syl13anc 1372	. . . . . . . . . . . . 13 ⊢ ((((𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ AtLat) ∧ 𝑋 ∈ 𝐵) ∧ 𝑥 ∈ 𝐴) → ((𝑥 ≤ ( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋}) ∧ 𝑥 ≤ ((oc‘𝐾)‘( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋}))) ↔ 𝑥 ≤ (( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋})(meet‘𝐾)((oc‘𝐾)‘( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋})))))
55	3, 48, 52, 32	opnoncon 38164	. . . . . . . . . . . . . . . 16 ⊢ ((𝐾 ∈ OP ∧ ( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋}) ∈ 𝐵) → (( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋})(meet‘𝐾)((oc‘𝐾)‘( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋}))) = (0.‘𝐾))
56	47, 43, 55	syl2anc 584	. . . . . . . . . . . . . . 15 ⊢ (((𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ AtLat) ∧ 𝑋 ∈ 𝐵) → (( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋})(meet‘𝐾)((oc‘𝐾)‘( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋}))) = (0.‘𝐾))
57	56	breq2d 5160	. . . . . . . . . . . . . 14 ⊢ (((𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ AtLat) ∧ 𝑋 ∈ 𝐵) → (𝑥 ≤ (( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋})(meet‘𝐾)((oc‘𝐾)‘( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋}))) ↔ 𝑥 ≤ (0.‘𝐾)))
58	57	adantr 481	. . . . . . . . . . . . 13 ⊢ ((((𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ AtLat) ∧ 𝑋 ∈ 𝐵) ∧ 𝑥 ∈ 𝐴) → (𝑥 ≤ (( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋})(meet‘𝐾)((oc‘𝐾)‘( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋}))) ↔ 𝑥 ≤ (0.‘𝐾)))
59	3, 8, 32	ople0 38143	. . . . . . . . . . . . . 14 ⊢ ((𝐾 ∈ OP ∧ 𝑥 ∈ 𝐵) → (𝑥 ≤ (0.‘𝐾) ↔ 𝑥 = (0.‘𝐾)))
60	47, 40, 59	syl2an 596	. . . . . . . . . . . . 13 ⊢ ((((𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ AtLat) ∧ 𝑋 ∈ 𝐵) ∧ 𝑥 ∈ 𝐴) → (𝑥 ≤ (0.‘𝐾) ↔ 𝑥 = (0.‘𝐾)))
61	54, 58, 60	3bitrd 304	. . . . . . . . . . . 12 ⊢ ((((𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ AtLat) ∧ 𝑋 ∈ 𝐵) ∧ 𝑥 ∈ 𝐴) → ((𝑥 ≤ ( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋}) ∧ 𝑥 ≤ ((oc‘𝐾)‘( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋}))) ↔ 𝑥 = (0.‘𝐾)))
62	61	biimpa 477	. . . . . . . . . . 11 ⊢ (((((𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ AtLat) ∧ 𝑋 ∈ 𝐵) ∧ 𝑥 ∈ 𝐴) ∧ (𝑥 ≤ ( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋}) ∧ 𝑥 ≤ ((oc‘𝐾)‘( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋})))) → 𝑥 = (0.‘𝐾))
63	62	expr 457	. . . . . . . . . 10 ⊢ (((((𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ AtLat) ∧ 𝑋 ∈ 𝐵) ∧ 𝑥 ∈ 𝐴) ∧ 𝑥 ≤ ( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋})) → (𝑥 ≤ ((oc‘𝐾)‘( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋})) → 𝑥 = (0.‘𝐾)))
64	63	necon3ad 2953	. . . . . . . . 9 ⊢ (((((𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ AtLat) ∧ 𝑋 ∈ 𝐵) ∧ 𝑥 ∈ 𝐴) ∧ 𝑥 ≤ ( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋})) → (𝑥 ≠ (0.‘𝐾) → ¬ 𝑥 ≤ ((oc‘𝐾)‘( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋}))))
65	35, 64	mpd 15	. . . . . . . 8 ⊢ (((((𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ AtLat) ∧ 𝑋 ∈ 𝐵) ∧ 𝑥 ∈ 𝐴) ∧ 𝑥 ≤ ( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋})) → ¬ 𝑥 ≤ ((oc‘𝐾)‘( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋})))
66	65	ex 413	. . . . . . 7 ⊢ ((((𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ AtLat) ∧ 𝑋 ∈ 𝐵) ∧ 𝑥 ∈ 𝐴) → (𝑥 ≤ ( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋}) → ¬ 𝑥 ≤ ((oc‘𝐾)‘( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋}))))
67	30, 66	syld 47	. . . . . 6 ⊢ ((((𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ AtLat) ∧ 𝑋 ∈ 𝐵) ∧ 𝑥 ∈ 𝐴) → (𝑥 ≤ 𝑋 → ¬ 𝑥 ≤ ((oc‘𝐾)‘( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋}))))
68		imnan 400	. . . . . 6 ⊢ ((𝑥 ≤ 𝑋 → ¬ 𝑥 ≤ ((oc‘𝐾)‘( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋}))) ↔ ¬ (𝑥 ≤ 𝑋 ∧ 𝑥 ≤ ((oc‘𝐾)‘( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋}))))
69	67, 68	sylib 217	. . . . 5 ⊢ ((((𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ AtLat) ∧ 𝑋 ∈ 𝐵) ∧ 𝑥 ∈ 𝐴) → ¬ (𝑥 ≤ 𝑋 ∧ 𝑥 ≤ ((oc‘𝐾)‘( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋}))))
70		simplr 767	. . . . . 6 ⊢ ((((𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ AtLat) ∧ 𝑋 ∈ 𝐵) ∧ 𝑥 ∈ 𝐴) → 𝑋 ∈ 𝐵)
71	3, 8, 52	latlem12 18421	. . . . . 6 ⊢ ((𝐾 ∈ Lat ∧ (𝑥 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵 ∧ ((oc‘𝐾)‘( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋})) ∈ 𝐵)) → ((𝑥 ≤ 𝑋 ∧ 𝑥 ≤ ((oc‘𝐾)‘( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋}))) ↔ 𝑥 ≤ (𝑋(meet‘𝐾)((oc‘𝐾)‘( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋})))))
72	39, 41, 70, 51, 71	syl13anc 1372	. . . . 5 ⊢ ((((𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ AtLat) ∧ 𝑋 ∈ 𝐵) ∧ 𝑥 ∈ 𝐴) → ((𝑥 ≤ 𝑋 ∧ 𝑥 ≤ ((oc‘𝐾)‘( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋}))) ↔ 𝑥 ≤ (𝑋(meet‘𝐾)((oc‘𝐾)‘( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋})))))
73	69, 72	mtbid 323	. . . 4 ⊢ ((((𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ AtLat) ∧ 𝑋 ∈ 𝐵) ∧ 𝑥 ∈ 𝐴) → ¬ 𝑥 ≤ (𝑋(meet‘𝐾)((oc‘𝐾)‘( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋}))))
74	73	nrexdv 3149	. . 3 ⊢ (((𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ AtLat) ∧ 𝑋 ∈ 𝐵) → ¬ ∃𝑥 ∈ 𝐴 𝑥 ≤ (𝑋(meet‘𝐾)((oc‘𝐾)‘( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋}))))
75		simpll3 1214	. . . . . 6 ⊢ ((((𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ AtLat) ∧ 𝑋 ∈ 𝐵) ∧ (𝑋(meet‘𝐾)((oc‘𝐾)‘( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋}))) ≠ (0.‘𝐾)) → 𝐾 ∈ AtLat)
76		simpr 485	. . . . . . . 8 ⊢ (((𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ AtLat) ∧ 𝑋 ∈ 𝐵) → 𝑋 ∈ 𝐵)
77	3, 52	latmcl 18395	. . . . . . . 8 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ ((oc‘𝐾)‘( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋})) ∈ 𝐵) → (𝑋(meet‘𝐾)((oc‘𝐾)‘( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋}))) ∈ 𝐵)
78	38, 76, 50, 77	syl3anc 1371	. . . . . . 7 ⊢ (((𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ AtLat) ∧ 𝑋 ∈ 𝐵) → (𝑋(meet‘𝐾)((oc‘𝐾)‘( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋}))) ∈ 𝐵)
79	78	adantr 481	. . . . . 6 ⊢ ((((𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ AtLat) ∧ 𝑋 ∈ 𝐵) ∧ (𝑋(meet‘𝐾)((oc‘𝐾)‘( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋}))) ≠ (0.‘𝐾)) → (𝑋(meet‘𝐾)((oc‘𝐾)‘( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋}))) ∈ 𝐵)
80		simpr 485	. . . . . 6 ⊢ ((((𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ AtLat) ∧ 𝑋 ∈ 𝐵) ∧ (𝑋(meet‘𝐾)((oc‘𝐾)‘( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋}))) ≠ (0.‘𝐾)) → (𝑋(meet‘𝐾)((oc‘𝐾)‘( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋}))) ≠ (0.‘𝐾))
81	3, 8, 32, 4	atlex 38272	. . . . . 6 ⊢ ((𝐾 ∈ AtLat ∧ (𝑋(meet‘𝐾)((oc‘𝐾)‘( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋}))) ∈ 𝐵 ∧ (𝑋(meet‘𝐾)((oc‘𝐾)‘( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋}))) ≠ (0.‘𝐾)) → ∃𝑥 ∈ 𝐴 𝑥 ≤ (𝑋(meet‘𝐾)((oc‘𝐾)‘( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋}))))
82	75, 79, 80, 81	syl3anc 1371	. . . . 5 ⊢ ((((𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ AtLat) ∧ 𝑋 ∈ 𝐵) ∧ (𝑋(meet‘𝐾)((oc‘𝐾)‘( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋}))) ≠ (0.‘𝐾)) → ∃𝑥 ∈ 𝐴 𝑥 ≤ (𝑋(meet‘𝐾)((oc‘𝐾)‘( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋}))))
83	82	ex 413	. . . 4 ⊢ (((𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ AtLat) ∧ 𝑋 ∈ 𝐵) → ((𝑋(meet‘𝐾)((oc‘𝐾)‘( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋}))) ≠ (0.‘𝐾) → ∃𝑥 ∈ 𝐴 𝑥 ≤ (𝑋(meet‘𝐾)((oc‘𝐾)‘( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋})))))
84	83	necon1bd 2958	. . 3 ⊢ (((𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ AtLat) ∧ 𝑋 ∈ 𝐵) → (¬ ∃𝑥 ∈ 𝐴 𝑥 ≤ (𝑋(meet‘𝐾)((oc‘𝐾)‘( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋}))) → (𝑋(meet‘𝐾)((oc‘𝐾)‘( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋}))) = (0.‘𝐾)))
85	74, 84	mpd 15	. 2 ⊢ (((𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ AtLat) ∧ 𝑋 ∈ 𝐵) → (𝑋(meet‘𝐾)((oc‘𝐾)‘( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋}))) = (0.‘𝐾))
86	3, 8, 52, 48, 32	omllaw3 38201	. . 3 ⊢ ((𝐾 ∈ OML ∧ ( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋}) ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → ((( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋}) ≤ 𝑋 ∧ (𝑋(meet‘𝐾)((oc‘𝐾)‘( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋}))) = (0.‘𝐾)) → ( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋}) = 𝑋))
87	45, 43, 76, 86	syl3anc 1371	. 2 ⊢ (((𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ AtLat) ∧ 𝑋 ∈ 𝐵) → ((( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋}) ≤ 𝑋 ∧ (𝑋(meet‘𝐾)((oc‘𝐾)‘( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋}))) = (0.‘𝐾)) → ( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋}) = 𝑋))
88	19, 85, 87	mp2and 697	1 ⊢ (((𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ AtLat) ∧ 𝑋 ∈ 𝐵) → ( 1 ‘{𝑦 ∈ 𝐴 ∣ 𝑦 ≤ 𝑋}) = 𝑋)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 396 ∧ w3a 1087 = wceq 1541 ∈ wcel 2106 ≠ wne 2940 ∃wrex 3070 {crab 3432 ⊆ wss 3948 class class class wbr 5148 ‘cfv 6543 (class class class)co 7411 Basecbs 17146 lecple 17206 occoc 17207 Posetcpo 18262 lubclub 18264 meetcmee 18267 0.cp0 18378 Latclat 18386 CLatccla 18453 OPcops 38128 OMLcoml 38131 Atomscatm 38219 AtLatcal 38220

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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-rep 5285 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7727

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-ral 3062 df-rex 3071 df-rmo 3376 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-iun 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-id 5574 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7367 df-ov 7414 df-oprab 7415 df-proset 18250 df-poset 18268 df-plt 18285 df-lub 18301 df-glb 18302 df-join 18303 df-meet 18304 df-p0 18380 df-lat 18387 df-clat 18454 df-oposet 38132 df-ol 38134 df-oml 38135 df-covers 38222 df-ats 38223 df-atl 38254

This theorem is referenced by: atlatle 38276 hlatmstcOLDN 38354 pmaple 38718 pol1N 38867 polpmapN 38869 pmaplubN 38881

W3C validator