Theorem lubeldm 18257

Description: Member of the domain of the least upper bound function of a poset. (Contributed by NM, 7-Sep-2018.)

Hypotheses

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

Assertion

Ref	Expression
lubeldm	⊢ (𝜑 → (𝑆 ∈ dom 𝑈 ↔ (𝑆 ⊆ 𝐵 ∧ ∃!𝑥 ∈ 𝐵 𝜓)))

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

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

Proof of Theorem lubeldm

Dummy variable 𝑠 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		lubeldm.b	. . . 4 ⊢ 𝐵 = (Base‘𝐾)
2		lubeldm.l	. . . 4 ⊢ ≤ = (le‘𝐾)
3		lubeldm.u	. . . 4 ⊢ 𝑈 = (lub‘𝐾)
4		biid 261	. . . 4 ⊢ ((∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧)) ↔ (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧)))
5		lubeldm.k	. . . 4 ⊢ (𝜑 → 𝐾 ∈ 𝑉)
6	1, 2, 3, 4, 5	lubdm 18255	. . 3 ⊢ (𝜑 → dom 𝑈 = {𝑠 ∈ 𝒫 𝐵 ∣ ∃!𝑥 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧))})
7	6	eleq2d 2817	. 2 ⊢ (𝜑 → (𝑆 ∈ dom 𝑈 ↔ 𝑆 ∈ {𝑠 ∈ 𝒫 𝐵 ∣ ∃!𝑥 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧))}))
8		raleq 3289	. . . . . . 7 ⊢ (𝑠 = 𝑆 → (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑥 ↔ ∀𝑦 ∈ 𝑆 𝑦 ≤ 𝑥))
9		raleq 3289	. . . . . . . . 9 ⊢ (𝑠 = 𝑆 → (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑧 ↔ ∀𝑦 ∈ 𝑆 𝑦 ≤ 𝑧))
10	9	imbi1d 341	. . . . . . . 8 ⊢ (𝑠 = 𝑆 → ((∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧) ↔ (∀𝑦 ∈ 𝑆 𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧)))
11	10	ralbidv 3155	. . . . . . 7 ⊢ (𝑠 = 𝑆 → (∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧) ↔ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑆 𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧)))
12	8, 11	anbi12d 632	. . . . . 6 ⊢ (𝑠 = 𝑆 → ((∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧)) ↔ (∀𝑦 ∈ 𝑆 𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑆 𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧))))
13	12	reubidv 3362	. . . . 5 ⊢ (𝑠 = 𝑆 → (∃!𝑥 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧)) ↔ ∃!𝑥 ∈ 𝐵 (∀𝑦 ∈ 𝑆 𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑆 𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧))))
14		lubeldm.p	. . . . . 6 ⊢ (𝜓 ↔ (∀𝑦 ∈ 𝑆 𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑆 𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧)))
15	14	reubii 3355	. . . . 5 ⊢ (∃!𝑥 ∈ 𝐵 𝜓 ↔ ∃!𝑥 ∈ 𝐵 (∀𝑦 ∈ 𝑆 𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑆 𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧)))
16	13, 15	bitr4di 289	. . . 4 ⊢ (𝑠 = 𝑆 → (∃!𝑥 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧)) ↔ ∃!𝑥 ∈ 𝐵 𝜓))
17	16	elrab 3642	. . 3 ⊢ (𝑆 ∈ {𝑠 ∈ 𝒫 𝐵 ∣ ∃!𝑥 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧))} ↔ (𝑆 ∈ 𝒫 𝐵 ∧ ∃!𝑥 ∈ 𝐵 𝜓))
18	1	fvexi 6836	. . . . 5 ⊢ 𝐵 ∈ V
19	18	elpw2 5270	. . . 4 ⊢ (𝑆 ∈ 𝒫 𝐵 ↔ 𝑆 ⊆ 𝐵)
20	19	anbi1i 624	. . 3 ⊢ ((𝑆 ∈ 𝒫 𝐵 ∧ ∃!𝑥 ∈ 𝐵 𝜓) ↔ (𝑆 ⊆ 𝐵 ∧ ∃!𝑥 ∈ 𝐵 𝜓))
21	17, 20	bitri 275	. 2 ⊢ (𝑆 ∈ {𝑠 ∈ 𝒫 𝐵 ∣ ∃!𝑥 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑥 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ 𝑠 𝑦 ≤ 𝑧 → 𝑥 ≤ 𝑧))} ↔ (𝑆 ⊆ 𝐵 ∧ ∃!𝑥 ∈ 𝐵 𝜓))
22	7, 21	bitrdi 287	1 ⊢ (𝜑 → (𝑆 ∈ dom 𝑈 ↔ (𝑆 ⊆ 𝐵 ∧ ∃!𝑥 ∈ 𝐵 𝜓)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1541   ∈ wcel 2111  ∀wral 3047  ∃!wreu 3344  {crab 3395   ⊆ wss 3897  𝒫 cpw 4547   class class class wbr 5089  dom cdm 5614  ‘cfv 6481  Basecbs 17120  lecple 17168  lubclub 18215

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-rep 5215  ax-sep 5232  ax-nul 5242  ax-pow 5301  ax-pr 5368

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ne 2929  df-ral 3048  df-rex 3057  df-rmo 3346  df-reu 3347  df-rab 3396  df-v 3438  df-sbc 3737  df-csb 3846  df-dif 3900  df-un 3902  df-in 3904  df-ss 3914  df-nul 4281  df-if 4473  df-pw 4549  df-sn 4574  df-pr 4576  df-op 4580  df-uni 4857  df-iun 4941  df-br 5090  df-opab 5152  df-mpt 5171  df-id 5509  df-xp 5620  df-rel 5621  df-cnv 5622  df-co 5623  df-dm 5624  df-rn 5625  df-res 5626  df-ima 5627  df-iota 6437  df-fun 6483  df-fn 6484  df-f 6485  df-f1 6486  df-fo 6487  df-f1o 6488  df-fv 6489  df-riota 7303  df-lub 18250

This theorem is referenced by:  lubelss  18258  lubeu  18259  lubval  18260  lublecl  18265  lubeldm2  49066  joindm3  49079