Theorem meetdm3 48932

Description: The meet of any two elements always exists iff all unordered pairs have GLB (expanded version). (Contributed by Zhi Wang, 25-Sep-2024.)

Hypotheses

Ref	Expression
joindm2.b	⊢ 𝐵 = (Base‘𝐾)
joindm2.k	⊢ (𝜑 → 𝐾 ∈ 𝑉)
meetdm2.g	⊢ 𝐺 = (glb‘𝐾)
meetdm2.m	⊢ ∧ = (meet‘𝐾)
meetdm3.l	⊢ ≤ = (le‘𝐾)

Assertion

Ref	Expression
meetdm3	⊢ (𝜑 → (dom ∧ = (𝐵 × 𝐵) ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∃!𝑧 ∈ 𝐵 ((𝑧 ≤ 𝑥 ∧ 𝑧 ≤ 𝑦) ∧ ∀𝑤 ∈ 𝐵 ((𝑤 ≤ 𝑥 ∧ 𝑤 ≤ 𝑦) → 𝑤 ≤ 𝑧))))

Distinct variable groups:   𝑤, ∧ ,𝑥,𝑦,𝑧   𝑤,𝐵,𝑥,𝑦,𝑧   𝑤,𝐾,𝑧   𝜑,𝑥,𝑦

Allowed substitution hints:   𝜑(𝑧,𝑤)   𝐺(𝑥,𝑦,𝑧,𝑤)   𝐾(𝑥,𝑦)   ≤ (𝑥,𝑦,𝑧,𝑤)   𝑉(𝑥,𝑦,𝑧,𝑤)

Proof of Theorem meetdm3

Dummy variable 𝑣 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		joindm2.b	. . 3 ⊢ 𝐵 = (Base‘𝐾)
2		joindm2.k	. . 3 ⊢ (𝜑 → 𝐾 ∈ 𝑉)
3		meetdm2.g	. . 3 ⊢ 𝐺 = (glb‘𝐾)
4		meetdm2.m	. . 3 ⊢ ∧ = (meet‘𝐾)
5	1, 2, 3, 4	meetdm2 48931	. 2 ⊢ (𝜑 → (dom ∧ = (𝐵 × 𝐵) ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 {𝑥, 𝑦} ∈ dom 𝐺))
6		simprl 770	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → 𝑥 ∈ 𝐵)
7		simprr 772	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → 𝑦 ∈ 𝐵)
8	6, 7	prssd 4782	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → {𝑥, 𝑦} ⊆ 𝐵)
9		meetdm3.l	. . . . . . 7 ⊢ ≤ = (le‘𝐾)
10		biid 261	. . . . . . 7 ⊢ ((∀𝑣 ∈ {𝑥, 𝑦}𝑧 ≤ 𝑣 ∧ ∀𝑤 ∈ 𝐵 (∀𝑣 ∈ {𝑥, 𝑦}𝑤 ≤ 𝑣 → 𝑤 ≤ 𝑧)) ↔ (∀𝑣 ∈ {𝑥, 𝑦}𝑧 ≤ 𝑣 ∧ ∀𝑤 ∈ 𝐵 (∀𝑣 ∈ {𝑥, 𝑦}𝑤 ≤ 𝑣 → 𝑤 ≤ 𝑧)))
11	1, 9, 3, 10, 2	glbeldm 18301	. . . . . 6 ⊢ (𝜑 → ({𝑥, 𝑦} ∈ dom 𝐺 ↔ ({𝑥, 𝑦} ⊆ 𝐵 ∧ ∃!𝑧 ∈ 𝐵 (∀𝑣 ∈ {𝑥, 𝑦}𝑧 ≤ 𝑣 ∧ ∀𝑤 ∈ 𝐵 (∀𝑣 ∈ {𝑥, 𝑦}𝑤 ≤ 𝑣 → 𝑤 ≤ 𝑧)))))
12	11	baibd 539	. . . . 5 ⊢ ((𝜑 ∧ {𝑥, 𝑦} ⊆ 𝐵) → ({𝑥, 𝑦} ∈ dom 𝐺 ↔ ∃!𝑧 ∈ 𝐵 (∀𝑣 ∈ {𝑥, 𝑦}𝑧 ≤ 𝑣 ∧ ∀𝑤 ∈ 𝐵 (∀𝑣 ∈ {𝑥, 𝑦}𝑤 ≤ 𝑣 → 𝑤 ≤ 𝑧))))
13	8, 12	syldan 591	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ({𝑥, 𝑦} ∈ dom 𝐺 ↔ ∃!𝑧 ∈ 𝐵 (∀𝑣 ∈ {𝑥, 𝑦}𝑧 ≤ 𝑣 ∧ ∀𝑤 ∈ 𝐵 (∀𝑣 ∈ {𝑥, 𝑦}𝑤 ≤ 𝑣 → 𝑤 ≤ 𝑧))))
14	2	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → 𝐾 ∈ 𝑉)
15	1, 9, 4, 14, 6, 7	meetval2lem 18329	. . . . . 6 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → ((∀𝑣 ∈ {𝑥, 𝑦}𝑧 ≤ 𝑣 ∧ ∀𝑤 ∈ 𝐵 (∀𝑣 ∈ {𝑥, 𝑦}𝑤 ≤ 𝑣 → 𝑤 ≤ 𝑧)) ↔ ((𝑧 ≤ 𝑥 ∧ 𝑧 ≤ 𝑦) ∧ ∀𝑤 ∈ 𝐵 ((𝑤 ≤ 𝑥 ∧ 𝑤 ≤ 𝑦) → 𝑤 ≤ 𝑧))))
16	15	reubidv 3369	. . . . 5 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → (∃!𝑧 ∈ 𝐵 (∀𝑣 ∈ {𝑥, 𝑦}𝑧 ≤ 𝑣 ∧ ∀𝑤 ∈ 𝐵 (∀𝑣 ∈ {𝑥, 𝑦}𝑤 ≤ 𝑣 → 𝑤 ≤ 𝑧)) ↔ ∃!𝑧 ∈ 𝐵 ((𝑧 ≤ 𝑥 ∧ 𝑧 ≤ 𝑦) ∧ ∀𝑤 ∈ 𝐵 ((𝑤 ≤ 𝑥 ∧ 𝑤 ≤ 𝑦) → 𝑤 ≤ 𝑧))))
17	16	adantl 481	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (∃!𝑧 ∈ 𝐵 (∀𝑣 ∈ {𝑥, 𝑦}𝑧 ≤ 𝑣 ∧ ∀𝑤 ∈ 𝐵 (∀𝑣 ∈ {𝑥, 𝑦}𝑤 ≤ 𝑣 → 𝑤 ≤ 𝑧)) ↔ ∃!𝑧 ∈ 𝐵 ((𝑧 ≤ 𝑥 ∧ 𝑧 ≤ 𝑦) ∧ ∀𝑤 ∈ 𝐵 ((𝑤 ≤ 𝑥 ∧ 𝑤 ≤ 𝑦) → 𝑤 ≤ 𝑧))))
18	13, 17	bitrd 279	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ({𝑥, 𝑦} ∈ dom 𝐺 ↔ ∃!𝑧 ∈ 𝐵 ((𝑧 ≤ 𝑥 ∧ 𝑧 ≤ 𝑦) ∧ ∀𝑤 ∈ 𝐵 ((𝑤 ≤ 𝑥 ∧ 𝑤 ≤ 𝑦) → 𝑤 ≤ 𝑧))))
19	18	2ralbidva 3197	. 2 ⊢ (𝜑 → (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 {𝑥, 𝑦} ∈ dom 𝐺 ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∃!𝑧 ∈ 𝐵 ((𝑧 ≤ 𝑥 ∧ 𝑧 ≤ 𝑦) ∧ ∀𝑤 ∈ 𝐵 ((𝑤 ≤ 𝑥 ∧ 𝑤 ≤ 𝑦) → 𝑤 ≤ 𝑧))))
20	5, 19	bitrd 279	1 ⊢ (𝜑 → (dom ∧ = (𝐵 × 𝐵) ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∃!𝑧 ∈ 𝐵 ((𝑧 ≤ 𝑥 ∧ 𝑧 ≤ 𝑦) ∧ ∀𝑤 ∈ 𝐵 ((𝑤 ≤ 𝑥 ∧ 𝑤 ≤ 𝑦) → 𝑤 ≤ 𝑧))))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1540   ∈ wcel 2109  ∀wral 3044  ∃!wreu 3349   ⊆ wss 3911  {cpr 4587   class class class wbr 5102   × cxp 5629  dom cdm 5631  ‘cfv 6499  Basecbs 17155  lecple 17203  glbcglb 18247  meetcmee 18249

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5229  ax-sep 5246  ax-nul 5256  ax-pow 5315  ax-pr 5382  ax-un 7691

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rmo 3351  df-reu 3352  df-rab 3403  df-v 3446  df-sbc 3751  df-csb 3860  df-dif 3914  df-un 3916  df-in 3918  df-ss 3928  df-nul 4293  df-if 4485  df-pw 4561  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4868  df-iun 4953  df-br 5103  df-opab 5165  df-mpt 5184  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-iota 6452  df-fun 6501  df-fn 6502  df-f 6503  df-f1 6504  df-fo 6505  df-f1o 6506  df-fv 6507  df-riota 7326  df-oprab 7373  df-glb 18282  df-meet 18284

This theorem is referenced by: (None)