Theorem cnvpo 6307

Description: The converse of a partial order is a partial order. (Contributed by NM, 15-Jun-2005.)

Assertion

Ref	Expression
cnvpo	⊢ (𝑅 Po 𝐴 ↔ ◡𝑅 Po 𝐴)

Proof of Theorem cnvpo

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

Step	Hyp	Ref	Expression
1		r19.26 3111	. . . . . . 7 ⊢ (∀𝑧 ∈ 𝐴 (¬ 𝑧◡𝑅𝑧 ∧ ((𝑧◡𝑅𝑦 ∧ 𝑦◡𝑅𝑥) → 𝑧◡𝑅𝑥)) ↔ (∀𝑧 ∈ 𝐴 ¬ 𝑧◡𝑅𝑧 ∧ ∀𝑧 ∈ 𝐴 ((𝑧◡𝑅𝑦 ∧ 𝑦◡𝑅𝑥) → 𝑧◡𝑅𝑥)))
2		vex 3484	. . . . . . . . . . . 12 ⊢ 𝑧 ∈ V
3	2, 2	brcnv 5893	. . . . . . . . . . 11 ⊢ (𝑧◡𝑅𝑧 ↔ 𝑧𝑅𝑧)
4		id 22	. . . . . . . . . . . 12 ⊢ (𝑧 = 𝑥 → 𝑧 = 𝑥)
5	4, 4	breq12d 5156	. . . . . . . . . . 11 ⊢ (𝑧 = 𝑥 → (𝑧𝑅𝑧 ↔ 𝑥𝑅𝑥))
6	3, 5	bitrid 283	. . . . . . . . . 10 ⊢ (𝑧 = 𝑥 → (𝑧◡𝑅𝑧 ↔ 𝑥𝑅𝑥))
7	6	notbid 318	. . . . . . . . 9 ⊢ (𝑧 = 𝑥 → (¬ 𝑧◡𝑅𝑧 ↔ ¬ 𝑥𝑅𝑥))
8	7	cbvralvw 3237	. . . . . . . 8 ⊢ (∀𝑧 ∈ 𝐴 ¬ 𝑧◡𝑅𝑧 ↔ ∀𝑥 ∈ 𝐴 ¬ 𝑥𝑅𝑥)
9		vex 3484	. . . . . . . . . . . 12 ⊢ 𝑦 ∈ V
10	2, 9	brcnv 5893	. . . . . . . . . . 11 ⊢ (𝑧◡𝑅𝑦 ↔ 𝑦𝑅𝑧)
11		vex 3484	. . . . . . . . . . . 12 ⊢ 𝑥 ∈ V
12	9, 11	brcnv 5893	. . . . . . . . . . 11 ⊢ (𝑦◡𝑅𝑥 ↔ 𝑥𝑅𝑦)
13	10, 12	anbi12ci 629	. . . . . . . . . 10 ⊢ ((𝑧◡𝑅𝑦 ∧ 𝑦◡𝑅𝑥) ↔ (𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧))
14	2, 11	brcnv 5893	. . . . . . . . . 10 ⊢ (𝑧◡𝑅𝑥 ↔ 𝑥𝑅𝑧)
15	13, 14	imbi12i 350	. . . . . . . . 9 ⊢ (((𝑧◡𝑅𝑦 ∧ 𝑦◡𝑅𝑥) → 𝑧◡𝑅𝑥) ↔ ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧))
16	15	ralbii 3093	. . . . . . . 8 ⊢ (∀𝑧 ∈ 𝐴 ((𝑧◡𝑅𝑦 ∧ 𝑦◡𝑅𝑥) → 𝑧◡𝑅𝑥) ↔ ∀𝑧 ∈ 𝐴 ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧))
17	8, 16	anbi12i 628	. . . . . . 7 ⊢ ((∀𝑧 ∈ 𝐴 ¬ 𝑧◡𝑅𝑧 ∧ ∀𝑧 ∈ 𝐴 ((𝑧◡𝑅𝑦 ∧ 𝑦◡𝑅𝑥) → 𝑧◡𝑅𝑥)) ↔ (∀𝑥 ∈ 𝐴 ¬ 𝑥𝑅𝑥 ∧ ∀𝑧 ∈ 𝐴 ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)))
18	1, 17	bitr2i 276	. . . . . 6 ⊢ ((∀𝑥 ∈ 𝐴 ¬ 𝑥𝑅𝑥 ∧ ∀𝑧 ∈ 𝐴 ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)) ↔ ∀𝑧 ∈ 𝐴 (¬ 𝑧◡𝑅𝑧 ∧ ((𝑧◡𝑅𝑦 ∧ 𝑦◡𝑅𝑥) → 𝑧◡𝑅𝑥)))
19	18	ralbii 3093	. . . . 5 ⊢ (∀𝑥 ∈ 𝐴 (∀𝑥 ∈ 𝐴 ¬ 𝑥𝑅𝑥 ∧ ∀𝑧 ∈ 𝐴 ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)) ↔ ∀𝑥 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (¬ 𝑧◡𝑅𝑧 ∧ ((𝑧◡𝑅𝑦 ∧ 𝑦◡𝑅𝑥) → 𝑧◡𝑅𝑥)))
20		r19.26 3111	. . . . . . 7 ⊢ (∀𝑥 ∈ 𝐴 (∀𝑧 ∈ 𝐴 ¬ 𝑥𝑅𝑥 ∧ ∀𝑧 ∈ 𝐴 ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)) ↔ (∀𝑥 ∈ 𝐴 ∀𝑧 ∈ 𝐴 ¬ 𝑥𝑅𝑥 ∧ ∀𝑥 ∈ 𝐴 ∀𝑧 ∈ 𝐴 ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)))
21		ralidm 4512	. . . . . . . . 9 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑥 ∈ 𝐴 ¬ 𝑥𝑅𝑥 ↔ ∀𝑥 ∈ 𝐴 ¬ 𝑥𝑅𝑥)
22		rzal 4509	. . . . . . . . . . 11 ⊢ (𝐴 = ∅ → ∀𝑥 ∈ 𝐴 ¬ 𝑥𝑅𝑥)
23		rzal 4509	. . . . . . . . . . 11 ⊢ (𝐴 = ∅ → ∀𝑥 ∈ 𝐴 ∀𝑧 ∈ 𝐴 ¬ 𝑥𝑅𝑥)
24	22, 23	2thd 265	. . . . . . . . . 10 ⊢ (𝐴 = ∅ → (∀𝑥 ∈ 𝐴 ¬ 𝑥𝑅𝑥 ↔ ∀𝑥 ∈ 𝐴 ∀𝑧 ∈ 𝐴 ¬ 𝑥𝑅𝑥))
25		r19.3rzv 4499	. . . . . . . . . . 11 ⊢ (𝐴 ≠ ∅ → (¬ 𝑥𝑅𝑥 ↔ ∀𝑧 ∈ 𝐴 ¬ 𝑥𝑅𝑥))
26	25	ralbidv 3178	. . . . . . . . . 10 ⊢ (𝐴 ≠ ∅ → (∀𝑥 ∈ 𝐴 ¬ 𝑥𝑅𝑥 ↔ ∀𝑥 ∈ 𝐴 ∀𝑧 ∈ 𝐴 ¬ 𝑥𝑅𝑥))
27	24, 26	pm2.61ine 3025	. . . . . . . . 9 ⊢ (∀𝑥 ∈ 𝐴 ¬ 𝑥𝑅𝑥 ↔ ∀𝑥 ∈ 𝐴 ∀𝑧 ∈ 𝐴 ¬ 𝑥𝑅𝑥)
28	21, 27	bitr2i 276	. . . . . . . 8 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑧 ∈ 𝐴 ¬ 𝑥𝑅𝑥 ↔ ∀𝑥 ∈ 𝐴 ∀𝑥 ∈ 𝐴 ¬ 𝑥𝑅𝑥)
29	28	anbi1i 624	. . . . . . 7 ⊢ ((∀𝑥 ∈ 𝐴 ∀𝑧 ∈ 𝐴 ¬ 𝑥𝑅𝑥 ∧ ∀𝑥 ∈ 𝐴 ∀𝑧 ∈ 𝐴 ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)) ↔ (∀𝑥 ∈ 𝐴 ∀𝑥 ∈ 𝐴 ¬ 𝑥𝑅𝑥 ∧ ∀𝑥 ∈ 𝐴 ∀𝑧 ∈ 𝐴 ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)))
30	20, 29	bitri 275	. . . . . 6 ⊢ (∀𝑥 ∈ 𝐴 (∀𝑧 ∈ 𝐴 ¬ 𝑥𝑅𝑥 ∧ ∀𝑧 ∈ 𝐴 ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)) ↔ (∀𝑥 ∈ 𝐴 ∀𝑥 ∈ 𝐴 ¬ 𝑥𝑅𝑥 ∧ ∀𝑥 ∈ 𝐴 ∀𝑧 ∈ 𝐴 ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)))
31		r19.26 3111	. . . . . . 7 ⊢ (∀𝑧 ∈ 𝐴 (¬ 𝑥𝑅𝑥 ∧ ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)) ↔ (∀𝑧 ∈ 𝐴 ¬ 𝑥𝑅𝑥 ∧ ∀𝑧 ∈ 𝐴 ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)))
32	31	ralbii 3093	. . . . . 6 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (¬ 𝑥𝑅𝑥 ∧ ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)) ↔ ∀𝑥 ∈ 𝐴 (∀𝑧 ∈ 𝐴 ¬ 𝑥𝑅𝑥 ∧ ∀𝑧 ∈ 𝐴 ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)))
33		r19.26 3111	. . . . . 6 ⊢ (∀𝑥 ∈ 𝐴 (∀𝑥 ∈ 𝐴 ¬ 𝑥𝑅𝑥 ∧ ∀𝑧 ∈ 𝐴 ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)) ↔ (∀𝑥 ∈ 𝐴 ∀𝑥 ∈ 𝐴 ¬ 𝑥𝑅𝑥 ∧ ∀𝑥 ∈ 𝐴 ∀𝑧 ∈ 𝐴 ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)))
34	30, 32, 33	3bitr4i 303	. . . . 5 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (¬ 𝑥𝑅𝑥 ∧ ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)) ↔ ∀𝑥 ∈ 𝐴 (∀𝑥 ∈ 𝐴 ¬ 𝑥𝑅𝑥 ∧ ∀𝑧 ∈ 𝐴 ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)))
35		ralcom 3289	. . . . 5 ⊢ (∀𝑧 ∈ 𝐴 ∀𝑥 ∈ 𝐴 (¬ 𝑧◡𝑅𝑧 ∧ ((𝑧◡𝑅𝑦 ∧ 𝑦◡𝑅𝑥) → 𝑧◡𝑅𝑥)) ↔ ∀𝑥 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (¬ 𝑧◡𝑅𝑧 ∧ ((𝑧◡𝑅𝑦 ∧ 𝑦◡𝑅𝑥) → 𝑧◡𝑅𝑥)))
36	19, 34, 35	3bitr4i 303	. . . 4 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (¬ 𝑥𝑅𝑥 ∧ ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)) ↔ ∀𝑧 ∈ 𝐴 ∀𝑥 ∈ 𝐴 (¬ 𝑧◡𝑅𝑧 ∧ ((𝑧◡𝑅𝑦 ∧ 𝑦◡𝑅𝑥) → 𝑧◡𝑅𝑥)))
37	36	ralbii 3093	. . 3 ⊢ (∀𝑦 ∈ 𝐴 ∀𝑥 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (¬ 𝑥𝑅𝑥 ∧ ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)) ↔ ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 ∀𝑥 ∈ 𝐴 (¬ 𝑧◡𝑅𝑧 ∧ ((𝑧◡𝑅𝑦 ∧ 𝑦◡𝑅𝑥) → 𝑧◡𝑅𝑥)))
38		ralcom 3289	. . 3 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (¬ 𝑥𝑅𝑥 ∧ ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)) ↔ ∀𝑦 ∈ 𝐴 ∀𝑥 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (¬ 𝑥𝑅𝑥 ∧ ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)))
39		ralcom 3289	. . 3 ⊢ (∀𝑧 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ∀𝑥 ∈ 𝐴 (¬ 𝑧◡𝑅𝑧 ∧ ((𝑧◡𝑅𝑦 ∧ 𝑦◡𝑅𝑥) → 𝑧◡𝑅𝑥)) ↔ ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 ∀𝑥 ∈ 𝐴 (¬ 𝑧◡𝑅𝑧 ∧ ((𝑧◡𝑅𝑦 ∧ 𝑦◡𝑅𝑥) → 𝑧◡𝑅𝑥)))
40	37, 38, 39	3bitr4i 303	. 2 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (¬ 𝑥𝑅𝑥 ∧ ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)) ↔ ∀𝑧 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ∀𝑥 ∈ 𝐴 (¬ 𝑧◡𝑅𝑧 ∧ ((𝑧◡𝑅𝑦 ∧ 𝑦◡𝑅𝑥) → 𝑧◡𝑅𝑥)))
41		df-po 5592	. 2 ⊢ (𝑅 Po 𝐴 ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (¬ 𝑥𝑅𝑥 ∧ ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)))
42		df-po 5592	. 2 ⊢ (◡𝑅 Po 𝐴 ↔ ∀𝑧 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ∀𝑥 ∈ 𝐴 (¬ 𝑧◡𝑅𝑧 ∧ ((𝑧◡𝑅𝑦 ∧ 𝑦◡𝑅𝑥) → 𝑧◡𝑅𝑥)))
43	40, 41, 42	3bitr4i 303	1 ⊢ (𝑅 Po 𝐴 ↔ ◡𝑅 Po 𝐴)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1540   ≠ wne 2940  ∀wral 3061  ∅c0 4333   class class class wbr 5143   Po wpo 5590  ^◡ccnv 5684

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 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2708  ax-sep 5296  ax-nul 5306  ax-pr 5432

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-clab 2715  df-cleq 2729  df-clel 2816  df-ne 2941  df-ral 3062  df-rab 3437  df-v 3482  df-dif 3954  df-un 3956  df-ss 3968  df-nul 4334  df-if 4526  df-sn 4627  df-pr 4629  df-op 4633  df-br 5144  df-opab 5206  df-po 5592  df-cnv 5693

This theorem is referenced by:  cnvso  6308  fimax2g  9322  fin23lem40  10391  isfin1-3  10426