Theorem isdrs 18269

Description: Property of being a directed set. (Contributed by Stefan O'Rear, 1-Feb-2015.)

Hypotheses

Ref	Expression
isdrs.b	⊢ 𝐵 = (Base‘𝐾)
isdrs.l	⊢ ≤ = (le‘𝐾)

Assertion

Ref	Expression
isdrs	⊢ (𝐾 ∈ Dirset ↔ (𝐾 ∈ Proset ∧ 𝐵 ≠ ∅ ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐵 (𝑥 ≤ 𝑧 ∧ 𝑦 ≤ 𝑧)))

Distinct variable groups:   𝑥,𝐾,𝑦,𝑧   𝑥,𝐵,𝑦,𝑧   𝑥, ≤ ,𝑦,𝑧

Proof of Theorem isdrs

Dummy variables 𝑓 𝑏 𝑟 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		fveq2 6861	. . . . . 6 ⊢ (𝑓 = 𝐾 → (Base‘𝑓) = (Base‘𝐾))
2		isdrs.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝐾)
3	1, 2	eqtr4di 2783	. . . . 5 ⊢ (𝑓 = 𝐾 → (Base‘𝑓) = 𝐵)
4		fveq2 6861	. . . . . . 7 ⊢ (𝑓 = 𝐾 → (le‘𝑓) = (le‘𝐾))
5		isdrs.l	. . . . . . 7 ⊢ ≤ = (le‘𝐾)
6	4, 5	eqtr4di 2783	. . . . . 6 ⊢ (𝑓 = 𝐾 → (le‘𝑓) = ≤ )
7	6	sbceq1d 3761	. . . . 5 ⊢ (𝑓 = 𝐾 → ([(le‘𝑓) / 𝑟](𝑏 ≠ ∅ ∧ ∀𝑥 ∈ 𝑏 ∀𝑦 ∈ 𝑏 ∃𝑧 ∈ 𝑏 (𝑥𝑟𝑧 ∧ 𝑦𝑟𝑧)) ↔ [ ≤ / 𝑟](𝑏 ≠ ∅ ∧ ∀𝑥 ∈ 𝑏 ∀𝑦 ∈ 𝑏 ∃𝑧 ∈ 𝑏 (𝑥𝑟𝑧 ∧ 𝑦𝑟𝑧))))
8	3, 7	sbceqbid 3763	. . . 4 ⊢ (𝑓 = 𝐾 → ([(Base‘𝑓) / 𝑏][(le‘𝑓) / 𝑟](𝑏 ≠ ∅ ∧ ∀𝑥 ∈ 𝑏 ∀𝑦 ∈ 𝑏 ∃𝑧 ∈ 𝑏 (𝑥𝑟𝑧 ∧ 𝑦𝑟𝑧)) ↔ [𝐵 / 𝑏][ ≤ / 𝑟](𝑏 ≠ ∅ ∧ ∀𝑥 ∈ 𝑏 ∀𝑦 ∈ 𝑏 ∃𝑧 ∈ 𝑏 (𝑥𝑟𝑧 ∧ 𝑦𝑟𝑧))))
9	2	fvexi 6875	. . . . 5 ⊢ 𝐵 ∈ V
10	5	fvexi 6875	. . . . 5 ⊢ ≤ ∈ V
11		neeq1 2988	. . . . . . 7 ⊢ (𝑏 = 𝐵 → (𝑏 ≠ ∅ ↔ 𝐵 ≠ ∅))
12	11	adantr 480	. . . . . 6 ⊢ ((𝑏 = 𝐵 ∧ 𝑟 = ≤ ) → (𝑏 ≠ ∅ ↔ 𝐵 ≠ ∅))
13		rexeq 3297	. . . . . . . . 9 ⊢ (𝑏 = 𝐵 → (∃𝑧 ∈ 𝑏 (𝑥𝑟𝑧 ∧ 𝑦𝑟𝑧) ↔ ∃𝑧 ∈ 𝐵 (𝑥𝑟𝑧 ∧ 𝑦𝑟𝑧)))
14	13	raleqbi1dv 3313	. . . . . . . 8 ⊢ (𝑏 = 𝐵 → (∀𝑦 ∈ 𝑏 ∃𝑧 ∈ 𝑏 (𝑥𝑟𝑧 ∧ 𝑦𝑟𝑧) ↔ ∀𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐵 (𝑥𝑟𝑧 ∧ 𝑦𝑟𝑧)))
15	14	raleqbi1dv 3313	. . . . . . 7 ⊢ (𝑏 = 𝐵 → (∀𝑥 ∈ 𝑏 ∀𝑦 ∈ 𝑏 ∃𝑧 ∈ 𝑏 (𝑥𝑟𝑧 ∧ 𝑦𝑟𝑧) ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐵 (𝑥𝑟𝑧 ∧ 𝑦𝑟𝑧)))
16		breq 5112	. . . . . . . . . 10 ⊢ (𝑟 = ≤ → (𝑥𝑟𝑧 ↔ 𝑥 ≤ 𝑧))
17		breq 5112	. . . . . . . . . 10 ⊢ (𝑟 = ≤ → (𝑦𝑟𝑧 ↔ 𝑦 ≤ 𝑧))
18	16, 17	anbi12d 632	. . . . . . . . 9 ⊢ (𝑟 = ≤ → ((𝑥𝑟𝑧 ∧ 𝑦𝑟𝑧) ↔ (𝑥 ≤ 𝑧 ∧ 𝑦 ≤ 𝑧)))
19	18	rexbidv 3158	. . . . . . . 8 ⊢ (𝑟 = ≤ → (∃𝑧 ∈ 𝐵 (𝑥𝑟𝑧 ∧ 𝑦𝑟𝑧) ↔ ∃𝑧 ∈ 𝐵 (𝑥 ≤ 𝑧 ∧ 𝑦 ≤ 𝑧)))
20	19	2ralbidv 3202	. . . . . . 7 ⊢ (𝑟 = ≤ → (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐵 (𝑥𝑟𝑧 ∧ 𝑦𝑟𝑧) ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐵 (𝑥 ≤ 𝑧 ∧ 𝑦 ≤ 𝑧)))
21	15, 20	sylan9bb 509	. . . . . 6 ⊢ ((𝑏 = 𝐵 ∧ 𝑟 = ≤ ) → (∀𝑥 ∈ 𝑏 ∀𝑦 ∈ 𝑏 ∃𝑧 ∈ 𝑏 (𝑥𝑟𝑧 ∧ 𝑦𝑟𝑧) ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐵 (𝑥 ≤ 𝑧 ∧ 𝑦 ≤ 𝑧)))
22	12, 21	anbi12d 632	. . . . 5 ⊢ ((𝑏 = 𝐵 ∧ 𝑟 = ≤ ) → ((𝑏 ≠ ∅ ∧ ∀𝑥 ∈ 𝑏 ∀𝑦 ∈ 𝑏 ∃𝑧 ∈ 𝑏 (𝑥𝑟𝑧 ∧ 𝑦𝑟𝑧)) ↔ (𝐵 ≠ ∅ ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐵 (𝑥 ≤ 𝑧 ∧ 𝑦 ≤ 𝑧))))
23	9, 10, 22	sbc2ie 3832	. . . 4 ⊢ ([𝐵 / 𝑏][ ≤ / 𝑟](𝑏 ≠ ∅ ∧ ∀𝑥 ∈ 𝑏 ∀𝑦 ∈ 𝑏 ∃𝑧 ∈ 𝑏 (𝑥𝑟𝑧 ∧ 𝑦𝑟𝑧)) ↔ (𝐵 ≠ ∅ ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐵 (𝑥 ≤ 𝑧 ∧ 𝑦 ≤ 𝑧)))
24	8, 23	bitrdi 287	. . 3 ⊢ (𝑓 = 𝐾 → ([(Base‘𝑓) / 𝑏][(le‘𝑓) / 𝑟](𝑏 ≠ ∅ ∧ ∀𝑥 ∈ 𝑏 ∀𝑦 ∈ 𝑏 ∃𝑧 ∈ 𝑏 (𝑥𝑟𝑧 ∧ 𝑦𝑟𝑧)) ↔ (𝐵 ≠ ∅ ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐵 (𝑥 ≤ 𝑧 ∧ 𝑦 ≤ 𝑧))))
25		df-drs 18263	. . 3 ⊢ Dirset = {𝑓 ∈ Proset ∣ [(Base‘𝑓) / 𝑏][(le‘𝑓) / 𝑟](𝑏 ≠ ∅ ∧ ∀𝑥 ∈ 𝑏 ∀𝑦 ∈ 𝑏 ∃𝑧 ∈ 𝑏 (𝑥𝑟𝑧 ∧ 𝑦𝑟𝑧))}
26	24, 25	elrab2 3665	. 2 ⊢ (𝐾 ∈ Dirset ↔ (𝐾 ∈ Proset ∧ (𝐵 ≠ ∅ ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐵 (𝑥 ≤ 𝑧 ∧ 𝑦 ≤ 𝑧))))
27		3anass 1094	. 2 ⊢ ((𝐾 ∈ Proset ∧ 𝐵 ≠ ∅ ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐵 (𝑥 ≤ 𝑧 ∧ 𝑦 ≤ 𝑧)) ↔ (𝐾 ∈ Proset ∧ (𝐵 ≠ ∅ ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐵 (𝑥 ≤ 𝑧 ∧ 𝑦 ≤ 𝑧))))
28	26, 27	bitr4i 278	1 ⊢ (𝐾 ∈ Dirset ↔ (𝐾 ∈ Proset ∧ 𝐵 ≠ ∅ ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐵 (𝑥 ≤ 𝑧 ∧ 𝑦 ≤ 𝑧)))

Syntax hints:   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1540   ∈ wcel 2109   ≠ wne 2926  ∀wral 3045  ∃wrex 3054  [wsbc 3756  ∅c0 4299   class class class wbr 5110  ‘cfv 6514  Basecbs 17186  lecple 17234   Proset cproset 18260  Dirsetcdrs 18261

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-ext 2702  ax-nul 5264

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-sb 2066  df-clab 2709  df-cleq 2722  df-clel 2804  df-ne 2927  df-ral 3046  df-rex 3055  df-rab 3409  df-v 3452  df-sbc 3757  df-dif 3920  df-un 3922  df-ss 3934  df-nul 4300  df-if 4492  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-br 5111  df-iota 6467  df-fv 6522  df-drs 18263

This theorem is referenced by:  drsdir  18270  drsprs  18271  drsbn0  18272  isdrs2  18274  isipodrs  18503