Theorem cnvpom 5330

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

Assertion

Ref	Expression
cnvpom	⊢ (∃𝑥 𝑥 ∈ 𝐴 → (𝑅 Po 𝐴 ↔ ◡𝑅 Po 𝐴))

Distinct variable groups:   𝑥,𝐴   𝑥,𝑅

Proof of Theorem cnvpom

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

Step	Hyp	Ref	Expression
1		r19.26 2677	. . . . . . 7 ⊢ (∀𝑤 ∈ 𝐴 (∀𝑧 ∈ 𝐴 ¬ 𝑤𝑅𝑤 ∧ ∀𝑧 ∈ 𝐴 ((𝑤𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑤𝑅𝑧)) ↔ (∀𝑤 ∈ 𝐴 ∀𝑧 ∈ 𝐴 ¬ 𝑤𝑅𝑤 ∧ ∀𝑤 ∈ 𝐴 ∀𝑧 ∈ 𝐴 ((𝑤𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑤𝑅𝑧)))
2		ralidm 3628	. . . . . . . . 9 ⊢ (∀𝑤 ∈ 𝐴 ∀𝑤 ∈ 𝐴 ¬ 𝑤𝑅𝑤 ↔ ∀𝑤 ∈ 𝐴 ¬ 𝑤𝑅𝑤)
3		r19.3rmv 3618	. . . . . . . . . 10 ⊢ (∃𝑥 𝑥 ∈ 𝐴 → (¬ 𝑤𝑅𝑤 ↔ ∀𝑧 ∈ 𝐴 ¬ 𝑤𝑅𝑤))
4	3	ralbidv 2550	. . . . . . . . 9 ⊢ (∃𝑥 𝑥 ∈ 𝐴 → (∀𝑤 ∈ 𝐴 ¬ 𝑤𝑅𝑤 ↔ ∀𝑤 ∈ 𝐴 ∀𝑧 ∈ 𝐴 ¬ 𝑤𝑅𝑤))
5	2, 4	bitr2id 193	. . . . . . . 8 ⊢ (∃𝑥 𝑥 ∈ 𝐴 → (∀𝑤 ∈ 𝐴 ∀𝑧 ∈ 𝐴 ¬ 𝑤𝑅𝑤 ↔ ∀𝑤 ∈ 𝐴 ∀𝑤 ∈ 𝐴 ¬ 𝑤𝑅𝑤))
6	5	anbi1d 469	. . . . . . 7 ⊢ (∃𝑥 𝑥 ∈ 𝐴 → ((∀𝑤 ∈ 𝐴 ∀𝑧 ∈ 𝐴 ¬ 𝑤𝑅𝑤 ∧ ∀𝑤 ∈ 𝐴 ∀𝑧 ∈ 𝐴 ((𝑤𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑤𝑅𝑧)) ↔ (∀𝑤 ∈ 𝐴 ∀𝑤 ∈ 𝐴 ¬ 𝑤𝑅𝑤 ∧ ∀𝑤 ∈ 𝐴 ∀𝑧 ∈ 𝐴 ((𝑤𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑤𝑅𝑧))))
7	1, 6	bitrid 192	. . . . . 6 ⊢ (∃𝑥 𝑥 ∈ 𝐴 → (∀𝑤 ∈ 𝐴 (∀𝑧 ∈ 𝐴 ¬ 𝑤𝑅𝑤 ∧ ∀𝑧 ∈ 𝐴 ((𝑤𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑤𝑅𝑧)) ↔ (∀𝑤 ∈ 𝐴 ∀𝑤 ∈ 𝐴 ¬ 𝑤𝑅𝑤 ∧ ∀𝑤 ∈ 𝐴 ∀𝑧 ∈ 𝐴 ((𝑤𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑤𝑅𝑧))))
8		r19.26 2677	. . . . . . 7 ⊢ (∀𝑧 ∈ 𝐴 (¬ 𝑤𝑅𝑤 ∧ ((𝑤𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑤𝑅𝑧)) ↔ (∀𝑧 ∈ 𝐴 ¬ 𝑤𝑅𝑤 ∧ ∀𝑧 ∈ 𝐴 ((𝑤𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑤𝑅𝑧)))
9	8	ralbii 2556	. . . . . 6 ⊢ (∀𝑤 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (¬ 𝑤𝑅𝑤 ∧ ((𝑤𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑤𝑅𝑧)) ↔ ∀𝑤 ∈ 𝐴 (∀𝑧 ∈ 𝐴 ¬ 𝑤𝑅𝑤 ∧ ∀𝑧 ∈ 𝐴 ((𝑤𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑤𝑅𝑧)))
10		r19.26 2677	. . . . . 6 ⊢ (∀𝑤 ∈ 𝐴 (∀𝑤 ∈ 𝐴 ¬ 𝑤𝑅𝑤 ∧ ∀𝑧 ∈ 𝐴 ((𝑤𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑤𝑅𝑧)) ↔ (∀𝑤 ∈ 𝐴 ∀𝑤 ∈ 𝐴 ¬ 𝑤𝑅𝑤 ∧ ∀𝑤 ∈ 𝐴 ∀𝑧 ∈ 𝐴 ((𝑤𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑤𝑅𝑧)))
11	7, 9, 10	3bitr4g 223	. . . . 5 ⊢ (∃𝑥 𝑥 ∈ 𝐴 → (∀𝑤 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (¬ 𝑤𝑅𝑤 ∧ ((𝑤𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑤𝑅𝑧)) ↔ ∀𝑤 ∈ 𝐴 (∀𝑤 ∈ 𝐴 ¬ 𝑤𝑅𝑤 ∧ ∀𝑧 ∈ 𝐴 ((𝑤𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑤𝑅𝑧))))
12		r19.26 2677	. . . . . . . 8 ⊢ (∀𝑧 ∈ 𝐴 (¬ 𝑧◡𝑅𝑧 ∧ ((𝑧◡𝑅𝑦 ∧ 𝑦◡𝑅𝑤) → 𝑧◡𝑅𝑤)) ↔ (∀𝑧 ∈ 𝐴 ¬ 𝑧◡𝑅𝑧 ∧ ∀𝑧 ∈ 𝐴 ((𝑧◡𝑅𝑦 ∧ 𝑦◡𝑅𝑤) → 𝑧◡𝑅𝑤)))
13		vex 2824	. . . . . . . . . . . . 13 ⊢ 𝑧 ∈ V
14	13, 13	brcnv 4963	. . . . . . . . . . . 12 ⊢ (𝑧◡𝑅𝑧 ↔ 𝑧𝑅𝑧)
15		id 19	. . . . . . . . . . . . 13 ⊢ (𝑧 = 𝑤 → 𝑧 = 𝑤)
16	15, 15	breq12d 4143	. . . . . . . . . . . 12 ⊢ (𝑧 = 𝑤 → (𝑧𝑅𝑧 ↔ 𝑤𝑅𝑤))
17	14, 16	bitrid 192	. . . . . . . . . . 11 ⊢ (𝑧 = 𝑤 → (𝑧◡𝑅𝑧 ↔ 𝑤𝑅𝑤))
18	17	notbid 677	. . . . . . . . . 10 ⊢ (𝑧 = 𝑤 → (¬ 𝑧◡𝑅𝑧 ↔ ¬ 𝑤𝑅𝑤))
19	18	cbvralv 2786	. . . . . . . . 9 ⊢ (∀𝑧 ∈ 𝐴 ¬ 𝑧◡𝑅𝑧 ↔ ∀𝑤 ∈ 𝐴 ¬ 𝑤𝑅𝑤)
20		vex 2824	. . . . . . . . . . . . 13 ⊢ 𝑦 ∈ V
21	13, 20	brcnv 4963	. . . . . . . . . . . 12 ⊢ (𝑧◡𝑅𝑦 ↔ 𝑦𝑅𝑧)
22		vex 2824	. . . . . . . . . . . . 13 ⊢ 𝑤 ∈ V
23	20, 22	brcnv 4963	. . . . . . . . . . . 12 ⊢ (𝑦◡𝑅𝑤 ↔ 𝑤𝑅𝑦)
24	21, 23	anbi12ci 465	. . . . . . . . . . 11 ⊢ ((𝑧◡𝑅𝑦 ∧ 𝑦◡𝑅𝑤) ↔ (𝑤𝑅𝑦 ∧ 𝑦𝑅𝑧))
25	13, 22	brcnv 4963	. . . . . . . . . . 11 ⊢ (𝑧◡𝑅𝑤 ↔ 𝑤𝑅𝑧)
26	24, 25	imbi12i 239	. . . . . . . . . 10 ⊢ (((𝑧◡𝑅𝑦 ∧ 𝑦◡𝑅𝑤) → 𝑧◡𝑅𝑤) ↔ ((𝑤𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑤𝑅𝑧))
27	26	ralbii 2556	. . . . . . . . 9 ⊢ (∀𝑧 ∈ 𝐴 ((𝑧◡𝑅𝑦 ∧ 𝑦◡𝑅𝑤) → 𝑧◡𝑅𝑤) ↔ ∀𝑧 ∈ 𝐴 ((𝑤𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑤𝑅𝑧))
28	19, 27	anbi12i 464	. . . . . . . 8 ⊢ ((∀𝑧 ∈ 𝐴 ¬ 𝑧◡𝑅𝑧 ∧ ∀𝑧 ∈ 𝐴 ((𝑧◡𝑅𝑦 ∧ 𝑦◡𝑅𝑤) → 𝑧◡𝑅𝑤)) ↔ (∀𝑤 ∈ 𝐴 ¬ 𝑤𝑅𝑤 ∧ ∀𝑧 ∈ 𝐴 ((𝑤𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑤𝑅𝑧)))
29	12, 28	bitr2i 185	. . . . . . 7 ⊢ ((∀𝑤 ∈ 𝐴 ¬ 𝑤𝑅𝑤 ∧ ∀𝑧 ∈ 𝐴 ((𝑤𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑤𝑅𝑧)) ↔ ∀𝑧 ∈ 𝐴 (¬ 𝑧◡𝑅𝑧 ∧ ((𝑧◡𝑅𝑦 ∧ 𝑦◡𝑅𝑤) → 𝑧◡𝑅𝑤)))
30	29	ralbii 2556	. . . . . 6 ⊢ (∀𝑤 ∈ 𝐴 (∀𝑤 ∈ 𝐴 ¬ 𝑤𝑅𝑤 ∧ ∀𝑧 ∈ 𝐴 ((𝑤𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑤𝑅𝑧)) ↔ ∀𝑤 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (¬ 𝑧◡𝑅𝑧 ∧ ((𝑧◡𝑅𝑦 ∧ 𝑦◡𝑅𝑤) → 𝑧◡𝑅𝑤)))
31		ralcom 2714	. . . . . 6 ⊢ (∀𝑤 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (¬ 𝑧◡𝑅𝑧 ∧ ((𝑧◡𝑅𝑦 ∧ 𝑦◡𝑅𝑤) → 𝑧◡𝑅𝑤)) ↔ ∀𝑧 ∈ 𝐴 ∀𝑤 ∈ 𝐴 (¬ 𝑧◡𝑅𝑧 ∧ ((𝑧◡𝑅𝑦 ∧ 𝑦◡𝑅𝑤) → 𝑧◡𝑅𝑤)))
32	30, 31	bitri 184	. . . . 5 ⊢ (∀𝑤 ∈ 𝐴 (∀𝑤 ∈ 𝐴 ¬ 𝑤𝑅𝑤 ∧ ∀𝑧 ∈ 𝐴 ((𝑤𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑤𝑅𝑧)) ↔ ∀𝑧 ∈ 𝐴 ∀𝑤 ∈ 𝐴 (¬ 𝑧◡𝑅𝑧 ∧ ((𝑧◡𝑅𝑦 ∧ 𝑦◡𝑅𝑤) → 𝑧◡𝑅𝑤)))
33	11, 32	bitrdi 196	. . . 4 ⊢ (∃𝑥 𝑥 ∈ 𝐴 → (∀𝑤 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (¬ 𝑤𝑅𝑤 ∧ ((𝑤𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑤𝑅𝑧)) ↔ ∀𝑧 ∈ 𝐴 ∀𝑤 ∈ 𝐴 (¬ 𝑧◡𝑅𝑧 ∧ ((𝑧◡𝑅𝑦 ∧ 𝑦◡𝑅𝑤) → 𝑧◡𝑅𝑤))))
34	33	ralbidv 2550	. . 3 ⊢ (∃𝑥 𝑥 ∈ 𝐴 → (∀𝑦 ∈ 𝐴 ∀𝑤 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (¬ 𝑤𝑅𝑤 ∧ ((𝑤𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑤𝑅𝑧)) ↔ ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 ∀𝑤 ∈ 𝐴 (¬ 𝑧◡𝑅𝑧 ∧ ((𝑧◡𝑅𝑦 ∧ 𝑦◡𝑅𝑤) → 𝑧◡𝑅𝑤))))
35		ralcom 2714	. . 3 ⊢ (∀𝑤 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (¬ 𝑤𝑅𝑤 ∧ ((𝑤𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑤𝑅𝑧)) ↔ ∀𝑦 ∈ 𝐴 ∀𝑤 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (¬ 𝑤𝑅𝑤 ∧ ((𝑤𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑤𝑅𝑧)))
36		ralcom 2714	. . 3 ⊢ (∀𝑧 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ∀𝑤 ∈ 𝐴 (¬ 𝑧◡𝑅𝑧 ∧ ((𝑧◡𝑅𝑦 ∧ 𝑦◡𝑅𝑤) → 𝑧◡𝑅𝑤)) ↔ ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 ∀𝑤 ∈ 𝐴 (¬ 𝑧◡𝑅𝑧 ∧ ((𝑧◡𝑅𝑦 ∧ 𝑦◡𝑅𝑤) → 𝑧◡𝑅𝑤)))
37	34, 35, 36	3bitr4g 223	. 2 ⊢ (∃𝑥 𝑥 ∈ 𝐴 → (∀𝑤 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (¬ 𝑤𝑅𝑤 ∧ ((𝑤𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑤𝑅𝑧)) ↔ ∀𝑧 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ∀𝑤 ∈ 𝐴 (¬ 𝑧◡𝑅𝑧 ∧ ((𝑧◡𝑅𝑦 ∧ 𝑦◡𝑅𝑤) → 𝑧◡𝑅𝑤))))
38		df-po 4441	. 2 ⊢ (𝑅 Po 𝐴 ↔ ∀𝑤 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (¬ 𝑤𝑅𝑤 ∧ ((𝑤𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑤𝑅𝑧)))
39		df-po 4441	. 2 ⊢ (◡𝑅 Po 𝐴 ↔ ∀𝑧 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ∀𝑤 ∈ 𝐴 (¬ 𝑧◡𝑅𝑧 ∧ ((𝑧◡𝑅𝑦 ∧ 𝑦◡𝑅𝑤) → 𝑧◡𝑅𝑤)))
40	37, 38, 39	3bitr4g 223	1 ⊢ (∃𝑥 𝑥 ∈ 𝐴 → (𝑅 Po 𝐴 ↔ ◡𝑅 Po 𝐴))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 104   ↔ wb 105  ∃wex 1545   ∈ wcel 2209  ∀wral 2528   class class class wbr 4130   Po wpo 4439  ^◡ccnv 4773

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-br 4131  df-opab 4193  df-po 4441  df-cnv 4782

This theorem is used by:  cnvsom  5331