Theorem lubval 18322

Description: Value of the least upper bound function of a poset. Out-of-domain arguments (those not satisfying 𝑆 ∈ dom 𝑈) are allowed for convenience, evaluating to the empty set. (Contributed by NM, 12-Sep-2011.) (Revised by NM, 9-Sep-2018.)

Hypotheses

Ref	Expression
lubval.b	⊢ 𝐵 = (Base‘𝐾)
lubval.l	⊢ ≤ = (le‘𝐾)
lubval.u	⊢ 𝑈 = (lub‘𝐾)
lubval.p	⊢ (𝜓 ↔ (∀𝑦 ∈ 𝑆 𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑆 𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧)))
lubval.k	⊢ (𝜑 → 𝐾 ∈ 𝑉)
lubval.s	⊢ (𝜑 → 𝑆 ⊆ 𝐵)

Assertion

Ref	Expression
lubval	⊢ (𝜑 → (𝑈‘𝑆) = (℩𝑥 ∈ 𝐵 𝜓))

Distinct variable groups:   𝑥,𝑧,𝐵   𝑥,𝑦,𝐾,𝑧   𝑥,𝑆,𝑦,𝑧

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

Proof of Theorem lubval

Dummy variable 𝑠 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		lubval.b	. . . . 5 ⊢ 𝐵 = (Base‘𝐾)
2		lubval.l	. . . . 5 ⊢ ≤ = (le‘𝐾)
3		lubval.u	. . . . 5 ⊢ 𝑈 = (lub‘𝐾)
4		biid 261	. . . . 5 ⊢ ((∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧)) ↔ (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧)))
5		lubval.k	. . . . . 6 ⊢ (𝜑 → 𝐾 ∈ 𝑉)
6	5	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ 𝑆 ∈ dom 𝑈) → 𝐾 ∈ 𝑉)
7	1, 2, 3, 4, 6	lubfval 18316	. . . 4 ⊢ ((𝜑 ∧ 𝑆 ∈ dom 𝑈) → 𝑈 = ((𝑠 ∈ 𝒫 𝐵 ↦ (℩𝑥 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧)))) ↾ {𝑠 ∣ ∃!𝑥 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧))}))
8	7	fveq1d 6863	. . 3 ⊢ ((𝜑 ∧ 𝑆 ∈ dom 𝑈) → (𝑈‘𝑆) = (((𝑠 ∈ 𝒫 𝐵 ↦ (℩𝑥 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧)))) ↾ {𝑠 ∣ ∃!𝑥 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧))})‘𝑆))
9		simpr 484	. . . . 5 ⊢ ((𝜑 ∧ 𝑆 ∈ dom 𝑈) → 𝑆 ∈ dom 𝑈)
10		lubval.p	. . . . . 6 ⊢ (𝜓 ↔ (∀𝑦 ∈ 𝑆 𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑆 𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧)))
11	1, 2, 3, 10, 6, 9	lubeu 18321	. . . . 5 ⊢ ((𝜑 ∧ 𝑆 ∈ dom 𝑈) → ∃!𝑥 ∈ 𝐵 𝜓)
12		raleq 3298	. . . . . . . 8 ⊢ (𝑠 = 𝑆 → (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑥 ↔ ∀𝑦 ∈ 𝑆 𝑦 ≤ 𝑥))
13		raleq 3298	. . . . . . . . . 10 ⊢ (𝑠 = 𝑆 → (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑧 ↔ ∀𝑦 ∈ 𝑆 𝑦 ≤ 𝑧))
14	13	imbi1d 341	. . . . . . . . 9 ⊢ (𝑠 = 𝑆 → ((∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧) ↔ (∀𝑦 ∈ 𝑆 𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧)))
15	14	ralbidv 3157	. . . . . . . 8 ⊢ (𝑠 = 𝑆 → (∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧) ↔ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑆 𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧)))
16	12, 15	anbi12d 632	. . . . . . 7 ⊢ (𝑠 = 𝑆 → ((∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧)) ↔ (∀𝑦 ∈ 𝑆 𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑆 𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧))))
17	16, 10	bitr4di 289	. . . . . 6 ⊢ (𝑠 = 𝑆 → ((∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧)) ↔ 𝜓))
18	17	reubidv 3374	. . . . 5 ⊢ (𝑠 = 𝑆 → (∃!𝑥 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧)) ↔ ∃!𝑥 ∈ 𝐵 𝜓))
19	9, 11, 18	elabd 3651	. . . 4 ⊢ ((𝜑 ∧ 𝑆 ∈ dom 𝑈) → 𝑆 ∈ {𝑠 ∣ ∃!𝑥 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧))})
20	19	fvresd 6881	. . 3 ⊢ ((𝜑 ∧ 𝑆 ∈ dom 𝑈) → (((𝑠 ∈ 𝒫 𝐵 ↦ (℩𝑥 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧)))) ↾ {𝑠 ∣ ∃!𝑥 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧))})‘𝑆) = ((𝑠 ∈ 𝒫 𝐵 ↦ (℩𝑥 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧))))‘𝑆))
21		lubval.s	. . . . . 6 ⊢ (𝜑 → 𝑆 ⊆ 𝐵)
22	21	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ 𝑆 ∈ dom 𝑈) → 𝑆 ⊆ 𝐵)
23	1	fvexi 6875	. . . . . 6 ⊢ 𝐵 ∈ V
24	23	elpw2 5292	. . . . 5 ⊢ (𝑆 ∈ 𝒫 𝐵 ↔ 𝑆 ⊆ 𝐵)
25	22, 24	sylibr 234	. . . 4 ⊢ ((𝜑 ∧ 𝑆 ∈ dom 𝑈) → 𝑆 ∈ 𝒫 𝐵)
26	17	riotabidv 7349	. . . . 5 ⊢ (𝑠 = 𝑆 → (℩𝑥 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧))) = (℩𝑥 ∈ 𝐵 𝜓))
27		eqid 2730	. . . . 5 ⊢ (𝑠 ∈ 𝒫 𝐵 ↦ (℩𝑥 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧)))) = (𝑠 ∈ 𝒫 𝐵 ↦ (℩𝑥 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧))))
28		riotaex 7351	. . . . 5 ⊢ (℩𝑥 ∈ 𝐵 𝜓) ∈ V
29	26, 27, 28	fvmpt 6971	. . . 4 ⊢ (𝑆 ∈ 𝒫 𝐵 → ((𝑠 ∈ 𝒫 𝐵 ↦ (℩𝑥 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧))))‘𝑆) = (℩𝑥 ∈ 𝐵 𝜓))
30	25, 29	syl 17	. . 3 ⊢ ((𝜑 ∧ 𝑆 ∈ dom 𝑈) → ((𝑠 ∈ 𝒫 𝐵 ↦ (℩𝑥 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧))))‘𝑆) = (℩𝑥 ∈ 𝐵 𝜓))
31	8, 20, 30	3eqtrd 2769	. 2 ⊢ ((𝜑 ∧ 𝑆 ∈ dom 𝑈) → (𝑈‘𝑆) = (℩𝑥 ∈ 𝐵 𝜓))
32		ndmfv 6896	. . . 4 ⊢ (¬ 𝑆 ∈ dom 𝑈 → (𝑈‘𝑆) = ∅)
33	32	adantl 481	. . 3 ⊢ ((𝜑 ∧ ¬ 𝑆 ∈ dom 𝑈) → (𝑈‘𝑆) = ∅)
34	1, 2, 3, 10, 5	lubeldm 18319	. . . . . . 7 ⊢ (𝜑 → (𝑆 ∈ dom 𝑈 ↔ (𝑆 ⊆ 𝐵 ∧ ∃!𝑥 ∈ 𝐵 𝜓)))
35	34	biimprd 248	. . . . . 6 ⊢ (𝜑 → ((𝑆 ⊆ 𝐵 ∧ ∃!𝑥 ∈ 𝐵 𝜓) → 𝑆 ∈ dom 𝑈))
36	21, 35	mpand 695	. . . . 5 ⊢ (𝜑 → (∃!𝑥 ∈ 𝐵 𝜓 → 𝑆 ∈ dom 𝑈))
37	36	con3dimp 408	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝑆 ∈ dom 𝑈) → ¬ ∃!𝑥 ∈ 𝐵 𝜓)
38		riotaund 7386	. . . 4 ⊢ (¬ ∃!𝑥 ∈ 𝐵 𝜓 → (℩𝑥 ∈ 𝐵 𝜓) = ∅)
39	37, 38	syl 17	. . 3 ⊢ ((𝜑 ∧ ¬ 𝑆 ∈ dom 𝑈) → (℩𝑥 ∈ 𝐵 𝜓) = ∅)
40	33, 39	eqtr4d 2768	. 2 ⊢ ((𝜑 ∧ ¬ 𝑆 ∈ dom 𝑈) → (𝑈‘𝑆) = (℩𝑥 ∈ 𝐵 𝜓))
41	31, 40	pm2.61dan 812	1 ⊢ (𝜑 → (𝑈‘𝑆) = (℩𝑥 ∈ 𝐵 𝜓))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1540   ∈ wcel 2109  {cab 2708  ∀wral 3045  ∃!wreu 3354   ⊆ wss 3917  ∅c0 4299  𝒫 cpw 4566   class class class wbr 5110   ↦ cmpt 5191  dom cdm 5641   ↾ cres 5643  ‘cfv 6514  ℩crio 7346  Basecbs 17186  lecple 17234  lubclub 18277

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 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2702  ax-rep 5237  ax-sep 5254  ax-nul 5264  ax-pow 5323  ax-pr 5390

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-ral 3046  df-rex 3055  df-rmo 3356  df-reu 3357  df-rab 3409  df-v 3452  df-sbc 3757  df-csb 3866  df-dif 3920  df-un 3922  df-in 3924  df-ss 3934  df-nul 4300  df-if 4492  df-pw 4568  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-iun 4960  df-br 5111  df-opab 5173  df-mpt 5192  df-id 5536  df-xp 5647  df-rel 5648  df-cnv 5649  df-co 5650  df-dm 5651  df-rn 5652  df-res 5653  df-ima 5654  df-iota 6467  df-fun 6516  df-fn 6517  df-f 6518  df-f1 6519  df-fo 6520  df-f1o 6521  df-fv 6522  df-riota 7347  df-lub 18312

This theorem is referenced by:  lubcl  18323  lubprop  18324  lubid  18328  joinval2  18347  poslubd  18379  lubun  18481  toslub  32906  lub0N  39189  glbconN  39377  glbconNOLD  39378