Theorem lublecllem 18525

Description: Lemma for lublecl 18526 and lubid 18527. (Contributed by NM, 8-Sep-2018.)

Hypotheses

Ref	Expression
lublecl.b	⊢ 𝐵 = (Base‘𝐾)
lublecl.l	⊢ ≤ = (le‘𝐾)
lublecl.u	⊢ 𝑈 = (lub‘𝐾)
lublecl.k	⊢ (𝜑 → 𝐾 ∈ Poset)
lublecl.x	⊢ (𝜑 → 𝑋 ∈ 𝐵)

Assertion

Ref	Expression
lublecllem	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ((∀𝑧 ∈ {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑋}𝑧 ≤ 𝑥 ∧ ∀𝑤 ∈ 𝐵 (∀𝑧 ∈ {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑋}𝑧 ≤ 𝑤 → 𝑥 ≤ 𝑤)) ↔ 𝑥 = 𝑋))

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

Allowed substitution hints:   𝜑(𝑦, 𝑧)   𝑈(𝑥, 𝑦, 𝑧, 𝑤)   𝐾(𝑦)

Proof of Theorem lublecllem

Step	Hyp	Ref	Expression
1		breq1 5106	. . . 4 ⊢ (𝑦 = 𝑧 → (𝑦 ≤ 𝑋 ↔ 𝑧 ≤ 𝑋))
2	1	ralrab 3652	. . 3 ⊢ (∀𝑧 ∈ {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑋}𝑧 ≤ 𝑥 ↔ ∀𝑧 ∈ 𝐵 (𝑧 ≤ 𝑋 → 𝑧 ≤ 𝑥))
3	1	ralrab 3652	. . . . 5 ⊢ (∀𝑧 ∈ {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑋}𝑧 ≤ 𝑤 ↔ ∀𝑧 ∈ 𝐵 (𝑧 ≤ 𝑋 → 𝑧 ≤ 𝑤))
4	3	imbi1i 352	. . . 4 ⊢ ((∀𝑧 ∈ {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑋}𝑧 ≤ 𝑤 → 𝑥 ≤ 𝑤) ↔ (∀𝑧 ∈ 𝐵 (𝑧 ≤ 𝑋 → 𝑧 ≤ 𝑤) → 𝑥 ≤ 𝑤))
5	4	ralbii 3109	. . 3 ⊢ (∀𝑤 ∈ 𝐵 (∀𝑧 ∈ {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑋}𝑧 ≤ 𝑤 → 𝑥 ≤ 𝑤) ↔ ∀𝑤 ∈ 𝐵 (∀𝑧 ∈ 𝐵 (𝑧 ≤ 𝑋 → 𝑧 ≤ 𝑤) → 𝑥 ≤ 𝑤))
6	2, 5	anbi12i 640	. 2 ⊢ ((∀𝑧 ∈ {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑋}𝑧 ≤ 𝑥 ∧ ∀𝑤 ∈ 𝐵 (∀𝑧 ∈ {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑋}𝑧 ≤ 𝑤 → 𝑥 ≤ 𝑤)) ↔ (∀𝑧 ∈ 𝐵 (𝑧 ≤ 𝑋 → 𝑧 ≤ 𝑥) ∧ ∀𝑤 ∈ 𝐵 (∀𝑧 ∈ 𝐵 (𝑧 ≤ 𝑋 → 𝑧 ≤ 𝑤) → 𝑥 ≤ 𝑤)))
7		lublecl.x	. . . . . 6 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
8		lublecl.k	. . . . . . . 8 ⊢ (𝜑 → 𝐾 ∈ Poset)
9		lublecl.b	. . . . . . . . 9 ⊢ 𝐵 = (Base‘𝐾)
10		lublecl.l	. . . . . . . . 9 ⊢ ≤ = (le‘𝐾)
11	9, 10	posref 18485	. . . . . . . 8 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵) → 𝑋 ≤ 𝑋)
12	8, 7, 11	syl2anc 596	. . . . . . 7 ⊢ (𝜑 → 𝑋 ≤ 𝑋)
13		breq1 5106	. . . . . . . . 9 ⊢ (𝑧 = 𝑋 → (𝑧 ≤ 𝑋 ↔ 𝑋 ≤ 𝑋))
14		breq1 5106	. . . . . . . . 9 ⊢ (𝑧 = 𝑋 → (𝑧 ≤ 𝑥 ↔ 𝑋 ≤ 𝑥))
15	13, 14	imbi12d 347	. . . . . . . 8 ⊢ (𝑧 = 𝑋 → ((𝑧 ≤ 𝑋 → 𝑧 ≤ 𝑥) ↔ (𝑋 ≤ 𝑋 → 𝑋 ≤ 𝑥)))
16	15	rspcva 3575	. . . . . . 7 ⊢ ((𝑋 ∈ 𝐵 ∧ ∀𝑧 ∈ 𝐵 (𝑧 ≤ 𝑋 → 𝑧 ≤ 𝑥)) → (𝑋 ≤ 𝑋 → 𝑋 ≤ 𝑥))
17	12, 16	syl5com 32	. . . . . 6 ⊢ (𝜑 → ((𝑋 ∈ 𝐵 ∧ ∀𝑧 ∈ 𝐵 (𝑧 ≤ 𝑋 → 𝑧 ≤ 𝑥)) → 𝑋 ≤ 𝑥))
18	7, 17	mpand 708	. . . . 5 ⊢ (𝜑 → (∀𝑧 ∈ 𝐵 (𝑧 ≤ 𝑋 → 𝑧 ≤ 𝑥) → 𝑋 ≤ 𝑥))
19	18	adantr 486	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (∀𝑧 ∈ 𝐵 (𝑧 ≤ 𝑋 → 𝑧 ≤ 𝑥) → 𝑋 ≤ 𝑥))
20		idd 25	. . . . . . 7 ⊢ (𝑧 ∈ 𝐵 → (𝑧 ≤ 𝑋 → 𝑧 ≤ 𝑋))
21	20	rgen 3079	. . . . . 6 ⊢ ∀𝑧 ∈ 𝐵 (𝑧 ≤ 𝑋 → 𝑧 ≤ 𝑋)
22		breq2 5107	. . . . . . . . . . 11 ⊢ (𝑤 = 𝑋 → (𝑧 ≤ 𝑤 ↔ 𝑧 ≤ 𝑋))
23	22	imbi2d 343	. . . . . . . . . 10 ⊢ (𝑤 = 𝑋 → ((𝑧 ≤ 𝑋 → 𝑧 ≤ 𝑤) ↔ (𝑧 ≤ 𝑋 → 𝑧 ≤ 𝑋)))
24	23	ralbidv 3186	. . . . . . . . 9 ⊢ (𝑤 = 𝑋 → (∀𝑧 ∈ 𝐵 (𝑧 ≤ 𝑋 → 𝑧 ≤ 𝑤) ↔ ∀𝑧 ∈ 𝐵 (𝑧 ≤ 𝑋 → 𝑧 ≤ 𝑋)))
25		breq2 5107	. . . . . . . . 9 ⊢ (𝑤 = 𝑋 → (𝑥 ≤ 𝑤 ↔ 𝑥 ≤ 𝑋))
26	24, 25	imbi12d 347	. . . . . . . 8 ⊢ (𝑤 = 𝑋 → ((∀𝑧 ∈ 𝐵 (𝑧 ≤ 𝑋 → 𝑧 ≤ 𝑤) → 𝑥 ≤ 𝑤) ↔ (∀𝑧 ∈ 𝐵 (𝑧 ≤ 𝑋 → 𝑧 ≤ 𝑋) → 𝑥 ≤ 𝑋)))
27	26	rspcv 3573	. . . . . . 7 ⊢ (𝑋 ∈ 𝐵 → (∀𝑤 ∈ 𝐵 (∀𝑧 ∈ 𝐵 (𝑧 ≤ 𝑋 → 𝑧 ≤ 𝑤) → 𝑥 ≤ 𝑤) → (∀𝑧 ∈ 𝐵 (𝑧 ≤ 𝑋 → 𝑧 ≤ 𝑋) → 𝑥 ≤ 𝑋)))
28	7, 27	syl 18	. . . . . 6 ⊢ (𝜑 → (∀𝑤 ∈ 𝐵 (∀𝑧 ∈ 𝐵 (𝑧 ≤ 𝑋 → 𝑧 ≤ 𝑤) → 𝑥 ≤ 𝑤) → (∀𝑧 ∈ 𝐵 (𝑧 ≤ 𝑋 → 𝑧 ≤ 𝑋) → 𝑥 ≤ 𝑋)))
29	21, 28	mpii 47	. . . . 5 ⊢ (𝜑 → (∀𝑤 ∈ 𝐵 (∀𝑧 ∈ 𝐵 (𝑧 ≤ 𝑋 → 𝑧 ≤ 𝑤) → 𝑥 ≤ 𝑤) → 𝑥 ≤ 𝑋))
30	29	adantr 486	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (∀𝑤 ∈ 𝐵 (∀𝑧 ∈ 𝐵 (𝑧 ≤ 𝑋 → 𝑧 ≤ 𝑤) → 𝑥 ≤ 𝑤) → 𝑥 ≤ 𝑋))
31	8	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝐾 ∈ Poset)
32		simpr 490	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ 𝐵)
33	7	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝑋 ∈ 𝐵)
34	9, 10	posasymb 18486	. . . . . . 7 ⊢ ((𝐾 ∈ Poset ∧ 𝑥 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → ((𝑥 ≤ 𝑋 ∧ 𝑋 ≤ 𝑥) ↔ 𝑥 = 𝑋))
35	31, 32, 33, 34	syl3anc 1398	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ((𝑥 ≤ 𝑋 ∧ 𝑋 ≤ 𝑥) ↔ 𝑥 = 𝑋))
36	35	biimpd 232	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ((𝑥 ≤ 𝑋 ∧ 𝑋 ≤ 𝑥) → 𝑥 = 𝑋))
37	36	ancomsd 471	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ((𝑋 ≤ 𝑥 ∧ 𝑥 ≤ 𝑋) → 𝑥 = 𝑋))
38	19, 30, 37	syl2and 620	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ((∀𝑧 ∈ 𝐵 (𝑧 ≤ 𝑋 → 𝑧 ≤ 𝑥) ∧ ∀𝑤 ∈ 𝐵 (∀𝑧 ∈ 𝐵 (𝑧 ≤ 𝑋 → 𝑧 ≤ 𝑤) → 𝑥 ≤ 𝑤)) → 𝑥 = 𝑋))
39		breq2 5107	. . . . . . . 8 ⊢ (𝑥 = 𝑋 → (𝑧 ≤ 𝑥 ↔ 𝑧 ≤ 𝑋))
40	39	biimprd 251	. . . . . . 7 ⊢ (𝑥 = 𝑋 → (𝑧 ≤ 𝑋 → 𝑧 ≤ 𝑥))
41	40	ralrimivw 3159	. . . . . 6 ⊢ (𝑥 = 𝑋 → ∀𝑧 ∈ 𝐵 (𝑧 ≤ 𝑋 → 𝑧 ≤ 𝑥))
42	41	adantl 487	. . . . 5 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑥 = 𝑋) → ∀𝑧 ∈ 𝐵 (𝑧 ≤ 𝑋 → 𝑧 ≤ 𝑥))
43	7	adantr 486	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 = 𝑋) → 𝑋 ∈ 𝐵)
44		breq1 5106	. . . . . . . . . . 11 ⊢ (𝑧 = 𝑋 → (𝑧 ≤ 𝑤 ↔ 𝑋 ≤ 𝑤))
45	13, 44	imbi12d 347	. . . . . . . . . 10 ⊢ (𝑧 = 𝑋 → ((𝑧 ≤ 𝑋 → 𝑧 ≤ 𝑤) ↔ (𝑋 ≤ 𝑋 → 𝑋 ≤ 𝑤)))
46	45	rspcva 3575	. . . . . . . . 9 ⊢ ((𝑋 ∈ 𝐵 ∧ ∀𝑧 ∈ 𝐵 (𝑧 ≤ 𝑋 → 𝑧 ≤ 𝑤)) → (𝑋 ≤ 𝑋 → 𝑋 ≤ 𝑤))
47		pm5.5 364	. . . . . . . . . . 11 ⊢ (𝑋 ≤ 𝑋 → ((𝑋 ≤ 𝑋 → 𝑋 ≤ 𝑤) ↔ 𝑋 ≤ 𝑤))
48	12, 47	syl 18	. . . . . . . . . 10 ⊢ (𝜑 → ((𝑋 ≤ 𝑋 → 𝑋 ≤ 𝑤) ↔ 𝑋 ≤ 𝑤))
49		breq1 5106	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑋 → (𝑥 ≤ 𝑤 ↔ 𝑋 ≤ 𝑤))
50	49	bicomd 226	. . . . . . . . . 10 ⊢ (𝑥 = 𝑋 → (𝑋 ≤ 𝑤 ↔ 𝑥 ≤ 𝑤))
51	48, 50	sylan9bb 519	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 = 𝑋) → ((𝑋 ≤ 𝑋 → 𝑋 ≤ 𝑤) ↔ 𝑥 ≤ 𝑤))
52	46, 51	imbitrid 247	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 = 𝑋) → ((𝑋 ∈ 𝐵 ∧ ∀𝑧 ∈ 𝐵 (𝑧 ≤ 𝑋 → 𝑧 ≤ 𝑤)) → 𝑥 ≤ 𝑤))
53	43, 52	mpand 708	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 = 𝑋) → (∀𝑧 ∈ 𝐵 (𝑧 ≤ 𝑋 → 𝑧 ≤ 𝑤) → 𝑥 ≤ 𝑤))
54	53	ralrimivw 3159	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 = 𝑋) → ∀𝑤 ∈ 𝐵 (∀𝑧 ∈ 𝐵 (𝑧 ≤ 𝑋 → 𝑧 ≤ 𝑤) → 𝑥 ≤ 𝑤))
55	54	adantlr 728	. . . . 5 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑥 = 𝑋) → ∀𝑤 ∈ 𝐵 (∀𝑧 ∈ 𝐵 (𝑧 ≤ 𝑋 → 𝑧 ≤ 𝑤) → 𝑥 ≤ 𝑤))
56	42, 55	jca 521	. . . 4 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑥 = 𝑋) → (∀𝑧 ∈ 𝐵 (𝑧 ≤ 𝑋 → 𝑧 ≤ 𝑥) ∧ ∀𝑤 ∈ 𝐵 (∀𝑧 ∈ 𝐵 (𝑧 ≤ 𝑋 → 𝑧 ≤ 𝑤) → 𝑥 ≤ 𝑤)))
57	56	ex 418	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝑥 = 𝑋 → (∀𝑧 ∈ 𝐵 (𝑧 ≤ 𝑋 → 𝑧 ≤ 𝑥) ∧ ∀𝑤 ∈ 𝐵 (∀𝑧 ∈ 𝐵 (𝑧 ≤ 𝑋 → 𝑧 ≤ 𝑤) → 𝑥 ≤ 𝑤))))
58	38, 57	impbid 215	. 2 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ((∀𝑧 ∈ 𝐵 (𝑧 ≤ 𝑋 → 𝑧 ≤ 𝑥) ∧ ∀𝑤 ∈ 𝐵 (∀𝑧 ∈ 𝐵 (𝑧 ≤ 𝑋 → 𝑧 ≤ 𝑤) → 𝑥 ≤ 𝑤)) ↔ 𝑥 = 𝑋))
59	6, 58	bitrid 286	1 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ((∀𝑧 ∈ {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑋}𝑧 ≤ 𝑥 ∧ ∀𝑤 ∈ 𝐵 (∀𝑧 ∈ {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑋}𝑧 ≤ 𝑤 → 𝑥 ≤ 𝑤)) ↔ 𝑥 = 𝑋))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3077  {crab 3413   class class class wbr 5103  ‘cfv 6537  Basecbs 17380  lecple 17428  Posetcpo 18474  lubclub 18476

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-ext 2733  ax-nul 5260

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-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-sbc 3740  df-dif 3902  df-un 3904  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-iota 6493  df-fv 6545  df-proset 18461  df-poset 18480

This theorem is used by:  lublecl  18526  lubid  18527