Theorem joinfval 18326

Description: Value of join function for a poset. (Contributed by NM, 12-Sep-2011.) (Revised by NM, 9-Sep-2018.) TODO: prove joinfval2 18327 first to reduce net proof size (existence part)?

Hypotheses

Ref	Expression
joinfval.u	⊢ 𝑈 = (lub‘𝐾)
joinfval.j	⊢ ∨ = (join‘𝐾)

Assertion

Ref	Expression
joinfval	⊢ (𝐾 ∈ 𝑉 → ∨ = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ {𝑥, 𝑦}𝑈𝑧})

Distinct variable groups:   𝑥,𝑦,𝑧,𝐾   𝑧,𝑈

Allowed substitution hints:   𝑈(𝑥,𝑦)   ∨ (𝑥,𝑦,𝑧)   𝑉(𝑥,𝑦,𝑧)

Proof of Theorem joinfval

Dummy variable 𝑝 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		elex 3493	. 2 ⊢ (𝐾 ∈ 𝑉 → 𝐾 ∈ V)
2		joinfval.j	. . 3 ⊢ ∨ = (join‘𝐾)
3		fvex 6905	. . . . . . 7 ⊢ (Base‘𝐾) ∈ V
4		moeq 3704	. . . . . . . 8 ⊢ ∃*𝑧 𝑧 = (𝑈‘{𝑥, 𝑦})
5	4	a1i 11	. . . . . . 7 ⊢ ((𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾)) → ∃*𝑧 𝑧 = (𝑈‘{𝑥, 𝑦}))
6		eqid 2733	. . . . . . 7 ⊢ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾)) ∧ 𝑧 = (𝑈‘{𝑥, 𝑦}))} = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾)) ∧ 𝑧 = (𝑈‘{𝑥, 𝑦}))}
7	3, 3, 5, 6	oprabex 7963	. . . . . 6 ⊢ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾)) ∧ 𝑧 = (𝑈‘{𝑥, 𝑦}))} ∈ V
8	7	a1i 11	. . . . 5 ⊢ (𝐾 ∈ V → {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾)) ∧ 𝑧 = (𝑈‘{𝑥, 𝑦}))} ∈ V)
9		joinfval.u	. . . . . . . . . . . 12 ⊢ 𝑈 = (lub‘𝐾)
10	9	lubfun 18305	. . . . . . . . . . 11 ⊢ Fun 𝑈
11		funbrfv2b 6950	. . . . . . . . . . 11 ⊢ (Fun 𝑈 → ({𝑥, 𝑦}𝑈𝑧 ↔ ({𝑥, 𝑦} ∈ dom 𝑈 ∧ (𝑈‘{𝑥, 𝑦}) = 𝑧)))
12	10, 11	ax-mp 5	. . . . . . . . . 10 ⊢ ({𝑥, 𝑦}𝑈𝑧 ↔ ({𝑥, 𝑦} ∈ dom 𝑈 ∧ (𝑈‘{𝑥, 𝑦}) = 𝑧))
13		eqid 2733	. . . . . . . . . . . . . 14 ⊢ (Base‘𝐾) = (Base‘𝐾)
14		eqid 2733	. . . . . . . . . . . . . 14 ⊢ (le‘𝐾) = (le‘𝐾)
15		simpl 484	. . . . . . . . . . . . . 14 ⊢ ((𝐾 ∈ V ∧ {𝑥, 𝑦} ∈ dom 𝑈) → 𝐾 ∈ V)
16		simpr 486	. . . . . . . . . . . . . 14 ⊢ ((𝐾 ∈ V ∧ {𝑥, 𝑦} ∈ dom 𝑈) → {𝑥, 𝑦} ∈ dom 𝑈)
17	13, 14, 9, 15, 16	lubelss 18307	. . . . . . . . . . . . 13 ⊢ ((𝐾 ∈ V ∧ {𝑥, 𝑦} ∈ dom 𝑈) → {𝑥, 𝑦} ⊆ (Base‘𝐾))
18	17	ex 414	. . . . . . . . . . . 12 ⊢ (𝐾 ∈ V → ({𝑥, 𝑦} ∈ dom 𝑈 → {𝑥, 𝑦} ⊆ (Base‘𝐾)))
19		vex 3479	. . . . . . . . . . . . 13 ⊢ 𝑥 ∈ V
20		vex 3479	. . . . . . . . . . . . 13 ⊢ 𝑦 ∈ V
21	19, 20	prss 4824	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾)) ↔ {𝑥, 𝑦} ⊆ (Base‘𝐾))
22	18, 21	syl6ibr 252	. . . . . . . . . . 11 ⊢ (𝐾 ∈ V → ({𝑥, 𝑦} ∈ dom 𝑈 → (𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾))))
23		eqcom 2740	. . . . . . . . . . . 12 ⊢ ((𝑈‘{𝑥, 𝑦}) = 𝑧 ↔ 𝑧 = (𝑈‘{𝑥, 𝑦}))
24	23	biimpi 215	. . . . . . . . . . 11 ⊢ ((𝑈‘{𝑥, 𝑦}) = 𝑧 → 𝑧 = (𝑈‘{𝑥, 𝑦}))
25	22, 24	anim12d1 611	. . . . . . . . . 10 ⊢ (𝐾 ∈ V → (({𝑥, 𝑦} ∈ dom 𝑈 ∧ (𝑈‘{𝑥, 𝑦}) = 𝑧) → ((𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾)) ∧ 𝑧 = (𝑈‘{𝑥, 𝑦}))))
26	12, 25	biimtrid 241	. . . . . . . . 9 ⊢ (𝐾 ∈ V → ({𝑥, 𝑦}𝑈𝑧 → ((𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾)) ∧ 𝑧 = (𝑈‘{𝑥, 𝑦}))))
27	26	alrimiv 1931	. . . . . . . 8 ⊢ (𝐾 ∈ V → ∀𝑧({𝑥, 𝑦}𝑈𝑧 → ((𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾)) ∧ 𝑧 = (𝑈‘{𝑥, 𝑦}))))
28	27	alrimiv 1931	. . . . . . 7 ⊢ (𝐾 ∈ V → ∀𝑦∀𝑧({𝑥, 𝑦}𝑈𝑧 → ((𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾)) ∧ 𝑧 = (𝑈‘{𝑥, 𝑦}))))
29	28	alrimiv 1931	. . . . . 6 ⊢ (𝐾 ∈ V → ∀𝑥∀𝑦∀𝑧({𝑥, 𝑦}𝑈𝑧 → ((𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾)) ∧ 𝑧 = (𝑈‘{𝑥, 𝑦}))))
30		ssoprab2 7477	. . . . . 6 ⊢ (∀𝑥∀𝑦∀𝑧({𝑥, 𝑦}𝑈𝑧 → ((𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾)) ∧ 𝑧 = (𝑈‘{𝑥, 𝑦}))) → {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ {𝑥, 𝑦}𝑈𝑧} ⊆ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾)) ∧ 𝑧 = (𝑈‘{𝑥, 𝑦}))})
31	29, 30	syl 17	. . . . 5 ⊢ (𝐾 ∈ V → {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ {𝑥, 𝑦}𝑈𝑧} ⊆ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾)) ∧ 𝑧 = (𝑈‘{𝑥, 𝑦}))})
32	8, 31	ssexd 5325	. . . 4 ⊢ (𝐾 ∈ V → {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ {𝑥, 𝑦}𝑈𝑧} ∈ V)
33		fveq2 6892	. . . . . . . 8 ⊢ (𝑝 = 𝐾 → (lub‘𝑝) = (lub‘𝐾))
34	33, 9	eqtr4di 2791	. . . . . . 7 ⊢ (𝑝 = 𝐾 → (lub‘𝑝) = 𝑈)
35	34	breqd 5160	. . . . . 6 ⊢ (𝑝 = 𝐾 → ({𝑥, 𝑦} (lub‘𝑝)𝑧 ↔ {𝑥, 𝑦}𝑈𝑧))
36	35	oprabbidv 7475	. . . . 5 ⊢ (𝑝 = 𝐾 → {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ {𝑥, 𝑦} (lub‘𝑝)𝑧} = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ {𝑥, 𝑦}𝑈𝑧})
37		df-join 18301	. . . . 5 ⊢ join = (𝑝 ∈ V ↦ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ {𝑥, 𝑦} (lub‘𝑝)𝑧})
38	36, 37	fvmptg 6997	. . . 4 ⊢ ((𝐾 ∈ V ∧ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ {𝑥, 𝑦}𝑈𝑧} ∈ V) → (join‘𝐾) = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ {𝑥, 𝑦}𝑈𝑧})
39	32, 38	mpdan 686	. . 3 ⊢ (𝐾 ∈ V → (join‘𝐾) = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ {𝑥, 𝑦}𝑈𝑧})
40	2, 39	eqtrid 2785	. 2 ⊢ (𝐾 ∈ V → ∨ = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ {𝑥, 𝑦}𝑈𝑧})
41	1, 40	syl 17	1 ⊢ (𝐾 ∈ 𝑉 → ∨ = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ {𝑥, 𝑦}𝑈𝑧})

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 397  ∀wal 1540   = wceq 1542   ∈ wcel 2107  ∃*wmo 2533  Vcvv 3475   ⊆ wss 3949  {cpr 4631   class class class wbr 5149  dom cdm 5677  Fun wfun 6538  ‘cfv 6544  {coprab 7410  Basecbs 17144  lecple 17204  lubclub 18262  joincjn 18264

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2155  ax-12 2172  ax-ext 2704  ax-rep 5286  ax-sep 5300  ax-nul 5307  ax-pow 5364  ax-pr 5428  ax-un 7725

This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-nf 1787  df-sb 2069  df-mo 2535  df-eu 2564  df-clab 2711  df-cleq 2725  df-clel 2811  df-nfc 2886  df-ne 2942  df-ral 3063  df-rex 3072  df-rmo 3377  df-reu 3378  df-rab 3434  df-v 3477  df-sbc 3779  df-csb 3895  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-nul 4324  df-if 4530  df-pw 4605  df-sn 4630  df-pr 4632  df-op 4636  df-uni 4910  df-iun 5000  df-br 5150  df-opab 5212  df-mpt 5233  df-id 5575  df-xp 5683  df-rel 5684  df-cnv 5685  df-co 5686  df-dm 5687  df-rn 5688  df-res 5689  df-ima 5690  df-iota 6496  df-fun 6546  df-fn 6547  df-f 6548  df-f1 6549  df-fo 6550  df-f1o 6551  df-fv 6552  df-riota 7365  df-oprab 7413  df-lub 18299  df-join 18301

This theorem is referenced by:  joinfval2  18327  join0  18358  odujoin  18361  odumeet  18363