Theorem joinfval 18465

Description: Value of join function for a poset. (Contributed by NM, 12-Sep-2011.) (Revised by NM, 9-Sep-2018.) TODO: prove joinfval2 18466 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 3474	. 2 ⊢ (𝐾 ∈ 𝑉 → 𝐾 ∈ V)
2		joinfval.j	. . 3 ⊢ ∨ = (join‘𝐾)
3		fvex 6895	. . . . . . 7 ⊢ (Base‘𝐾) ∈ V
4		moeq 3668	. . . . . . . 8 ⊢ ∃*𝑧 𝑧 = (𝑈‘{𝑥, 𝑦})
5	4	a1i 11	. . . . . . 7 ⊢ ((𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾)) → ∃*𝑧 𝑧 = (𝑈‘{𝑥, 𝑦}))
6		eqid 2762	. . . . . . 7 ⊢ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾)) ∧ 𝑧 = (𝑈‘{𝑥, 𝑦}))} = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾)) ∧ 𝑧 = (𝑈‘{𝑥, 𝑦}))}
7	3, 3, 5, 6	oprabex 7977	. . . . . 6 ⊢ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾)) ∧ 𝑧 = (𝑈‘{𝑥, 𝑦}))} ∈ V
8	7	a1i 11	. . . . 5 ⊢ (𝐾 ∈ V → {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾)) ∧ 𝑧 = (𝑈‘{𝑥, 𝑦}))} ∈ V)
9		joinfval.u	. . . . . . . . . . . 12 ⊢ 𝑈 = (lub‘𝐾)
10	9	lubfun 18444	. . . . . . . . . . 11 ⊢ Fun 𝑈
11		funbrfv2b 6939	. . . . . . . . . . 11 ⊢ (Fun 𝑈 → ({𝑥, 𝑦}𝑈𝑧 ↔ ({𝑥, 𝑦} ∈ dom 𝑈 ∧ (𝑈‘{𝑥, 𝑦}) = 𝑧)))
12	10, 11	ax-mp 5	. . . . . . . . . 10 ⊢ ({𝑥, 𝑦}𝑈𝑧 ↔ ({𝑥, 𝑦} ∈ dom 𝑈 ∧ (𝑈‘{𝑥, 𝑦}) = 𝑧))
13		eqid 2762	. . . . . . . . . . . . . 14 ⊢ (Base‘𝐾) = (Base‘𝐾)
14		eqid 2762	. . . . . . . . . . . . . 14 ⊢ (le‘𝐾) = (le‘𝐾)
15		simpl 488	. . . . . . . . . . . . . 14 ⊢ ((𝐾 ∈ V ∧ {𝑥, 𝑦} ∈ dom 𝑈) → 𝐾 ∈ V)
16		simpr 490	. . . . . . . . . . . . . 14 ⊢ ((𝐾 ∈ V ∧ {𝑥, 𝑦} ∈ dom 𝑈) → {𝑥, 𝑦} ∈ dom 𝑈)
17	13, 14, 9, 15, 16	lubelss 18446	. . . . . . . . . . . . 13 ⊢ ((𝐾 ∈ V ∧ {𝑥, 𝑦} ∈ dom 𝑈) → {𝑥, 𝑦} ⊆ (Base‘𝐾))
18	17	ex 418	. . . . . . . . . . . 12 ⊢ (𝐾 ∈ V → ({𝑥, 𝑦} ∈ dom 𝑈 → {𝑥, 𝑦} ⊆ (Base‘𝐾)))
19		vex 3457	. . . . . . . . . . . . 13 ⊢ 𝑥 ∈ V
20		vex 3457	. . . . . . . . . . . . 13 ⊢ 𝑦 ∈ V
21	19, 20	prss 4784	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾)) ↔ {𝑥, 𝑦} ⊆ (Base‘𝐾))
22	18, 21	imbitrrdi 255	. . . . . . . . . . 11 ⊢ (𝐾 ∈ V → ({𝑥, 𝑦} ∈ dom 𝑈 → (𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾))))
23		eqcom 2769	. . . . . . . . . . . 12 ⊢ ((𝑈‘{𝑥, 𝑦}) = 𝑧 ↔ 𝑧 = (𝑈‘{𝑥, 𝑦}))
24	23	biimpi 219	. . . . . . . . . . 11 ⊢ ((𝑈‘{𝑥, 𝑦}) = 𝑧 → 𝑧 = (𝑈‘{𝑥, 𝑦}))
25	22, 24	anim12d1 622	. . . . . . . . . 10 ⊢ (𝐾 ∈ V → (({𝑥, 𝑦} ∈ dom 𝑈 ∧ (𝑈‘{𝑥, 𝑦}) = 𝑧) → ((𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾)) ∧ 𝑧 = (𝑈‘{𝑥, 𝑦}))))
26	12, 25	biimtrid 245	. . . . . . . . 9 ⊢ (𝐾 ∈ V → ({𝑥, 𝑦}𝑈𝑧 → ((𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾)) ∧ 𝑧 = (𝑈‘{𝑥, 𝑦}))))
27	26	alrimiv 1960	. . . . . . . 8 ⊢ (𝐾 ∈ V → ∀𝑧({𝑥, 𝑦}𝑈𝑧 → ((𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾)) ∧ 𝑧 = (𝑈‘{𝑥, 𝑦}))))
28	27	alrimiv 1960	. . . . . . 7 ⊢ (𝐾 ∈ V → ∀𝑦∀𝑧({𝑥, 𝑦}𝑈𝑧 → ((𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾)) ∧ 𝑧 = (𝑈‘{𝑥, 𝑦}))))
29	28	alrimiv 1960	. . . . . 6 ⊢ (𝐾 ∈ V → ∀𝑥∀𝑦∀𝑧({𝑥, 𝑦}𝑈𝑧 → ((𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾)) ∧ 𝑧 = (𝑈‘{𝑥, 𝑦}))))
30		ssoprab2 7485	. . . . . 6 ⊢ (∀𝑥∀𝑦∀𝑧({𝑥, 𝑦}𝑈𝑧 → ((𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾)) ∧ 𝑧 = (𝑈‘{𝑥, 𝑦}))) → {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ {𝑥, 𝑦}𝑈𝑧} ⊆ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾)) ∧ 𝑧 = (𝑈‘{𝑥, 𝑦}))})
31	29, 30	syl 18	. . . . 5 ⊢ (𝐾 ∈ V → {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ {𝑥, 𝑦}𝑈𝑧} ⊆ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾)) ∧ 𝑧 = (𝑈‘{𝑥, 𝑦}))})
32	8, 31	ssexd 5293	. . . 4 ⊢ (𝐾 ∈ V → {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ {𝑥, 𝑦}𝑈𝑧} ∈ V)
33		fveq2 6882	. . . . . . . 8 ⊢ (𝑝 = 𝐾 → (lub‘𝑝) = (lub‘𝐾))
34	33, 9	eqtr4di 2815	. . . . . . 7 ⊢ (𝑝 = 𝐾 → (lub‘𝑝) = 𝑈)
35	34	breqd 5118	. . . . . 6 ⊢ (𝑝 = 𝐾 → ({𝑥, 𝑦} (lub‘𝑝)𝑧 ↔ {𝑥, 𝑦}𝑈𝑧))
36	35	oprabbidv 7483	. . . . 5 ⊢ (𝑝 = 𝐾 → {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ {𝑥, 𝑦} (lub‘𝑝)𝑧} = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ {𝑥, 𝑦}𝑈𝑧})
37		df-join 18440	. . . . 5 ⊢ join = (𝑝 ∈ V ↦ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ {𝑥, 𝑦} (lub‘𝑝)𝑧})
38	36, 37	fvmptg 6988	. . . 4 ⊢ ((𝐾 ∈ V ∧ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ {𝑥, 𝑦}𝑈𝑧} ∈ V) → (join‘𝐾) = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ {𝑥, 𝑦}𝑈𝑧})
39	32, 38	mpdan 700	. . 3 ⊢ (𝐾 ∈ V → (join‘𝐾) = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ {𝑥, 𝑦}𝑈𝑧})
40	2, 39	eqtrid 2809	. 2 ⊢ (𝐾 ∈ V → ∨ = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ {𝑥, 𝑦}𝑈𝑧})
41	1, 40	syl 18	1 ⊢ (𝐾 ∈ 𝑉 → ∨ = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ {𝑥, 𝑦}𝑈𝑧})

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1568   = wceq 1570   ∈ wcel 2145  ∃*wmo 2564  Vcvv 3453   ⊆ wss 3902  {cpr 4589   class class class wbr 5107  dom cdm 5659  Fun wfun 6531  ‘cfv 6537  {coprab 7418  Basecbs 17307  lecple 17355  lubclub 18403  joincjn 18405

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  ax-un 7740

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 7374  df-oprab 7421  df-lub 18438  df-join 18440

This theorem is used by:  joinfval2  18466  join0  18497  odujoin  18500  odumeet  18502