Theorem tsrss 18681

Description: Any subset of a totally ordered set is totally ordered. (Contributed by FL, 24-Jan-2010.) (Proof shortened by Mario Carneiro, 21-Nov-2013.)

Assertion

Ref	Expression
tsrss	⊢ (𝑅 ∈ TosetRel → (𝑅 ∩ (𝐴 × 𝐴)) ∈ TosetRel )

Proof of Theorem tsrss

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

Step	Hyp	Ref	Expression
1		psss 18672	. . 3 ⊢ (𝑅 ∈ PosetRel → (𝑅 ∩ (𝐴 × 𝐴)) ∈ PosetRel)
2		inss1 4185	. . . . . 6 ⊢ (𝑅 ∩ (𝐴 × 𝐴)) ⊆ 𝑅
3		dmss 5890	. . . . . 6 ⊢ ((𝑅 ∩ (𝐴 × 𝐴)) ⊆ 𝑅 → dom (𝑅 ∩ (𝐴 × 𝐴)) ⊆ dom 𝑅)
4		ssralv 4003	. . . . . 6 ⊢ (dom (𝑅 ∩ (𝐴 × 𝐴)) ⊆ dom 𝑅 → (∀𝑥 ∈ dom 𝑅∀𝑦 ∈ dom 𝑅(𝑥𝑅𝑦 ∨ 𝑦𝑅𝑥) → ∀𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴))∀𝑦 ∈ dom 𝑅(𝑥𝑅𝑦 ∨ 𝑦𝑅𝑥)))
5	2, 3, 4	mp2b 10	. . . . 5 ⊢ (∀𝑥 ∈ dom 𝑅∀𝑦 ∈ dom 𝑅(𝑥𝑅𝑦 ∨ 𝑦𝑅𝑥) → ∀𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴))∀𝑦 ∈ dom 𝑅(𝑥𝑅𝑦 ∨ 𝑦𝑅𝑥))
6		ssralv 4003	. . . . . . 7 ⊢ (dom (𝑅 ∩ (𝐴 × 𝐴)) ⊆ dom 𝑅 → (∀𝑦 ∈ dom 𝑅(𝑥𝑅𝑦 ∨ 𝑦𝑅𝑥) → ∀𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴))(𝑥𝑅𝑦 ∨ 𝑦𝑅𝑥)))
7	2, 3, 6	mp2b 10	. . . . . 6 ⊢ (∀𝑦 ∈ dom 𝑅(𝑥𝑅𝑦 ∨ 𝑦𝑅𝑥) → ∀𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴))(𝑥𝑅𝑦 ∨ 𝑦𝑅𝑥))
8	7	ralimi 3101	. . . . 5 ⊢ (∀𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴))∀𝑦 ∈ dom 𝑅(𝑥𝑅𝑦 ∨ 𝑦𝑅𝑥) → ∀𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴))∀𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴))(𝑥𝑅𝑦 ∨ 𝑦𝑅𝑥))
9	5, 8	syl 18	. . . 4 ⊢ (∀𝑥 ∈ dom 𝑅∀𝑦 ∈ dom 𝑅(𝑥𝑅𝑦 ∨ 𝑦𝑅𝑥) → ∀𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴))∀𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴))(𝑥𝑅𝑦 ∨ 𝑦𝑅𝑥))
10		inss2 4186	. . . . . . . . . 10 ⊢ (𝑅 ∩ (𝐴 × 𝐴)) ⊆ (𝐴 × 𝐴)
11		dmss 5890	. . . . . . . . . 10 ⊢ ((𝑅 ∩ (𝐴 × 𝐴)) ⊆ (𝐴 × 𝐴) → dom (𝑅 ∩ (𝐴 × 𝐴)) ⊆ dom (𝐴 × 𝐴))
12	10, 11	ax-mp 5	. . . . . . . . 9 ⊢ dom (𝑅 ∩ (𝐴 × 𝐴)) ⊆ dom (𝐴 × 𝐴)
13		dmxpid 5918	. . . . . . . . 9 ⊢ dom (𝐴 × 𝐴) = 𝐴
14	12, 13	sseqtri 3982	. . . . . . . 8 ⊢ dom (𝑅 ∩ (𝐴 × 𝐴)) ⊆ 𝐴
15	14	sseli 3930	. . . . . . 7 ⊢ (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) → 𝑥 ∈ 𝐴)
16	14	sseli 3930	. . . . . . 7 ⊢ (𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) → 𝑦 ∈ 𝐴)
17		brinxp 5738	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → (𝑥𝑅𝑦 ↔ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦))
18		brinxp 5738	. . . . . . . . 9 ⊢ ((𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝑦𝑅𝑥 ↔ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
19	18	ancoms 464	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → (𝑦𝑅𝑥 ↔ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
20	17, 19	orbi12d 932	. . . . . . 7 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → ((𝑥𝑅𝑦 ∨ 𝑦𝑅𝑥) ↔ (𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦 ∨ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥)))
21	15, 16, 20	syl2an 608	. . . . . 6 ⊢ ((𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) ∧ 𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴))) → ((𝑥𝑅𝑦 ∨ 𝑦𝑅𝑥) ↔ (𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦 ∨ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥)))
22	21	ralbidva 3185	. . . . 5 ⊢ (𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴)) → (∀𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴))(𝑥𝑅𝑦 ∨ 𝑦𝑅𝑥) ↔ ∀𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴))(𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦 ∨ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥)))
23	22	ralbiia 3108	. . . 4 ⊢ (∀𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴))∀𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴))(𝑥𝑅𝑦 ∨ 𝑦𝑅𝑥) ↔ ∀𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴))∀𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴))(𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦 ∨ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
24	9, 23	sylib 221	. . 3 ⊢ (∀𝑥 ∈ dom 𝑅∀𝑦 ∈ dom 𝑅(𝑥𝑅𝑦 ∨ 𝑦𝑅𝑥) → ∀𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴))∀𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴))(𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦 ∨ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
25	1, 24	anim12i 625	. 2 ⊢ ((𝑅 ∈ PosetRel ∧ ∀𝑥 ∈ dom 𝑅∀𝑦 ∈ dom 𝑅(𝑥𝑅𝑦 ∨ 𝑦𝑅𝑥)) → ((𝑅 ∩ (𝐴 × 𝐴)) ∈ PosetRel ∧ ∀𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴))∀𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴))(𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦 ∨ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥)))
26		eqid 2762	. . 3 ⊢ dom 𝑅 = dom 𝑅
27	26	istsr2 18676	. 2 ⊢ (𝑅 ∈ TosetRel ↔ (𝑅 ∈ PosetRel ∧ ∀𝑥 ∈ dom 𝑅∀𝑦 ∈ dom 𝑅(𝑥𝑅𝑦 ∨ 𝑦𝑅𝑥)))
28		eqid 2762	. . 3 ⊢ dom (𝑅 ∩ (𝐴 × 𝐴)) = dom (𝑅 ∩ (𝐴 × 𝐴))
29	28	istsr2 18676	. 2 ⊢ ((𝑅 ∩ (𝐴 × 𝐴)) ∈ TosetRel ↔ ((𝑅 ∩ (𝐴 × 𝐴)) ∈ PosetRel ∧ ∀𝑥 ∈ dom (𝑅 ∩ (𝐴 × 𝐴))∀𝑦 ∈ dom (𝑅 ∩ (𝐴 × 𝐴))(𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦 ∨ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥)))
30	25, 27, 29	3imtr4i 295	1 ⊢ (𝑅 ∈ TosetRel → (𝑅 ∩ (𝐴 × 𝐴)) ∈ TosetRel )

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   ∈ wcel 2145  ∀wral 3078   ∩ cin 3901   ⊆ wss 3902   class class class wbr 5107   × cxp 5657  dom cdm 5659  PosetRelcps 18656   TosetRel ctsr 18657

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 2734  ax-sep 5255  ax-pr 5402

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 2741  df-cleq 2754  df-clel 2837  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-opab 5172  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ps 18658  df-tsr 18659

This theorem is used by: (None)