Theorem meetfval 18444

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

Hypotheses

Ref	Expression
meetfval.u	⊢ 𝐺 = (glb‘𝐾)
meetfval.m	⊢ ∧ = (meet‘𝐾)

Assertion

Ref	Expression
meetfval	⊢ (𝐾 ∈ 𝑉 → ∧ = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ {𝑥, 𝑦}𝐺𝑧})

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

Allowed substitution hints:   𝐺(𝑥,𝑦)   ∧ (𝑥,𝑦,𝑧)   𝑉(𝑥,𝑦,𝑧)

Proof of Theorem meetfval

Dummy variable 𝑝 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		elex 3498	. 2 ⊢ (𝐾 ∈ 𝑉 → 𝐾 ∈ V)
2		meetfval.m	. . 3 ⊢ ∧ = (meet‘𝐾)
3		fvex 6919	. . . . . . 7 ⊢ (Base‘𝐾) ∈ V
4		moeq 3715	. . . . . . . 8 ⊢ ∃*𝑧 𝑧 = (𝐺‘{𝑥, 𝑦})
5	4	a1i 11	. . . . . . 7 ⊢ ((𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾)) → ∃*𝑧 𝑧 = (𝐺‘{𝑥, 𝑦}))
6		eqid 2734	. . . . . . 7 ⊢ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾)) ∧ 𝑧 = (𝐺‘{𝑥, 𝑦}))} = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾)) ∧ 𝑧 = (𝐺‘{𝑥, 𝑦}))}
7	3, 3, 5, 6	oprabex 7999	. . . . . 6 ⊢ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾)) ∧ 𝑧 = (𝐺‘{𝑥, 𝑦}))} ∈ V
8	7	a1i 11	. . . . 5 ⊢ (𝐾 ∈ V → {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾)) ∧ 𝑧 = (𝐺‘{𝑥, 𝑦}))} ∈ V)
9		meetfval.u	. . . . . . . . . . . 12 ⊢ 𝐺 = (glb‘𝐾)
10	9	glbfun 18422	. . . . . . . . . . 11 ⊢ Fun 𝐺
11		funbrfv2b 6965	. . . . . . . . . . 11 ⊢ (Fun 𝐺 → ({𝑥, 𝑦}𝐺𝑧 ↔ ({𝑥, 𝑦} ∈ dom 𝐺 ∧ (𝐺‘{𝑥, 𝑦}) = 𝑧)))
12	10, 11	ax-mp 5	. . . . . . . . . 10 ⊢ ({𝑥, 𝑦}𝐺𝑧 ↔ ({𝑥, 𝑦} ∈ dom 𝐺 ∧ (𝐺‘{𝑥, 𝑦}) = 𝑧))
13		eqid 2734	. . . . . . . . . . . . . 14 ⊢ (Base‘𝐾) = (Base‘𝐾)
14		eqid 2734	. . . . . . . . . . . . . 14 ⊢ (le‘𝐾) = (le‘𝐾)
15		simpl 482	. . . . . . . . . . . . . 14 ⊢ ((𝐾 ∈ V ∧ {𝑥, 𝑦} ∈ dom 𝐺) → 𝐾 ∈ V)
16		simpr 484	. . . . . . . . . . . . . 14 ⊢ ((𝐾 ∈ V ∧ {𝑥, 𝑦} ∈ dom 𝐺) → {𝑥, 𝑦} ∈ dom 𝐺)
17	13, 14, 9, 15, 16	glbelss 18424	. . . . . . . . . . . . 13 ⊢ ((𝐾 ∈ V ∧ {𝑥, 𝑦} ∈ dom 𝐺) → {𝑥, 𝑦} ⊆ (Base‘𝐾))
18	17	ex 412	. . . . . . . . . . . 12 ⊢ (𝐾 ∈ V → ({𝑥, 𝑦} ∈ dom 𝐺 → {𝑥, 𝑦} ⊆ (Base‘𝐾)))
19		vex 3481	. . . . . . . . . . . . 13 ⊢ 𝑥 ∈ V
20		vex 3481	. . . . . . . . . . . . 13 ⊢ 𝑦 ∈ V
21	19, 20	prss 4824	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾)) ↔ {𝑥, 𝑦} ⊆ (Base‘𝐾))
22	18, 21	imbitrrdi 252	. . . . . . . . . . 11 ⊢ (𝐾 ∈ V → ({𝑥, 𝑦} ∈ dom 𝐺 → (𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾))))
23		eqcom 2741	. . . . . . . . . . . 12 ⊢ ((𝐺‘{𝑥, 𝑦}) = 𝑧 ↔ 𝑧 = (𝐺‘{𝑥, 𝑦}))
24	23	biimpi 216	. . . . . . . . . . 11 ⊢ ((𝐺‘{𝑥, 𝑦}) = 𝑧 → 𝑧 = (𝐺‘{𝑥, 𝑦}))
25	22, 24	anim12d1 610	. . . . . . . . . 10 ⊢ (𝐾 ∈ V → (({𝑥, 𝑦} ∈ dom 𝐺 ∧ (𝐺‘{𝑥, 𝑦}) = 𝑧) → ((𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾)) ∧ 𝑧 = (𝐺‘{𝑥, 𝑦}))))
26	12, 25	biimtrid 242	. . . . . . . . 9 ⊢ (𝐾 ∈ V → ({𝑥, 𝑦}𝐺𝑧 → ((𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾)) ∧ 𝑧 = (𝐺‘{𝑥, 𝑦}))))
27	26	alrimiv 1924	. . . . . . . 8 ⊢ (𝐾 ∈ V → ∀𝑧({𝑥, 𝑦}𝐺𝑧 → ((𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾)) ∧ 𝑧 = (𝐺‘{𝑥, 𝑦}))))
28	27	alrimiv 1924	. . . . . . 7 ⊢ (𝐾 ∈ V → ∀𝑦∀𝑧({𝑥, 𝑦}𝐺𝑧 → ((𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾)) ∧ 𝑧 = (𝐺‘{𝑥, 𝑦}))))
29	28	alrimiv 1924	. . . . . 6 ⊢ (𝐾 ∈ V → ∀𝑥∀𝑦∀𝑧({𝑥, 𝑦}𝐺𝑧 → ((𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾)) ∧ 𝑧 = (𝐺‘{𝑥, 𝑦}))))
30		ssoprab2 7500	. . . . . 6 ⊢ (∀𝑥∀𝑦∀𝑧({𝑥, 𝑦}𝐺𝑧 → ((𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾)) ∧ 𝑧 = (𝐺‘{𝑥, 𝑦}))) → {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ {𝑥, 𝑦}𝐺𝑧} ⊆ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾)) ∧ 𝑧 = (𝐺‘{𝑥, 𝑦}))})
31	29, 30	syl 17	. . . . 5 ⊢ (𝐾 ∈ V → {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ {𝑥, 𝑦}𝐺𝑧} ⊆ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾)) ∧ 𝑧 = (𝐺‘{𝑥, 𝑦}))})
32	8, 31	ssexd 5329	. . . 4 ⊢ (𝐾 ∈ V → {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ {𝑥, 𝑦}𝐺𝑧} ∈ V)
33		fveq2 6906	. . . . . . . 8 ⊢ (𝑝 = 𝐾 → (glb‘𝑝) = (glb‘𝐾))
34	33, 9	eqtr4di 2792	. . . . . . 7 ⊢ (𝑝 = 𝐾 → (glb‘𝑝) = 𝐺)
35	34	breqd 5158	. . . . . 6 ⊢ (𝑝 = 𝐾 → ({𝑥, 𝑦} (glb‘𝑝)𝑧 ↔ {𝑥, 𝑦}𝐺𝑧))
36	35	oprabbidv 7498	. . . . 5 ⊢ (𝑝 = 𝐾 → {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ {𝑥, 𝑦} (glb‘𝑝)𝑧} = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ {𝑥, 𝑦}𝐺𝑧})
37		df-meet 18406	. . . . 5 ⊢ meet = (𝑝 ∈ V ↦ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ {𝑥, 𝑦} (glb‘𝑝)𝑧})
38	36, 37	fvmptg 7013	. . . 4 ⊢ ((𝐾 ∈ V ∧ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ {𝑥, 𝑦}𝐺𝑧} ∈ V) → (meet‘𝐾) = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ {𝑥, 𝑦}𝐺𝑧})
39	32, 38	mpdan 687	. . 3 ⊢ (𝐾 ∈ V → (meet‘𝐾) = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ {𝑥, 𝑦}𝐺𝑧})
40	2, 39	eqtrid 2786	. 2 ⊢ (𝐾 ∈ V → ∧ = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ {𝑥, 𝑦}𝐺𝑧})
41	1, 40	syl 17	1 ⊢ (𝐾 ∈ 𝑉 → ∧ = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ {𝑥, 𝑦}𝐺𝑧})

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395  ∀wal 1534   = wceq 1536   ∈ wcel 2105  ∃*wmo 2535  Vcvv 3477   ⊆ wss 3962  {cpr 4632   class class class wbr 5147  dom cdm 5688  Fun wfun 6556  ‘cfv 6562  {coprab 7431  Basecbs 17244  lecple 17304  glbcglb 18367  meetcmee 18369

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1791  ax-4 1805  ax-5 1907  ax-6 1964  ax-7 2004  ax-8 2107  ax-9 2115  ax-10 2138  ax-11 2154  ax-12 2174  ax-ext 2705  ax-rep 5284  ax-sep 5301  ax-nul 5311  ax-pow 5370  ax-pr 5437  ax-un 7753

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1539  df-fal 1549  df-ex 1776  df-nf 1780  df-sb 2062  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2726  df-clel 2813  df-nfc 2889  df-ne 2938  df-ral 3059  df-rex 3068  df-rmo 3377  df-reu 3378  df-rab 3433  df-v 3479  df-sbc 3791  df-csb 3908  df-dif 3965  df-un 3967  df-in 3969  df-ss 3979  df-nul 4339  df-if 4531  df-pw 4606  df-sn 4631  df-pr 4633  df-op 4637  df-uni 4912  df-iun 4997  df-br 5148  df-opab 5210  df-mpt 5231  df-id 5582  df-xp 5694  df-rel 5695  df-cnv 5696  df-co 5697  df-dm 5698  df-rn 5699  df-res 5700  df-ima 5701  df-iota 6515  df-fun 6564  df-fn 6565  df-f 6566  df-f1 6567  df-fo 6568  df-f1o 6569  df-fv 6570  df-riota 7387  df-oprab 7434  df-glb 18404  df-meet 18406

This theorem is referenced by:  meetfval2  18445  meet0  18463  odujoin  18465  odumeet  18467