Theorem meeteu 18466

Description: Uniqueness of meet of elements in the domain. (Contributed by NM, 12-Sep-2018.)

Hypotheses

Ref	Expression
meetval2.b	⊢ 𝐵 = (Base‘𝐾)
meetval2.l	⊢ ≤ = (le‘𝐾)
meetval2.m	⊢ ∧ = (meet‘𝐾)
meetval2.k	⊢ (𝜑 → 𝐾 ∈ 𝑉)
meetval2.x	⊢ (𝜑 → 𝑋 ∈ 𝐵)
meetval2.y	⊢ (𝜑 → 𝑌 ∈ 𝐵)
meetlem.e	⊢ (𝜑 → ⟨𝑋, 𝑌⟩ ∈ dom ∧ )

Assertion

Ref	Expression
meeteu	⊢ (𝜑 → ∃!𝑥 ∈ 𝐵 ((𝑥 ≤ 𝑋 ∧ 𝑥 ≤ 𝑌) ∧ ∀𝑧 ∈ 𝐵 ((𝑧 ≤ 𝑋 ∧ 𝑧 ≤ 𝑌) → 𝑧 ≤ 𝑥)))

Distinct variable groups:   𝑥,𝑧,𝐵   𝑥, ∧ ,𝑧   𝑥,𝐾,𝑧   𝑥,𝑋,𝑧   𝑥,𝑌,𝑧   𝜑,𝑥

Allowed substitution hints:   𝜑(𝑧)   ≤ (𝑥,𝑧)   𝑉(𝑥,𝑧)

Proof of Theorem meeteu

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		meetlem.e	. 2 ⊢ (𝜑 → ⟨𝑋, 𝑌⟩ ∈ dom ∧ )
2		eqid 2740	. . . 4 ⊢ (glb‘𝐾) = (glb‘𝐾)
3		meetval2.m	. . . 4 ⊢ ∧ = (meet‘𝐾)
4		meetval2.k	. . . 4 ⊢ (𝜑 → 𝐾 ∈ 𝑉)
5		meetval2.x	. . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
6		meetval2.y	. . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝐵)
7	2, 3, 4, 5, 6	meetdef 18460	. . 3 ⊢ (𝜑 → (⟨𝑋, 𝑌⟩ ∈ dom ∧ ↔ {𝑋, 𝑌} ∈ dom (glb‘𝐾)))
8		meetval2.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝐾)
9		meetval2.l	. . . . . 6 ⊢ ≤ = (le‘𝐾)
10		biid 261	. . . . . 6 ⊢ ((∀𝑦 ∈ {𝑋, 𝑌}𝑥 ≤ 𝑦 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ {𝑋, 𝑌}𝑧 ≤ 𝑦 → 𝑧 ≤ 𝑥)) ↔ (∀𝑦 ∈ {𝑋, 𝑌}𝑥 ≤ 𝑦 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ {𝑋, 𝑌}𝑧 ≤ 𝑦 → 𝑧 ≤ 𝑥)))
11	4	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ {𝑋, 𝑌} ∈ dom (glb‘𝐾)) → 𝐾 ∈ 𝑉)
12		simpr 484	. . . . . 6 ⊢ ((𝜑 ∧ {𝑋, 𝑌} ∈ dom (glb‘𝐾)) → {𝑋, 𝑌} ∈ dom (glb‘𝐾))
13	8, 9, 2, 10, 11, 12	glbeu 18438	. . . . 5 ⊢ ((𝜑 ∧ {𝑋, 𝑌} ∈ dom (glb‘𝐾)) → ∃!𝑥 ∈ 𝐵 (∀𝑦 ∈ {𝑋, 𝑌}𝑥 ≤ 𝑦 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ {𝑋, 𝑌}𝑧 ≤ 𝑦 → 𝑧 ≤ 𝑥)))
14	13	ex 412	. . . 4 ⊢ (𝜑 → ({𝑋, 𝑌} ∈ dom (glb‘𝐾) → ∃!𝑥 ∈ 𝐵 (∀𝑦 ∈ {𝑋, 𝑌}𝑥 ≤ 𝑦 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ {𝑋, 𝑌}𝑧 ≤ 𝑦 → 𝑧 ≤ 𝑥))))
15	8, 9, 3, 4, 5, 6	meetval2lem 18464	. . . . . 6 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((∀𝑦 ∈ {𝑋, 𝑌}𝑥 ≤ 𝑦 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ {𝑋, 𝑌}𝑧 ≤ 𝑦 → 𝑧 ≤ 𝑥)) ↔ ((𝑥 ≤ 𝑋 ∧ 𝑥 ≤ 𝑌) ∧ ∀𝑧 ∈ 𝐵 ((𝑧 ≤ 𝑋 ∧ 𝑧 ≤ 𝑌) → 𝑧 ≤ 𝑥))))
16	5, 6, 15	syl2anc 583	. . . . 5 ⊢ (𝜑 → ((∀𝑦 ∈ {𝑋, 𝑌}𝑥 ≤ 𝑦 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ {𝑋, 𝑌}𝑧 ≤ 𝑦 → 𝑧 ≤ 𝑥)) ↔ ((𝑥 ≤ 𝑋 ∧ 𝑥 ≤ 𝑌) ∧ ∀𝑧 ∈ 𝐵 ((𝑧 ≤ 𝑋 ∧ 𝑧 ≤ 𝑌) → 𝑧 ≤ 𝑥))))
17	16	reubidv 3406	. . . 4 ⊢ (𝜑 → (∃!𝑥 ∈ 𝐵 (∀𝑦 ∈ {𝑋, 𝑌}𝑥 ≤ 𝑦 ∧ ∀𝑧 ∈ 𝐵 (∀𝑦 ∈ {𝑋, 𝑌}𝑧 ≤ 𝑦 → 𝑧 ≤ 𝑥)) ↔ ∃!𝑥 ∈ 𝐵 ((𝑥 ≤ 𝑋 ∧ 𝑥 ≤ 𝑌) ∧ ∀𝑧 ∈ 𝐵 ((𝑧 ≤ 𝑋 ∧ 𝑧 ≤ 𝑌) → 𝑧 ≤ 𝑥))))
18	14, 17	sylibd 239	. . 3 ⊢ (𝜑 → ({𝑋, 𝑌} ∈ dom (glb‘𝐾) → ∃!𝑥 ∈ 𝐵 ((𝑥 ≤ 𝑋 ∧ 𝑥 ≤ 𝑌) ∧ ∀𝑧 ∈ 𝐵 ((𝑧 ≤ 𝑋 ∧ 𝑧 ≤ 𝑌) → 𝑧 ≤ 𝑥))))
19	7, 18	sylbid 240	. 2 ⊢ (𝜑 → (⟨𝑋, 𝑌⟩ ∈ dom ∧ → ∃!𝑥 ∈ 𝐵 ((𝑥 ≤ 𝑋 ∧ 𝑥 ≤ 𝑌) ∧ ∀𝑧 ∈ 𝐵 ((𝑧 ≤ 𝑋 ∧ 𝑧 ≤ 𝑌) → 𝑧 ≤ 𝑥))))
20	1, 19	mpd 15	1 ⊢ (𝜑 → ∃!𝑥 ∈ 𝐵 ((𝑥 ≤ 𝑋 ∧ 𝑥 ≤ 𝑌) ∧ ∀𝑧 ∈ 𝐵 ((𝑧 ≤ 𝑋 ∧ 𝑧 ≤ 𝑌) → 𝑧 ≤ 𝑥)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1537   ∈ wcel 2108  ∀wral 3067  ∃!wreu 3386  {cpr 4650  ⟨cop 4654   class class class wbr 5166  dom cdm 5700  ‘cfv 6573  Basecbs 17258  lecple 17318  glbcglb 18380  meetcmee 18382

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-rep 5303  ax-sep 5317  ax-nul 5324  ax-pow 5383  ax-pr 5447  ax-un 7770

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-rmo 3388  df-reu 3389  df-rab 3444  df-v 3490  df-sbc 3805  df-csb 3922  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-iun 5017  df-br 5167  df-opab 5229  df-mpt 5250  df-id 5593  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-f1 6578  df-fo 6579  df-f1o 6580  df-fv 6581  df-riota 7404  df-oprab 7452  df-glb 18417  df-meet 18419

This theorem is referenced by:  meetlem  18467