Theorem lubfun 18442

Description: The LUB is a function. (Contributed by NM, 9-Sep-2018.)

Hypothesis

Ref	Expression
lubfun.u	⊢ 𝑈 = (lub‘𝐾)

Assertion

Ref	Expression
lubfun	⊢ Fun 𝑈

Proof of Theorem lubfun

Dummy variables 𝑥 𝑠 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		funmpt 6575	. . . 4 ⊢ Fun (𝑠 ∈ 𝒫 (Base‘𝐾) ↦ (℩𝑥 ∈ (Base‘𝐾)(∀𝑦 ∈ 𝑠 𝑦(le‘𝐾)𝑥 ∧ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦 ∈ 𝑠 𝑦(le‘𝐾)𝑧 → 𝑥(le‘𝐾)𝑧))))
2		funres 6579	. . . 4 ⊢ (Fun (𝑠 ∈ 𝒫 (Base‘𝐾) ↦ (℩𝑥 ∈ (Base‘𝐾)(∀𝑦 ∈ 𝑠 𝑦(le‘𝐾)𝑥 ∧ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦 ∈ 𝑠 𝑦(le‘𝐾)𝑧 → 𝑥(le‘𝐾)𝑧)))) → Fun ((𝑠 ∈ 𝒫 (Base‘𝐾) ↦ (℩𝑥 ∈ (Base‘𝐾)(∀𝑦 ∈ 𝑠 𝑦(le‘𝐾)𝑥 ∧ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦 ∈ 𝑠 𝑦(le‘𝐾)𝑧 → 𝑥(le‘𝐾)𝑧)))) ↾ {𝑠 ∣ ∃!𝑥 ∈ (Base‘𝐾)(∀𝑦 ∈ 𝑠 𝑦(le‘𝐾)𝑥 ∧ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦 ∈ 𝑠 𝑦(le‘𝐾)𝑧 → 𝑥(le‘𝐾)𝑧))}))
3	1, 2	ax-mp 5	. . 3 ⊢ Fun ((𝑠 ∈ 𝒫 (Base‘𝐾) ↦ (℩𝑥 ∈ (Base‘𝐾)(∀𝑦 ∈ 𝑠 𝑦(le‘𝐾)𝑥 ∧ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦 ∈ 𝑠 𝑦(le‘𝐾)𝑧 → 𝑥(le‘𝐾)𝑧)))) ↾ {𝑠 ∣ ∃!𝑥 ∈ (Base‘𝐾)(∀𝑦 ∈ 𝑠 𝑦(le‘𝐾)𝑥 ∧ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦 ∈ 𝑠 𝑦(le‘𝐾)𝑧 → 𝑥(le‘𝐾)𝑧))})
4		eqid 2762	. . . . 5 ⊢ (Base‘𝐾) = (Base‘𝐾)
5		eqid 2762	. . . . 5 ⊢ (le‘𝐾) = (le‘𝐾)
6		lubfun.u	. . . . 5 ⊢ 𝑈 = (lub‘𝐾)
7		biid 264	. . . . 5 ⊢ ((∀𝑦 ∈ 𝑠 𝑦(le‘𝐾)𝑥 ∧ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦 ∈ 𝑠 𝑦(le‘𝐾)𝑧 → 𝑥(le‘𝐾)𝑧)) ↔ (∀𝑦 ∈ 𝑠 𝑦(le‘𝐾)𝑥 ∧ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦 ∈ 𝑠 𝑦(le‘𝐾)𝑧 → 𝑥(le‘𝐾)𝑧)))
8		id 23	. . . . 5 ⊢ (𝐾 ∈ V → 𝐾 ∈ V)
9	4, 5, 6, 7, 8	lubfval 18440	. . . 4 ⊢ (𝐾 ∈ V → 𝑈 = ((𝑠 ∈ 𝒫 (Base‘𝐾) ↦ (℩𝑥 ∈ (Base‘𝐾)(∀𝑦 ∈ 𝑠 𝑦(le‘𝐾)𝑥 ∧ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦 ∈ 𝑠 𝑦(le‘𝐾)𝑧 → 𝑥(le‘𝐾)𝑧)))) ↾ {𝑠 ∣ ∃!𝑥 ∈ (Base‘𝐾)(∀𝑦 ∈ 𝑠 𝑦(le‘𝐾)𝑥 ∧ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦 ∈ 𝑠 𝑦(le‘𝐾)𝑧 → 𝑥(le‘𝐾)𝑧))}))
10	9	funeqd 6559	. . 3 ⊢ (𝐾 ∈ V → (Fun 𝑈 ↔ Fun ((𝑠 ∈ 𝒫 (Base‘𝐾) ↦ (℩𝑥 ∈ (Base‘𝐾)(∀𝑦 ∈ 𝑠 𝑦(le‘𝐾)𝑥 ∧ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦 ∈ 𝑠 𝑦(le‘𝐾)𝑧 → 𝑥(le‘𝐾)𝑧)))) ↾ {𝑠 ∣ ∃!𝑥 ∈ (Base‘𝐾)(∀𝑦 ∈ 𝑠 𝑦(le‘𝐾)𝑥 ∧ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦 ∈ 𝑠 𝑦(le‘𝐾)𝑧 → 𝑥(le‘𝐾)𝑧))})))
11	3, 10	mpbiri 261	. 2 ⊢ (𝐾 ∈ V → Fun 𝑈)
12		fun0 6602	. . 3 ⊢ Fun ∅
13		fvprc 6874	. . . . 5 ⊢ (¬ 𝐾 ∈ V → (lub‘𝐾) = ∅)
14	6, 13	eqtrid 2809	. . . 4 ⊢ (¬ 𝐾 ∈ V → 𝑈 = ∅)
15	14	funeqd 6559	. . 3 ⊢ (¬ 𝐾 ∈ V → (Fun 𝑈 ↔ Fun ∅))
16	12, 15	mpbiri 261	. 2 ⊢ (¬ 𝐾 ∈ V → Fun 𝑈)
17	11, 16	pm2.61i 184	1 ⊢ Fun 𝑈

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  {cab 2740  ∀wral 3078  ∃!wreu 3365  Vcvv 3453  ∅c0 4282  𝒫 cpw 4560   class class class wbr 5107   ↦ cmpt 5190   ↾ cres 5661  Fun wfun 6531  ‘cfv 6537  ℩crio 7372  Basecbs 17305  lecple 17353  lubclub 18401

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rmo 3367  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  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 7373  df-lub 18436

This theorem is used by:  joinfval  18463  joinfval2  18464