Theorem glbprop 18420

Description: Properties of greatest lower bound of a poset. (Contributed by NM, 7-Sep-2018.)

Hypotheses

Ref	Expression
glbprop.b	⊢ 𝐵 = (Base‘𝐾)
glbprop.l	⊢ ≤ = (le‘𝐾)
glbprop.u	⊢ 𝑈 = (glb‘𝐾)
glbprop.k	⊢ (𝜑 → 𝐾 ∈ 𝑉)
glbprop.s	⊢ (𝜑 → 𝑆 ∈ dom 𝑈)

Assertion

Ref	Expression
glbprop	⊢ (𝜑 → (∀𝑦 ∈ 𝑆 (𝑈‘𝑆) ≤ 𝑦 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑆 𝑧 ≤ 𝑦 → 𝑧 ≤ (𝑈‘𝑆))))

Distinct variable groups:   𝑧,𝐵   𝑦,𝑧,𝐾   𝑦,𝑆,𝑧   𝑦, ≤   𝑦,𝑈,𝑧

Allowed substitution hints:   𝜑(𝑦,𝑧)   𝐵(𝑦)   ≤ (𝑧)   𝑉(𝑦,𝑧)

Proof of Theorem glbprop

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		glbprop.b	. . . 4 ⊢ 𝐵 = (Base‘𝐾)
2		glbprop.l	. . . 4 ⊢ ≤ = (le‘𝐾)
3		glbprop.u	. . . 4 ⊢ 𝑈 = (glb‘𝐾)
4		biid 264	. . . 4 ⊢ ((∀𝑦 ∈ 𝑆 𝑥 ≤ 𝑦 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑆 𝑧 ≤ 𝑦 → 𝑧 ≤ 𝑥)) ↔ (∀𝑦 ∈ 𝑆 𝑥 ≤ 𝑦 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑆 𝑧 ≤ 𝑦 → 𝑧 ≤ 𝑥)))
5		glbprop.k	. . . 4 ⊢ (𝜑 → 𝐾 ∈ 𝑉)
6		glbprop.s	. . . . 5 ⊢ (𝜑 → 𝑆 ∈ dom 𝑈)
7	1, 2, 3, 5, 6	glbelss 18416	. . . 4 ⊢ (𝜑 → 𝑆 ⊆ 𝐵)
8	1, 2, 3, 4, 5, 7	glbval 18418	. . 3 ⊢ (𝜑 → (𝑈‘𝑆) = (℩𝑥 ∈ 𝐵 (∀𝑦 ∈ 𝑆 𝑥 ≤ 𝑦 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑆 𝑧 ≤ 𝑦 → 𝑧 ≤ 𝑥))))
9	8	eqcomd 2769	. 2 ⊢ (𝜑 → (℩𝑥 ∈ 𝐵 (∀𝑦 ∈ 𝑆 𝑥 ≤ 𝑦 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑆 𝑧 ≤ 𝑦 → 𝑧 ≤ 𝑥))) = (𝑈‘𝑆))
10	1, 3, 5, 6	glbcl 18419	. . 3 ⊢ (𝜑 → (𝑈‘𝑆) ∈ 𝐵)
11	1, 2, 3, 4, 5, 6	glbeu 18417	. . 3 ⊢ (𝜑 → ∃!𝑥 ∈ 𝐵 (∀𝑦 ∈ 𝑆 𝑥 ≤ 𝑦 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑆 𝑧 ≤ 𝑦 → 𝑧 ≤ 𝑥)))
12		breq1 5112	. . . . . 6 ⊢ (𝑥 = (𝑈‘𝑆) → (𝑥 ≤ 𝑦 ↔ (𝑈‘𝑆) ≤ 𝑦))
13	12	ralbidv 3188	. . . . 5 ⊢ (𝑥 = (𝑈‘𝑆) → (∀𝑦 ∈ 𝑆 𝑥 ≤ 𝑦 ↔ ∀𝑦 ∈ 𝑆 (𝑈‘𝑆) ≤ 𝑦))
14		breq2 5113	. . . . . . 7 ⊢ (𝑥 = (𝑈‘𝑆) → (𝑧 ≤ 𝑥 ↔ 𝑧 ≤ (𝑈‘𝑆)))
15	14	imbi2d 343	. . . . . 6 ⊢ (𝑥 = (𝑈‘𝑆) → ((∀𝑦 ∈ 𝑆 𝑧 ≤ 𝑦 → 𝑧 ≤ 𝑥) ↔ (∀𝑦 ∈ 𝑆 𝑧 ≤ 𝑦 → 𝑧 ≤ (𝑈‘𝑆))))
16	15	ralbidv 3188	. . . . 5 ⊢ (𝑥 = (𝑈‘𝑆) → (∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑆 𝑧 ≤ 𝑦 → 𝑧 ≤ 𝑥) ↔ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑆 𝑧 ≤ 𝑦 → 𝑧 ≤ (𝑈‘𝑆))))
17	13, 16	anbi12d 643	. . . 4 ⊢ (𝑥 = (𝑈‘𝑆) → ((∀𝑦 ∈ 𝑆 𝑥 ≤ 𝑦 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑆 𝑧 ≤ 𝑦 → 𝑧 ≤ 𝑥)) ↔ (∀𝑦 ∈ 𝑆 (𝑈‘𝑆) ≤ 𝑦 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑆 𝑧 ≤ 𝑦 → 𝑧 ≤ (𝑈‘𝑆)))))
18	17	riota2 7392	. . 3 ⊢ (((𝑈‘𝑆) ∈ 𝐵 ∧ ∃!𝑥 ∈ 𝐵 (∀𝑦 ∈ 𝑆 𝑥 ≤ 𝑦 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑆 𝑧 ≤ 𝑦 → 𝑧 ≤ 𝑥))) → ((∀𝑦 ∈ 𝑆 (𝑈‘𝑆) ≤ 𝑦 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑆 𝑧 ≤ 𝑦 → 𝑧 ≤ (𝑈‘𝑆))) ↔ (℩𝑥 ∈ 𝐵 (∀𝑦 ∈ 𝑆 𝑥 ≤ 𝑦 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑆 𝑧 ≤ 𝑦 → 𝑧 ≤ 𝑥))) = (𝑈‘𝑆)))
19	10, 11, 18	syl2anc 595	. 2 ⊢ (𝜑 → ((∀𝑦 ∈ 𝑆 (𝑈‘𝑆) ≤ 𝑦 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑆 𝑧 ≤ 𝑦 → 𝑧 ≤ (𝑈‘𝑆))) ↔ (℩𝑥 ∈ 𝐵 (∀𝑦 ∈ 𝑆 𝑥 ≤ 𝑦 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑆 𝑧 ≤ 𝑦 → 𝑧 ≤ 𝑥))) = (𝑈‘𝑆)))
20	9, 19	mpbird 260	1 ⊢ (𝜑 → (∀𝑦 ∈ 𝑆 (𝑈‘𝑆) ≤ 𝑦 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑆 𝑧 ≤ 𝑦 → 𝑧 ≤ (𝑈‘𝑆))))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 400   = wceq 1570   ∈ wcel 2143  ∀wral 3079  ∃!wreu 3367   class class class wbr 5109  dom cdm 5661  ‘cfv 6536  ℩crio 7366  Basecbs 17264  lecple 17312  glbcglb 18361

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5238  ax-sep 5257  ax-nul 5269  ax-pow 5336  ax-pr 5404

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-iun 4958  df-br 5110  df-opab 5174  df-mpt 5193  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-riota 7367  df-glb 18396

This theorem is referenced by:  glble  18421  clatglb  18567