Theorem glbprop 18370

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 260	. . . 4 ⊢ ((∀𝑦 ∈ 𝑆 𝑥 ≤ 𝑦 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑆 𝑧 ≤ 𝑦 → 𝑧 ≤ 𝑥)) ↔ (∀𝑦 ∈ 𝑆 𝑥 ≤ 𝑦 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑆 𝑧 ≤ 𝑦 → 𝑧 ≤ 𝑥)))
5		glbprop.k	. . . 4 ⊢ (𝜑 → 𝐾 ∈ 𝑉)
6		glbprop.s	. . . . 5 ⊢ (𝜑 → 𝑆 ∈ dom 𝑈)
7	1, 2, 3, 5, 6	glbelss 18366	. . . 4 ⊢ (𝜑 → 𝑆 ⊆ 𝐵)
8	1, 2, 3, 4, 5, 7	glbval 18368	. . 3 ⊢ (𝜑 → (𝑈‘𝑆) = (℩𝑥 ∈ 𝐵 (∀𝑦 ∈ 𝑆 𝑥 ≤ 𝑦 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑆 𝑧 ≤ 𝑦 → 𝑧 ≤ 𝑥))))
9	8	eqcomd 2734	. 2 ⊢ (𝜑 → (℩𝑥 ∈ 𝐵 (∀𝑦 ∈ 𝑆 𝑥 ≤ 𝑦 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑆 𝑧 ≤ 𝑦 → 𝑧 ≤ 𝑥))) = (𝑈‘𝑆))
10	1, 3, 5, 6	glbcl 18369	. . 3 ⊢ (𝜑 → (𝑈‘𝑆) ∈ 𝐵)
11	1, 2, 3, 4, 5, 6	glbeu 18367	. . 3 ⊢ (𝜑 → ∃!𝑥 ∈ 𝐵 (∀𝑦 ∈ 𝑆 𝑥 ≤ 𝑦 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑆 𝑧 ≤ 𝑦 → 𝑧 ≤ 𝑥)))
12		breq1 5155	. . . . . 6 ⊢ (𝑥 = (𝑈‘𝑆) → (𝑥 ≤ 𝑦 ↔ (𝑈‘𝑆) ≤ 𝑦))
13	12	ralbidv 3175	. . . . 5 ⊢ (𝑥 = (𝑈‘𝑆) → (∀𝑦 ∈ 𝑆 𝑥 ≤ 𝑦 ↔ ∀𝑦 ∈ 𝑆 (𝑈‘𝑆) ≤ 𝑦))
14		breq2 5156	. . . . . . 7 ⊢ (𝑥 = (𝑈‘𝑆) → (𝑧 ≤ 𝑥 ↔ 𝑧 ≤ (𝑈‘𝑆)))
15	14	imbi2d 339	. . . . . 6 ⊢ (𝑥 = (𝑈‘𝑆) → ((∀𝑦 ∈ 𝑆 𝑧 ≤ 𝑦 → 𝑧 ≤ 𝑥) ↔ (∀𝑦 ∈ 𝑆 𝑧 ≤ 𝑦 → 𝑧 ≤ (𝑈‘𝑆))))
16	15	ralbidv 3175	. . . . 5 ⊢ (𝑥 = (𝑈‘𝑆) → (∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑆 𝑧 ≤ 𝑦 → 𝑧 ≤ 𝑥) ↔ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑆 𝑧 ≤ 𝑦 → 𝑧 ≤ (𝑈‘𝑆))))
17	13, 16	anbi12d 630	. . . 4 ⊢ (𝑥 = (𝑈‘𝑆) → ((∀𝑦 ∈ 𝑆 𝑥 ≤ 𝑦 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑆 𝑧 ≤ 𝑦 → 𝑧 ≤ 𝑥)) ↔ (∀𝑦 ∈ 𝑆 (𝑈‘𝑆) ≤ 𝑦 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑆 𝑧 ≤ 𝑦 → 𝑧 ≤ (𝑈‘𝑆)))))
18	17	riota2 7408	. . 3 ⊢ (((𝑈‘𝑆) ∈ 𝐵 ∧ ∃!𝑥 ∈ 𝐵 (∀𝑦 ∈ 𝑆 𝑥 ≤ 𝑦 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑆 𝑧 ≤ 𝑦 → 𝑧 ≤ 𝑥))) → ((∀𝑦 ∈ 𝑆 (𝑈‘𝑆) ≤ 𝑦 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑆 𝑧 ≤ 𝑦 → 𝑧 ≤ (𝑈‘𝑆))) ↔ (℩𝑥 ∈ 𝐵 (∀𝑦 ∈ 𝑆 𝑥 ≤ 𝑦 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑆 𝑧 ≤ 𝑦 → 𝑧 ≤ 𝑥))) = (𝑈‘𝑆)))
19	10, 11, 18	syl2anc 582	. 2 ⊢ (𝜑 → ((∀𝑦 ∈ 𝑆 (𝑈‘𝑆) ≤ 𝑦 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑆 𝑧 ≤ 𝑦 → 𝑧 ≤ (𝑈‘𝑆))) ↔ (℩𝑥 ∈ 𝐵 (∀𝑦 ∈ 𝑆 𝑥 ≤ 𝑦 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑆 𝑧 ≤ 𝑦 → 𝑧 ≤ 𝑥))) = (𝑈‘𝑆)))
20	9, 19	mpbird 256	1 ⊢ (𝜑 → (∀𝑦 ∈ 𝑆 (𝑈‘𝑆) ≤ 𝑦 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑆 𝑧 ≤ 𝑦 → 𝑧 ≤ (𝑈‘𝑆))))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 394   = wceq 1533   ∈ wcel 2098  ∀wral 3058  ∃!wreu 3372   class class class wbr 5152  dom cdm 5682  ‘cfv 6553  ℩crio 7381  Basecbs 17187  lecple 17247  glbcglb 18309

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2166  ax-ext 2699  ax-rep 5289  ax-sep 5303  ax-nul 5310  ax-pow 5369  ax-pr 5433

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2529  df-eu 2558  df-clab 2706  df-cleq 2720  df-clel 2806  df-nfc 2881  df-ne 2938  df-ral 3059  df-rex 3068  df-rmo 3374  df-reu 3375  df-rab 3431  df-v 3475  df-sbc 3779  df-csb 3895  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-nul 4327  df-if 4533  df-pw 4608  df-sn 4633  df-pr 4635  df-op 4639  df-uni 4913  df-iun 5002  df-br 5153  df-opab 5215  df-mpt 5236  df-id 5580  df-xp 5688  df-rel 5689  df-cnv 5690  df-co 5691  df-dm 5692  df-rn 5693  df-res 5694  df-ima 5695  df-iota 6505  df-fun 6555  df-fn 6556  df-f 6557  df-f1 6558  df-fo 6559  df-f1o 6560  df-fv 6561  df-riota 7382  df-glb 18346

This theorem is referenced by:  glble  18371  clatglb  18515