Theorem lub0N 40065

Description: The least upper bound of the empty set is the zero element. (Contributed by NM, 15-Sep-2013.) (New usage is discouraged.)

Hypotheses

Ref	Expression
lub0.u	⊢ 1 = (lub‘𝐾)
lub0.z	⊢ 0 = (0.‘𝐾)

Assertion

Ref	Expression
lub0N	⊢ (𝐾 ∈ OP → ( 1 ‘∅) = 0 )

Proof of Theorem lub0N

Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2760	. . 3 ⊢ (Base‘𝐾) = (Base‘𝐾)
2		eqid 2760	. . 3 ⊢ (le‘𝐾) = (le‘𝐾)
3		lub0.u	. . 3 ⊢ 1 = (lub‘𝐾)
4		biid 264	. . 3 ⊢ ((∀𝑦 ∈ ∅ 𝑦(le‘𝐾)𝑥 ∧ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦 ∈ ∅ 𝑦(le‘𝐾)𝑧 → 𝑥(le‘𝐾)𝑧)) ↔ (∀𝑦 ∈ ∅ 𝑦(le‘𝐾)𝑥 ∧ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦 ∈ ∅ 𝑦(le‘𝐾)𝑧 → 𝑥(le‘𝐾)𝑧)))
5		id 23	. . 3 ⊢ (𝐾 ∈ OP → 𝐾 ∈ OP)
6		0ss 4350	. . . 4 ⊢ ∅ ⊆ (Base‘𝐾)
7	6	a1i 11	. . 3 ⊢ (𝐾 ∈ OP → ∅ ⊆ (Base‘𝐾))
8	1, 2, 3, 4, 5, 7	lubval 18445	. 2 ⊢ (𝐾 ∈ OP → ( 1 ‘∅) = (℩𝑥 ∈ (Base‘𝐾)(∀𝑦 ∈ ∅ 𝑦(le‘𝐾)𝑥 ∧ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦 ∈ ∅ 𝑦(le‘𝐾)𝑧 → 𝑥(le‘𝐾)𝑧))))
9		lub0.z	. . . 4 ⊢ 0 = (0.‘𝐾)
10	1, 9	op0cl 40060	. . 3 ⊢ (𝐾 ∈ OP → 0 ∈ (Base‘𝐾))
11		ral0 4454	. . . . . . 7 ⊢ ∀𝑦 ∈ ∅ 𝑦(le‘𝐾)𝑧
12	11	a1bi 365	. . . . . 6 ⊢ (𝑥(le‘𝐾)𝑧 ↔ (∀𝑦 ∈ ∅ 𝑦(le‘𝐾)𝑧 → 𝑥(le‘𝐾)𝑧))
13	12	ralbii 3108	. . . . 5 ⊢ (∀𝑧 ∈ (Base‘𝐾)𝑥(le‘𝐾)𝑧 ↔ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦 ∈ ∅ 𝑦(le‘𝐾)𝑧 → 𝑥(le‘𝐾)𝑧))
14		ral0 4454	. . . . . 6 ⊢ ∀𝑦 ∈ ∅ 𝑦(le‘𝐾)𝑥
15	14	biantrur 540	. . . . 5 ⊢ (∀𝑧 ∈ (Base‘𝐾)(∀𝑦 ∈ ∅ 𝑦(le‘𝐾)𝑧 → 𝑥(le‘𝐾)𝑧) ↔ (∀𝑦 ∈ ∅ 𝑦(le‘𝐾)𝑥 ∧ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦 ∈ ∅ 𝑦(le‘𝐾)𝑧 → 𝑥(le‘𝐾)𝑧)))
16	13, 15	bitri 278	. . . 4 ⊢ (∀𝑧 ∈ (Base‘𝐾)𝑥(le‘𝐾)𝑧 ↔ (∀𝑦 ∈ ∅ 𝑦(le‘𝐾)𝑥 ∧ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦 ∈ ∅ 𝑦(le‘𝐾)𝑧 → 𝑥(le‘𝐾)𝑧)))
17	10	adantr 486	. . . . . . 7 ⊢ ((𝐾 ∈ OP ∧ 𝑥 ∈ (Base‘𝐾)) → 0 ∈ (Base‘𝐾))
18		breq2 5107	. . . . . . . 8 ⊢ (𝑧 = 0 → (𝑥(le‘𝐾)𝑧 ↔ 𝑥(le‘𝐾) 0 ))
19	18	rspcv 3572	. . . . . . 7 ⊢ ( 0 ∈ (Base‘𝐾) → (∀𝑧 ∈ (Base‘𝐾)𝑥(le‘𝐾)𝑧 → 𝑥(le‘𝐾) 0 ))
20	17, 19	syl 18	. . . . . 6 ⊢ ((𝐾 ∈ OP ∧ 𝑥 ∈ (Base‘𝐾)) → (∀𝑧 ∈ (Base‘𝐾)𝑥(le‘𝐾)𝑧 → 𝑥(le‘𝐾) 0 ))
21	1, 2, 9	ople0 40063	. . . . . 6 ⊢ ((𝐾 ∈ OP ∧ 𝑥 ∈ (Base‘𝐾)) → (𝑥(le‘𝐾) 0 ↔ 𝑥 = 0 ))
22	20, 21	sylibd 242	. . . . 5 ⊢ ((𝐾 ∈ OP ∧ 𝑥 ∈ (Base‘𝐾)) → (∀𝑧 ∈ (Base‘𝐾)𝑥(le‘𝐾)𝑧 → 𝑥 = 0 ))
23	1, 2, 9	op0le 40062	. . . . . . . . . 10 ⊢ ((𝐾 ∈ OP ∧ 𝑧 ∈ (Base‘𝐾)) → 0 (le‘𝐾)𝑧)
24	23	adantlr 728	. . . . . . . . 9 ⊢ (((𝐾 ∈ OP ∧ 𝑥 ∈ (Base‘𝐾)) ∧ 𝑧 ∈ (Base‘𝐾)) → 0 (le‘𝐾)𝑧)
25	24	ex 418	. . . . . . . 8 ⊢ ((𝐾 ∈ OP ∧ 𝑥 ∈ (Base‘𝐾)) → (𝑧 ∈ (Base‘𝐾) → 0 (le‘𝐾)𝑧))
26		breq1 5106	. . . . . . . . 9 ⊢ (𝑥 = 0 → (𝑥(le‘𝐾)𝑧 ↔ 0 (le‘𝐾)𝑧))
27	26	biimprcd 253	. . . . . . . 8 ⊢ ( 0 (le‘𝐾)𝑧 → (𝑥 = 0 → 𝑥(le‘𝐾)𝑧))
28	25, 27	syl6 36	. . . . . . 7 ⊢ ((𝐾 ∈ OP ∧ 𝑥 ∈ (Base‘𝐾)) → (𝑧 ∈ (Base‘𝐾) → (𝑥 = 0 → 𝑥(le‘𝐾)𝑧)))
29	28	com23 87	. . . . . 6 ⊢ ((𝐾 ∈ OP ∧ 𝑥 ∈ (Base‘𝐾)) → (𝑥 = 0 → (𝑧 ∈ (Base‘𝐾) → 𝑥(le‘𝐾)𝑧)))
30	29	ralrimdv 3160	. . . . 5 ⊢ ((𝐾 ∈ OP ∧ 𝑥 ∈ (Base‘𝐾)) → (𝑥 = 0 → ∀𝑧 ∈ (Base‘𝐾)𝑥(le‘𝐾)𝑧))
31	22, 30	impbid 215	. . . 4 ⊢ ((𝐾 ∈ OP ∧ 𝑥 ∈ (Base‘𝐾)) → (∀𝑧 ∈ (Base‘𝐾)𝑥(le‘𝐾)𝑧 ↔ 𝑥 = 0 ))
32	16, 31	bitr3id 288	. . 3 ⊢ ((𝐾 ∈ OP ∧ 𝑥 ∈ (Base‘𝐾)) → ((∀𝑦 ∈ ∅ 𝑦(le‘𝐾)𝑥 ∧ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦 ∈ ∅ 𝑦(le‘𝐾)𝑧 → 𝑥(le‘𝐾)𝑧)) ↔ 𝑥 = 0 ))
33	10, 32	riota5 7400	. 2 ⊢ (𝐾 ∈ OP → (℩𝑥 ∈ (Base‘𝐾)(∀𝑦 ∈ ∅ 𝑦(le‘𝐾)𝑥 ∧ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦 ∈ ∅ 𝑦(le‘𝐾)𝑧 → 𝑥(le‘𝐾)𝑧))) = 0 )
34	8, 33	eqtrd 2795	1 ⊢ (𝐾 ∈ OP → ( 1 ‘∅) = 0 )

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3076   ⊆ wss 3899  ∅c0 4279   class class class wbr 5103  ‘cfv 6533  ℩crio 7370  Basecbs 17304  lecple 17352  lubclub 18400  0.cp0 18512  OPcops 40048

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 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398

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 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  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 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-riota 7371  df-ov 7417  df-proset 18385  df-poset 18404  df-lub 18435  df-glb 18436  df-p0 18514  df-oposet 40052

This theorem is used by: (None)