Theorem joindm2 50020

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

Hypotheses

Ref	Expression
joindm2.b	⊢ 𝐵 = (Base‘𝐾)
joindm2.k	⊢ (𝜑 → 𝐾 ∈ 𝑉)
joindm2.u	⊢ 𝑈 = (lub‘𝐾)
joindm2.j	⊢ ∨ = (join‘𝐾)

Assertion

Ref	Expression
joindm2	⊢ (𝜑 → (dom ∨ = (𝐵 × 𝐵) ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 {𝑥, 𝑦} ∈ dom 𝑈))

Distinct variable groups:   𝑥,𝑦, ∨   𝑥,𝐵,𝑦   𝜑,𝑥,𝑦

Allowed substitution hints:   𝑈(𝑥, 𝑦)   𝐾(𝑥, 𝑦)   𝑉(𝑥, 𝑦)

Proof of Theorem joindm2

Step	Hyp	Ref	Expression
1		joindm2.b	. . . 4 ⊢ 𝐵 = (Base‘𝐾)
2		joindm2.j	. . . 4 ⊢ ∨ = (join‘𝐾)
3		joindm2.k	. . . 4 ⊢ (𝜑 → 𝐾 ∈ 𝑉)
4	1, 2, 3	joindmss 18531	. . 3 ⊢ (𝜑 → dom ∨ ⊆ (𝐵 × 𝐵))
5		eqss 3946	. . . 4 ⊢ (dom ∨ = (𝐵 × 𝐵) ↔ (dom ∨ ⊆ (𝐵 × 𝐵) ∧ (𝐵 × 𝐵) ⊆ dom ∨ ))
6	5	baib 545	. . 3 ⊢ (dom ∨ ⊆ (𝐵 × 𝐵) → (dom ∨ = (𝐵 × 𝐵) ↔ (𝐵 × 𝐵) ⊆ dom ∨ ))
7	4, 6	syl 18	. 2 ⊢ (𝜑 → (dom ∨ = (𝐵 × 𝐵) ↔ (𝐵 × 𝐵) ⊆ dom ∨ ))
8		relxp 5669	. . 3 ⊢ Rel (𝐵 × 𝐵)
9		ssrel 5759	. . 3 ⊢ (Rel (𝐵 × 𝐵) → ((𝐵 × 𝐵) ⊆ dom ∨ ↔ ∀𝑥∀𝑦(⟨𝑥, 𝑦⟩ ∈ (𝐵 × 𝐵) → ⟨𝑥, 𝑦⟩ ∈ dom ∨ )))
10	8, 9	mp1i 14	. 2 ⊢ (𝜑 → ((𝐵 × 𝐵) ⊆ dom ∨ ↔ ∀𝑥∀𝑦(⟨𝑥, 𝑦⟩ ∈ (𝐵 × 𝐵) → ⟨𝑥, 𝑦⟩ ∈ dom ∨ )))
11		opelxp 5687	. . . . . 6 ⊢ (⟨𝑥, 𝑦⟩ ∈ (𝐵 × 𝐵) ↔ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵))
12	11	a1i 11	. . . . 5 ⊢ (𝜑 → (⟨𝑥, 𝑦⟩ ∈ (𝐵 × 𝐵) ↔ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)))
13		joindm2.u	. . . . . 6 ⊢ 𝑈 = (lub‘𝐾)
14		vex 3455	. . . . . . 7 ⊢ 𝑥 ∈ V
15	14	a1i 11	. . . . . 6 ⊢ (𝜑 → 𝑥 ∈ V)
16		vex 3455	. . . . . . 7 ⊢ 𝑦 ∈ V
17	16	a1i 11	. . . . . 6 ⊢ (𝜑 → 𝑦 ∈ V)
18	13, 2, 3, 15, 17	joindef 18528	. . . . 5 ⊢ (𝜑 → (⟨𝑥, 𝑦⟩ ∈ dom ∨ ↔ {𝑥, 𝑦} ∈ dom 𝑈))
19	12, 18	imbi12d 347	. . . 4 ⊢ (𝜑 → ((⟨𝑥, 𝑦⟩ ∈ (𝐵 × 𝐵) → ⟨𝑥, 𝑦⟩ ∈ dom ∨ ) ↔ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → {𝑥, 𝑦} ∈ dom 𝑈)))
20	19	2albidv 1956	. . 3 ⊢ (𝜑 → (∀𝑥∀𝑦(⟨𝑥, 𝑦⟩ ∈ (𝐵 × 𝐵) → ⟨𝑥, 𝑦⟩ ∈ dom ∨ ) ↔ ∀𝑥∀𝑦((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → {𝑥, 𝑦} ∈ dom 𝑈)))
21		r2al 3199	. . 3 ⊢ (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 {𝑥, 𝑦} ∈ dom 𝑈 ↔ ∀𝑥∀𝑦((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → {𝑥, 𝑦} ∈ dom 𝑈))
22	20, 21	bitr4di 292	. 2 ⊢ (𝜑 → (∀𝑥∀𝑦(⟨𝑥, 𝑦⟩ ∈ (𝐵 × 𝐵) → ⟨𝑥, 𝑦⟩ ∈ dom ∨ ) ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 {𝑥, 𝑦} ∈ dom 𝑈))
23	7, 10, 22	3bitrd 308	1 ⊢ (𝜑 → (dom ∨ = (𝐵 × 𝐵) ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 {𝑥, 𝑦} ∈ dom 𝑈))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1568   = wceq 1570   ∈ wcel 2145  ∀wral 3077  Vcvv 3451   ⊆ wss 3899  {cpr 4586  ⟨cop 4590   × cxp 5649  dom cdm 5651  Rel wrel 5656  ‘cfv 6531  Basecbs 17367  lubclub 18463  joincjn 18465

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 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-riota 7369  df-oprab 7416  df-lub 18498  df-join 18500

This theorem is used by:  joindm3  50021  toslat  50034