Theorem lubval 18410

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 264	. . . . 5 ⊢ ((∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧)) ↔ (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧)))
5		lubval.k	. . . . . 6 ⊢ (𝜑 → 𝐾 ∈ 𝑉)
6	5	adantr 485	. . . . 5 ⊢ ((𝜑 ∧ 𝑆 ∈ dom 𝑈) → 𝐾 ∈ 𝑉)
7	1, 2, 3, 4, 6	lubfval 18404	. . . 4 ⊢ ((𝜑 ∧ 𝑆 ∈ dom 𝑈) → 𝑈 = ((𝑠 ∈ 𝒫 𝐵 ↦ (℩𝑥 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧)))) ↾ {𝑠 ∣ ∃!𝑥 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧))}))
8	7	fveq1d 6884	. . 3 ⊢ ((𝜑 ∧ 𝑆 ∈ dom 𝑈) → (𝑈‘𝑆) = (((𝑠 ∈ 𝒫 𝐵 ↦ (℩𝑥 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧)))) ↾ {𝑠 ∣ ∃!𝑥 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧))})‘𝑆))
9		simpr 489	. . . . 5 ⊢ ((𝜑 ∧ 𝑆 ∈ dom 𝑈) → 𝑆 ∈ dom 𝑈)
10		lubval.p	. . . . . 6 ⊢ (𝜓 ↔ (∀𝑦 ∈ 𝑆 𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑆 𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧)))
11	1, 2, 3, 10, 6, 9	lubeu 18409	. . . . 5 ⊢ ((𝜑 ∧ 𝑆 ∈ dom 𝑈) → ∃!𝑥 ∈ 𝐵 𝜓)
12		raleq 3326	. . . . . . . 8 ⊢ (𝑠 = 𝑆 → (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑥 ↔ ∀𝑦 ∈ 𝑆 𝑦 ≤ 𝑥))
13		raleq 3326	. . . . . . . . . 10 ⊢ (𝑠 = 𝑆 → (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑧 ↔ ∀𝑦 ∈ 𝑆 𝑦 ≤ 𝑧))
14	13	imbi1d 344	. . . . . . . . 9 ⊢ (𝑠 = 𝑆 → ((∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧) ↔ (∀𝑦 ∈ 𝑆 𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧)))
15	14	ralbidv 3194	. . . . . . . 8 ⊢ (𝑠 = 𝑆 → (∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧) ↔ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑆 𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧)))
16	12, 15	anbi12d 643	. . . . . . 7 ⊢ (𝑠 = 𝑆 → ((∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧)) ↔ (∀𝑦 ∈ 𝑆 𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑆 𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧))))
17	16, 10	bitr4di 292	. . . . . 6 ⊢ (𝑠 = 𝑆 → ((∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧)) ↔ 𝜓))
18	17	reubidv 3392	. . . . 5 ⊢ (𝑠 = 𝑆 → (∃!𝑥 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧)) ↔ ∃!𝑥 ∈ 𝐵 𝜓))
19	9, 11, 18	elabd 3649	. . . 4 ⊢ ((𝜑 ∧ 𝑆 ∈ dom 𝑈) → 𝑆 ∈ {𝑠 ∣ ∃!𝑥 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧))})
20	19	fvresd 6902	. . 3 ⊢ ((𝜑 ∧ 𝑆 ∈ dom 𝑈) → (((𝑠 ∈ 𝒫 𝐵 ↦ (℩𝑥 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧)))) ↾ {𝑠 ∣ ∃!𝑥 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧))})‘𝑆) = ((𝑠 ∈ 𝒫 𝐵 ↦ (℩𝑥 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧))))‘𝑆))
21		lubval.s	. . . . . 6 ⊢ (𝜑 → 𝑆 ⊆ 𝐵)
22	21	adantr 485	. . . . 5 ⊢ ((𝜑 ∧ 𝑆 ∈ dom 𝑈) → 𝑆 ⊆ 𝐵)
23	1	fvexi 6896	. . . . . 6 ⊢ 𝐵 ∈ V
24	23	elpw2 5305	. . . . 5 ⊢ (𝑆 ∈ 𝒫 𝐵 ↔ 𝑆 ⊆ 𝐵)
25	22, 24	sylibr 237	. . . 4 ⊢ ((𝜑 ∧ 𝑆 ∈ dom 𝑈) → 𝑆 ∈ 𝒫 𝐵)
26	17	riotabidv 7370	. . . . 5 ⊢ (𝑠 = 𝑆 → (℩𝑥 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧))) = (℩𝑥 ∈ 𝐵 𝜓))
27		eqid 2769	. . . . 5 ⊢ (𝑠 ∈ 𝒫 𝐵 ↦ (℩𝑥 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧)))) = (𝑠 ∈ 𝒫 𝐵 ↦ (℩𝑥 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧))))
28		riotaex 7372	. . . . 5 ⊢ (℩𝑥 ∈ 𝐵 𝜓) ∈ V
29	26, 27, 28	fvmpt 6990	. . . 4 ⊢ (𝑆 ∈ 𝒫 𝐵 → ((𝑠 ∈ 𝒫 𝐵 ↦ (℩𝑥 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧))))‘𝑆) = (℩𝑥 ∈ 𝐵 𝜓))
30	25, 29	syl 18	. . 3 ⊢ ((𝜑 ∧ 𝑆 ∈ dom 𝑈) → ((𝑠 ∈ 𝒫 𝐵 ↦ (℩𝑥 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧))))‘𝑆) = (℩𝑥 ∈ 𝐵 𝜓))
31	8, 20, 30	3eqtrd 2808	. 2 ⊢ ((𝜑 ∧ 𝑆 ∈ dom 𝑈) → (𝑈‘𝑆) = (℩𝑥 ∈ 𝐵 𝜓))
32		ndmfv 6914	. . . 4 ⊢ (¬ 𝑆 ∈ dom 𝑈 → (𝑈‘𝑆) = ∅)
33	32	adantl 486	. . 3 ⊢ ((𝜑 ∧ ¬ 𝑆 ∈ dom 𝑈) → (𝑈‘𝑆) = ∅)
34	1, 2, 3, 10, 5	lubeldm 18407	. . . . . . 7 ⊢ (𝜑 → (𝑆 ∈ dom 𝑈 ↔ (𝑆 ⊆ 𝐵 ∧ ∃!𝑥 ∈ 𝐵 𝜓)))
35	34	biimprd 251	. . . . . 6 ⊢ (𝜑 → ((𝑆 ⊆ 𝐵 ∧ ∃!𝑥 ∈ 𝐵 𝜓) → 𝑆 ∈ dom 𝑈))
36	21, 35	mpand 707	. . . . 5 ⊢ (𝜑 → (∃!𝑥 ∈ 𝐵 𝜓 → 𝑆 ∈ dom 𝑈))
37	36	con3dimp 413	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝑆 ∈ dom 𝑈) → ¬ ∃!𝑥 ∈ 𝐵 𝜓)
38		riotaund 7407	. . . 4 ⊢ (¬ ∃!𝑥 ∈ 𝐵 𝜓 → (℩𝑥 ∈ 𝐵 𝜓) = ∅)
39	37, 38	syl 18	. . 3 ⊢ ((𝜑 ∧ ¬ 𝑆 ∈ dom 𝑈) → (℩𝑥 ∈ 𝐵 𝜓) = ∅)
40	33, 39	eqtr4d 2807	. 2 ⊢ ((𝜑 ∧ ¬ 𝑆 ∈ dom 𝑈) → (𝑈‘𝑆) = (℩𝑥 ∈ 𝐵 𝜓))
41	31, 40	pm2.61dan 824	1 ⊢ (𝜑 → (𝑈‘𝑆) = (℩𝑥 ∈ 𝐵 𝜓))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 400   = wceq 1567   ∈ wcel 2149  {cab 2747  ∀wral 3085  ∃!wreu 3374   ⊆ wss 3913  ∅c0 4294  𝒫 cpw 4567   class class class wbr 5113   ↦ cmpt 5196  dom cdm 5662   ↾ cres 5664  ‘cfv 6537  ℩crio 7367  Basecbs 17269  lecple 17317  lubclub 18365

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-rep 5242  ax-sep 5261  ax-nul 5271  ax-pow 5337  ax-pr 5405

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-rmo 3376  df-reu 3377  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-iun 4962  df-br 5114  df-opab 5178  df-mpt 5197  df-id 5557  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-res 5674  df-ima 5675  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7368  df-lub 18400

This theorem is referenced by:  lubcl  18411  lubprop  18412  lubid  18416  joinval2  18435  poslubd  18467  lubun  18571  toslub  33234  lub0N  39887  glbconN  40075