Theorem swoer 8735

Description: Incomparability under a strict weak partial order is an equivalence relation. (Contributed by Mario Carneiro, 9-Jul-2014.) (Revised by Mario Carneiro, 12-Aug-2015.)

Hypotheses

Ref	Expression
swoer.1	⊢ 𝑅 = ((𝑋 × 𝑋) ∖ ( < ∪ ◡ < ))
swoer.2	⊢ ((𝜑 ∧ (𝑦 ∈ 𝑋 ∧ 𝑧 ∈ 𝑋)) → (𝑦 < 𝑧 → ¬ 𝑧 < 𝑦))
swoer.3	⊢ ((𝜑 ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋 ∧ 𝑧 ∈ 𝑋)) → (𝑥 < 𝑦 → (𝑥 < 𝑧 ∨ 𝑧 < 𝑦)))

Assertion

Ref	Expression
swoer	⊢ (𝜑 → 𝑅 Er 𝑋)

Distinct variable groups:   𝑥,𝑦,𝑧, <   𝜑,𝑥,𝑦,𝑧   𝑥,𝑋,𝑦,𝑧

Allowed substitution hints:   𝑅(𝑥, 𝑦, 𝑧)

Proof of Theorem swoer

Dummy variables 𝑣 𝑢 𝑤 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		swoer.1	. . . . 5 ⊢ 𝑅 = ((𝑋 × 𝑋) ∖ ( < ∪ ◡ < ))
2		difss 4093	. . . . 5 ⊢ ((𝑋 × 𝑋) ∖ ( < ∪ ◡ < )) ⊆ (𝑋 × 𝑋)
3	1, 2	eqsstri 3986	. . . 4 ⊢ 𝑅 ⊆ (𝑋 × 𝑋)
4		relxp 5684	. . . 4 ⊢ Rel (𝑋 × 𝑋)
5		relss 5773	. . . 4 ⊢ (𝑅 ⊆ (𝑋 × 𝑋) → (Rel (𝑋 × 𝑋) → Rel 𝑅))
6	3, 4, 5	mp2 9	. . 3 ⊢ Rel 𝑅
7	6	a1i 11	. 2 ⊢ (𝜑 → Rel 𝑅)
8		simpr 490	. . 3 ⊢ ((𝜑 ∧ 𝑢𝑅𝑣) → 𝑢𝑅𝑣)
9		orcom 884	. . . . . 6 ⊢ ((𝑢 < 𝑣 ∨ 𝑣 < 𝑢) ↔ (𝑣 < 𝑢 ∨ 𝑢 < 𝑣))
10	9	a1i 11	. . . . 5 ⊢ ((𝜑 ∧ 𝑢𝑅𝑣) → ((𝑢 < 𝑣 ∨ 𝑣 < 𝑢) ↔ (𝑣 < 𝑢 ∨ 𝑢 < 𝑣)))
11	10	notbid 321	. . . 4 ⊢ ((𝜑 ∧ 𝑢𝑅𝑣) → (¬ (𝑢 < 𝑣 ∨ 𝑣 < 𝑢) ↔ ¬ (𝑣 < 𝑢 ∨ 𝑢 < 𝑣)))
12	3	ssbri 5161	. . . . . . 7 ⊢ (𝑢𝑅𝑣 → 𝑢(𝑋 × 𝑋)𝑣)
13	12	adantl 487	. . . . . 6 ⊢ ((𝜑 ∧ 𝑢𝑅𝑣) → 𝑢(𝑋 × 𝑋)𝑣)
14		brxp 5715	. . . . . 6 ⊢ (𝑢(𝑋 × 𝑋)𝑣 ↔ (𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋))
15	13, 14	sylib 221	. . . . 5 ⊢ ((𝜑 ∧ 𝑢𝑅𝑣) → (𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋))
16	1	brdifun 8734	. . . . 5 ⊢ ((𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋) → (𝑢𝑅𝑣 ↔ ¬ (𝑢 < 𝑣 ∨ 𝑣 < 𝑢)))
17	15, 16	syl 18	. . . 4 ⊢ ((𝜑 ∧ 𝑢𝑅𝑣) → (𝑢𝑅𝑣 ↔ ¬ (𝑢 < 𝑣 ∨ 𝑣 < 𝑢)))
18	15	simprd 501	. . . . 5 ⊢ ((𝜑 ∧ 𝑢𝑅𝑣) → 𝑣 ∈ 𝑋)
19	15	simpld 500	. . . . 5 ⊢ ((𝜑 ∧ 𝑢𝑅𝑣) → 𝑢 ∈ 𝑋)
20	1	brdifun 8734	. . . . 5 ⊢ ((𝑣 ∈ 𝑋 ∧ 𝑢 ∈ 𝑋) → (𝑣𝑅𝑢 ↔ ¬ (𝑣 < 𝑢 ∨ 𝑢 < 𝑣)))
21	18, 19, 20	syl2anc 596	. . . 4 ⊢ ((𝜑 ∧ 𝑢𝑅𝑣) → (𝑣𝑅𝑢 ↔ ¬ (𝑣 < 𝑢 ∨ 𝑢 < 𝑣)))
22	11, 17, 21	3bitr4d 314	. . 3 ⊢ ((𝜑 ∧ 𝑢𝑅𝑣) → (𝑢𝑅𝑣 ↔ 𝑣𝑅𝑢))
23	8, 22	mpbid 235	. 2 ⊢ ((𝜑 ∧ 𝑢𝑅𝑣) → 𝑣𝑅𝑢)
24		simprl 783	. . . . 5 ⊢ ((𝜑 ∧ (𝑢𝑅𝑣 ∧ 𝑣𝑅𝑤)) → 𝑢𝑅𝑣)
25	12	ad2antrl 741	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑢𝑅𝑣 ∧ 𝑣𝑅𝑤)) → 𝑢(𝑋 × 𝑋)𝑣)
26	14	simplbi 502	. . . . . . 7 ⊢ (𝑢(𝑋 × 𝑋)𝑣 → 𝑢 ∈ 𝑋)
27	25, 26	syl 18	. . . . . 6 ⊢ ((𝜑 ∧ (𝑢𝑅𝑣 ∧ 𝑣𝑅𝑤)) → 𝑢 ∈ 𝑋)
28	14	simprbi 503	. . . . . . 7 ⊢ (𝑢(𝑋 × 𝑋)𝑣 → 𝑣 ∈ 𝑋)
29	25, 28	syl 18	. . . . . 6 ⊢ ((𝜑 ∧ (𝑢𝑅𝑣 ∧ 𝑣𝑅𝑤)) → 𝑣 ∈ 𝑋)
30	27, 29, 16	syl2anc 596	. . . . 5 ⊢ ((𝜑 ∧ (𝑢𝑅𝑣 ∧ 𝑣𝑅𝑤)) → (𝑢𝑅𝑣 ↔ ¬ (𝑢 < 𝑣 ∨ 𝑣 < 𝑢)))
31	24, 30	mpbid 235	. . . 4 ⊢ ((𝜑 ∧ (𝑢𝑅𝑣 ∧ 𝑣𝑅𝑤)) → ¬ (𝑢 < 𝑣 ∨ 𝑣 < 𝑢))
32		simprr 785	. . . . 5 ⊢ ((𝜑 ∧ (𝑢𝑅𝑣 ∧ 𝑣𝑅𝑤)) → 𝑣𝑅𝑤)
33	3	brel 5731	. . . . . . . 8 ⊢ (𝑣𝑅𝑤 → (𝑣 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋))
34	33	simprd 501	. . . . . . 7 ⊢ (𝑣𝑅𝑤 → 𝑤 ∈ 𝑋)
35	32, 34	syl 18	. . . . . 6 ⊢ ((𝜑 ∧ (𝑢𝑅𝑣 ∧ 𝑣𝑅𝑤)) → 𝑤 ∈ 𝑋)
36	1	brdifun 8734	. . . . . 6 ⊢ ((𝑣 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋) → (𝑣𝑅𝑤 ↔ ¬ (𝑣 < 𝑤 ∨ 𝑤 < 𝑣)))
37	29, 35, 36	syl2anc 596	. . . . 5 ⊢ ((𝜑 ∧ (𝑢𝑅𝑣 ∧ 𝑣𝑅𝑤)) → (𝑣𝑅𝑤 ↔ ¬ (𝑣 < 𝑤 ∨ 𝑤 < 𝑣)))
38	32, 37	mpbid 235	. . . 4 ⊢ ((𝜑 ∧ (𝑢𝑅𝑣 ∧ 𝑣𝑅𝑤)) → ¬ (𝑣 < 𝑤 ∨ 𝑤 < 𝑣))
39		simpl 488	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑢𝑅𝑣 ∧ 𝑣𝑅𝑤)) → 𝜑)
40		swoer.3	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋 ∧ 𝑧 ∈ 𝑋)) → (𝑥 < 𝑦 → (𝑥 < 𝑧 ∨ 𝑧 < 𝑦)))
41	40	swopolem 5584	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋)) → (𝑢 < 𝑤 → (𝑢 < 𝑣 ∨ 𝑣 < 𝑤)))
42	39, 27, 35, 29, 41	syl13anc 1399	. . . . . 6 ⊢ ((𝜑 ∧ (𝑢𝑅𝑣 ∧ 𝑣𝑅𝑤)) → (𝑢 < 𝑤 → (𝑢 < 𝑣 ∨ 𝑣 < 𝑤)))
43	40	swopolem 5584	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑤 ∈ 𝑋 ∧ 𝑢 ∈ 𝑋 ∧ 𝑣 ∈ 𝑋)) → (𝑤 < 𝑢 → (𝑤 < 𝑣 ∨ 𝑣 < 𝑢)))
44	39, 35, 27, 29, 43	syl13anc 1399	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑢𝑅𝑣 ∧ 𝑣𝑅𝑤)) → (𝑤 < 𝑢 → (𝑤 < 𝑣 ∨ 𝑣 < 𝑢)))
45		orcom 884	. . . . . . 7 ⊢ ((𝑣 < 𝑢 ∨ 𝑤 < 𝑣) ↔ (𝑤 < 𝑣 ∨ 𝑣 < 𝑢))
46	44, 45	imbitrrdi 255	. . . . . 6 ⊢ ((𝜑 ∧ (𝑢𝑅𝑣 ∧ 𝑣𝑅𝑤)) → (𝑤 < 𝑢 → (𝑣 < 𝑢 ∨ 𝑤 < 𝑣)))
47	42, 46	orim12d 979	. . . . 5 ⊢ ((𝜑 ∧ (𝑢𝑅𝑣 ∧ 𝑣𝑅𝑤)) → ((𝑢 < 𝑤 ∨ 𝑤 < 𝑢) → ((𝑢 < 𝑣 ∨ 𝑣 < 𝑤) ∨ (𝑣 < 𝑢 ∨ 𝑤 < 𝑣))))
48		or4 940	. . . . 5 ⊢ (((𝑢 < 𝑣 ∨ 𝑣 < 𝑤) ∨ (𝑣 < 𝑢 ∨ 𝑤 < 𝑣)) ↔ ((𝑢 < 𝑣 ∨ 𝑣 < 𝑢) ∨ (𝑣 < 𝑤 ∨ 𝑤 < 𝑣)))
49	47, 48	imbitrdi 254	. . . 4 ⊢ ((𝜑 ∧ (𝑢𝑅𝑣 ∧ 𝑣𝑅𝑤)) → ((𝑢 < 𝑤 ∨ 𝑤 < 𝑢) → ((𝑢 < 𝑣 ∨ 𝑣 < 𝑢) ∨ (𝑣 < 𝑤 ∨ 𝑤 < 𝑣))))
50	31, 38, 49	mtord 893	. . 3 ⊢ ((𝜑 ∧ (𝑢𝑅𝑣 ∧ 𝑣𝑅𝑤)) → ¬ (𝑢 < 𝑤 ∨ 𝑤 < 𝑢))
51	1	brdifun 8734	. . . 4 ⊢ ((𝑢 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋) → (𝑢𝑅𝑤 ↔ ¬ (𝑢 < 𝑤 ∨ 𝑤 < 𝑢)))
52	27, 35, 51	syl2anc 596	. . 3 ⊢ ((𝜑 ∧ (𝑢𝑅𝑣 ∧ 𝑣𝑅𝑤)) → (𝑢𝑅𝑤 ↔ ¬ (𝑢 < 𝑤 ∨ 𝑤 < 𝑢)))
53	50, 52	mpbird 260	. 2 ⊢ ((𝜑 ∧ (𝑢𝑅𝑣 ∧ 𝑣𝑅𝑤)) → 𝑢𝑅𝑤)
54		swoer.2	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝑋 ∧ 𝑧 ∈ 𝑋)) → (𝑦 < 𝑧 → ¬ 𝑧 < 𝑦))
55	54, 40	swopo 5585	. . . . . 6 ⊢ (𝜑 → < Po 𝑋)
56		poirr 5586	. . . . . 6 ⊢ (( < Po 𝑋 ∧ 𝑢 ∈ 𝑋) → ¬ 𝑢 < 𝑢)
57	55, 56	sylan 592	. . . . 5 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝑋) → ¬ 𝑢 < 𝑢)
58		pm1.2 917	. . . . 5 ⊢ ((𝑢 < 𝑢 ∨ 𝑢 < 𝑢) → 𝑢 < 𝑢)
59	57, 58	nsyl 141	. . . 4 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝑋) → ¬ (𝑢 < 𝑢 ∨ 𝑢 < 𝑢))
60		simpr 490	. . . . 5 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝑋) → 𝑢 ∈ 𝑋)
61	1	brdifun 8734	. . . . 5 ⊢ ((𝑢 ∈ 𝑋 ∧ 𝑢 ∈ 𝑋) → (𝑢𝑅𝑢 ↔ ¬ (𝑢 < 𝑢 ∨ 𝑢 < 𝑢)))
62	60, 60, 61	syl2anc 596	. . . 4 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝑋) → (𝑢𝑅𝑢 ↔ ¬ (𝑢 < 𝑢 ∨ 𝑢 < 𝑢)))
63	59, 62	mpbird 260	. . 3 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝑋) → 𝑢𝑅𝑢)
64	3	ssbri 5161	. . . . 5 ⊢ (𝑢𝑅𝑢 → 𝑢(𝑋 × 𝑋)𝑢)
65		brxp 5715	. . . . . 6 ⊢ (𝑢(𝑋 × 𝑋)𝑢 ↔ (𝑢 ∈ 𝑋 ∧ 𝑢 ∈ 𝑋))
66	65	simplbi 502	. . . . 5 ⊢ (𝑢(𝑋 × 𝑋)𝑢 → 𝑢 ∈ 𝑋)
67	64, 66	syl 18	. . . 4 ⊢ (𝑢𝑅𝑢 → 𝑢 ∈ 𝑋)
68	67	adantl 487	. . 3 ⊢ ((𝜑 ∧ 𝑢𝑅𝑢) → 𝑢 ∈ 𝑋)
69	63, 68	impbida 813	. 2 ⊢ (𝜑 → (𝑢 ∈ 𝑋 ↔ 𝑢𝑅𝑢))
70	7, 23, 53, 69	iserd 8730	1 ⊢ (𝜑 → 𝑅 Er 𝑋)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   ∧ w3a 1103   = wceq 1570   ∈ wcel 2146   ∖ cdif 3905   ∪ cun 3906   ⊆ wss 3908   class class class wbr 5114   Po wpo 5572   × cxp 5664  ^◡ccnv 5665  Rel wrel 5671   Er wer 8700

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 2148  ax-9 2156  ax-ext 2738  ax-sep 5262  ax-pr 5409

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 2745  df-cleq 2758  df-clel 2841  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-br 5115  df-opab 5179  df-po 5574  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-er 8703

This theorem is used by: (None)