Theorem psss 18671

Description: Any subset of a partially ordered set is partially ordered. (Contributed by FL, 24-Jan-2010.)

Assertion

Ref	Expression
psss	⊢ (𝑅 ∈ PosetRel → (𝑅 ∩ (𝐴 × 𝐴)) ∈ PosetRel)

Proof of Theorem psss

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

Step	Hyp	Ref	Expression
1		inss1 4182	. . 3 ⊢ (𝑅 ∩ (𝐴 × 𝐴)) ⊆ 𝑅
2		psrel 18660	. . 3 ⊢ (𝑅 ∈ PosetRel → Rel 𝑅)
3		relss 5762	. . 3 ⊢ ((𝑅 ∩ (𝐴 × 𝐴)) ⊆ 𝑅 → (Rel 𝑅 → Rel (𝑅 ∩ (𝐴 × 𝐴))))
4	1, 2, 3	mpsyl 69	. 2 ⊢ (𝑅 ∈ PosetRel → Rel (𝑅 ∩ (𝐴 × 𝐴)))
5		pstr2 18662	. . 3 ⊢ (𝑅 ∈ PosetRel → (𝑅 ∘ 𝑅) ⊆ 𝑅)
6		trinxp 6119	. . 3 ⊢ ((𝑅 ∘ 𝑅) ⊆ 𝑅 → ((𝑅 ∩ (𝐴 × 𝐴)) ∘ (𝑅 ∩ (𝐴 × 𝐴))) ⊆ (𝑅 ∩ (𝐴 × 𝐴)))
7	5, 6	syl 18	. 2 ⊢ (𝑅 ∈ PosetRel → ((𝑅 ∩ (𝐴 × 𝐴)) ∘ (𝑅 ∩ (𝐴 × 𝐴))) ⊆ (𝑅 ∩ (𝐴 × 𝐴)))
8		uniin 4891	. . . . . 6 ⊢ ∪ (𝑅 ∩ (𝐴 × 𝐴)) ⊆ (∪ 𝑅 ∩ ∪ (𝐴 × 𝐴))
9	8	unissi 4876	. . . . 5 ⊢ ∪ ∪ (𝑅 ∩ (𝐴 × 𝐴)) ⊆ ∪ (∪ 𝑅 ∩ ∪ (𝐴 × 𝐴))
10		uniin 4891	. . . . 5 ⊢ ∪ (∪ 𝑅 ∩ ∪ (𝐴 × 𝐴)) ⊆ (∪ ∪ 𝑅 ∩ ∪ ∪ (𝐴 × 𝐴))
11	9, 10	sstri 3940	. . . 4 ⊢ ∪ ∪ (𝑅 ∩ (𝐴 × 𝐴)) ⊆ (∪ ∪ 𝑅 ∩ ∪ ∪ (𝐴 × 𝐴))
12		elin 3915	. . . . . 6 ⊢ (𝑥 ∈ (∪ ∪ 𝑅 ∩ ∪ ∪ (𝐴 × 𝐴)) ↔ (𝑥 ∈ ∪ ∪ 𝑅 ∧ 𝑥 ∈ ∪ ∪ (𝐴 × 𝐴)))
13		unixpid 6282	. . . . . . . . 9 ⊢ ∪ ∪ (𝐴 × 𝐴) = 𝐴
14	13	eleq2i 2852	. . . . . . . 8 ⊢ (𝑥 ∈ ∪ ∪ (𝐴 × 𝐴) ↔ 𝑥 ∈ 𝐴)
15		simprr 785	. . . . . . . . . 10 ⊢ ((𝑅 ∈ PosetRel ∧ (𝑥 ∈ ∪ ∪ 𝑅 ∧ 𝑥 ∈ 𝐴)) → 𝑥 ∈ 𝐴)
16		psdmrn 18664	. . . . . . . . . . . . . . 15 ⊢ (𝑅 ∈ PosetRel → (dom 𝑅 = ∪ ∪ 𝑅 ∧ ran 𝑅 = ∪ ∪ 𝑅))
17	16	simpld 500	. . . . . . . . . . . . . 14 ⊢ (𝑅 ∈ PosetRel → dom 𝑅 = ∪ ∪ 𝑅)
18	17	eleq2d 2846	. . . . . . . . . . . . 13 ⊢ (𝑅 ∈ PosetRel → (𝑥 ∈ dom 𝑅 ↔ 𝑥 ∈ ∪ ∪ 𝑅))
19	18	biimpar 483	. . . . . . . . . . . 12 ⊢ ((𝑅 ∈ PosetRel ∧ 𝑥 ∈ ∪ ∪ 𝑅) → 𝑥 ∈ dom 𝑅)
20		eqid 2760	. . . . . . . . . . . . 13 ⊢ dom 𝑅 = dom 𝑅
21	20	psref 18665	. . . . . . . . . . . 12 ⊢ ((𝑅 ∈ PosetRel ∧ 𝑥 ∈ dom 𝑅) → 𝑥𝑅𝑥)
22	19, 21	syldan 603	. . . . . . . . . . 11 ⊢ ((𝑅 ∈ PosetRel ∧ 𝑥 ∈ ∪ ∪ 𝑅) → 𝑥𝑅𝑥)
23	22	adantrr 730	. . . . . . . . . 10 ⊢ ((𝑅 ∈ PosetRel ∧ (𝑥 ∈ ∪ ∪ 𝑅 ∧ 𝑥 ∈ 𝐴)) → 𝑥𝑅𝑥)
24		brinxp2 5733	. . . . . . . . . 10 ⊢ (𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑥 ↔ ((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ 𝑥𝑅𝑥))
25	15, 15, 23, 24	syl21anbrc 1363	. . . . . . . . 9 ⊢ ((𝑅 ∈ PosetRel ∧ (𝑥 ∈ ∪ ∪ 𝑅 ∧ 𝑥 ∈ 𝐴)) → 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑥)
26	25	expr 462	. . . . . . . 8 ⊢ ((𝑅 ∈ PosetRel ∧ 𝑥 ∈ ∪ ∪ 𝑅) → (𝑥 ∈ 𝐴 → 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑥))
27	14, 26	biimtrid 245	. . . . . . 7 ⊢ ((𝑅 ∈ PosetRel ∧ 𝑥 ∈ ∪ ∪ 𝑅) → (𝑥 ∈ ∪ ∪ (𝐴 × 𝐴) → 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑥))
28	27	expimpd 459	. . . . . 6 ⊢ (𝑅 ∈ PosetRel → ((𝑥 ∈ ∪ ∪ 𝑅 ∧ 𝑥 ∈ ∪ ∪ (𝐴 × 𝐴)) → 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑥))
29	12, 28	biimtrid 245	. . . . 5 ⊢ (𝑅 ∈ PosetRel → (𝑥 ∈ (∪ ∪ 𝑅 ∩ ∪ ∪ (𝐴 × 𝐴)) → 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑥))
30	29	ralrimiv 3153	. . . 4 ⊢ (𝑅 ∈ PosetRel → ∀𝑥 ∈ (∪ ∪ 𝑅 ∩ ∪ ∪ (𝐴 × 𝐴))𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑥)
31		ssralv 4000	. . . 4 ⊢ (∪ ∪ (𝑅 ∩ (𝐴 × 𝐴)) ⊆ (∪ ∪ 𝑅 ∩ ∪ ∪ (𝐴 × 𝐴)) → (∀𝑥 ∈ (∪ ∪ 𝑅 ∩ ∪ ∪ (𝐴 × 𝐴))𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑥 → ∀𝑥 ∈ ∪ ∪ (𝑅 ∩ (𝐴 × 𝐴))𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑥))
32	11, 30, 31	mpsyl 69	. . 3 ⊢ (𝑅 ∈ PosetRel → ∀𝑥 ∈ ∪ ∪ (𝑅 ∩ (𝐴 × 𝐴))𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑥)
33	1	ssbri 5150	. . . . 5 ⊢ (𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦 → 𝑥𝑅𝑦)
34	1	ssbri 5150	. . . . 5 ⊢ (𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥 → 𝑦𝑅𝑥)
35		psasym 18667	. . . . . 6 ⊢ ((𝑅 ∈ PosetRel ∧ 𝑥𝑅𝑦 ∧ 𝑦𝑅𝑥) → 𝑥 = 𝑦)
36	35	3expib 1140	. . . . 5 ⊢ (𝑅 ∈ PosetRel → ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑥) → 𝑥 = 𝑦))
37	33, 34, 36	syl2ani 619	. . . 4 ⊢ (𝑅 ∈ PosetRel → ((𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦 ∧ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥) → 𝑥 = 𝑦))
38	37	alrimivv 1961	. . 3 ⊢ (𝑅 ∈ PosetRel → ∀𝑥∀𝑦((𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦 ∧ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥) → 𝑥 = 𝑦))
39		asymref2 6111	. . 3 ⊢ (((𝑅 ∩ (𝐴 × 𝐴)) ∩ ◡(𝑅 ∩ (𝐴 × 𝐴))) = ( I ↾ ∪ ∪ (𝑅 ∩ (𝐴 × 𝐴))) ↔ (∀𝑥 ∈ ∪ ∪ (𝑅 ∩ (𝐴 × 𝐴))𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑥 ∧ ∀𝑥∀𝑦((𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦 ∧ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥) → 𝑥 = 𝑦)))
40	32, 38, 39	sylanbrc 595	. 2 ⊢ (𝑅 ∈ PosetRel → ((𝑅 ∩ (𝐴 × 𝐴)) ∩ ◡(𝑅 ∩ (𝐴 × 𝐴))) = ( I ↾ ∪ ∪ (𝑅 ∩ (𝐴 × 𝐴))))
41		inex1g 5282	. . 3 ⊢ (𝑅 ∈ PosetRel → (𝑅 ∩ (𝐴 × 𝐴)) ∈ V)
42		isps 18659	. . 3 ⊢ ((𝑅 ∩ (𝐴 × 𝐴)) ∈ V → ((𝑅 ∩ (𝐴 × 𝐴)) ∈ PosetRel ↔ (Rel (𝑅 ∩ (𝐴 × 𝐴)) ∧ ((𝑅 ∩ (𝐴 × 𝐴)) ∘ (𝑅 ∩ (𝐴 × 𝐴))) ⊆ (𝑅 ∩ (𝐴 × 𝐴)) ∧ ((𝑅 ∩ (𝐴 × 𝐴)) ∩ ◡(𝑅 ∩ (𝐴 × 𝐴))) = ( I ↾ ∪ ∪ (𝑅 ∩ (𝐴 × 𝐴))))))
43	41, 42	syl 18	. 2 ⊢ (𝑅 ∈ PosetRel → ((𝑅 ∩ (𝐴 × 𝐴)) ∈ PosetRel ↔ (Rel (𝑅 ∩ (𝐴 × 𝐴)) ∧ ((𝑅 ∩ (𝐴 × 𝐴)) ∘ (𝑅 ∩ (𝐴 × 𝐴))) ⊆ (𝑅 ∩ (𝐴 × 𝐴)) ∧ ((𝑅 ∩ (𝐴 × 𝐴)) ∩ ◡(𝑅 ∩ (𝐴 × 𝐴))) = ( I ↾ ∪ ∪ (𝑅 ∩ (𝐴 × 𝐴))))))
44	4, 7, 40, 43	mpbir3and 1361	1 ⊢ (𝑅 ∈ PosetRel → (𝑅 ∩ (𝐴 × 𝐴)) ∈ PosetRel)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103  ∀wal 1568   = wceq 1570   ∈ wcel 2145  ∀wral 3076  Vcvv 3450   ∩ cin 3898   ⊆ wss 3899  ∪ cuni 4867   class class class wbr 5103   I cid 5549   × cxp 5653  ^◡ccnv 5654  dom cdm 5655  ran crn 5656   ↾ cres 5657   ∘ ccom 5659  Rel wrel 5660  PosetRelcps 18655

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 2732  ax-sep 5251  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-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  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-br 5104  df-opab 5168  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-ps 18657

This theorem is used by:  tsrss  18680  ordtrest2  23432