Theorem cnvpsb 18667

Description: The converse of a poset is a poset. (Contributed by FL, 5-Jan-2009.)

Assertion

Ref	Expression
cnvpsb	⊢ (Rel 𝑅 → (𝑅 ∈ PosetRel ↔ ◡𝑅 ∈ PosetRel))

Proof of Theorem cnvpsb

Step	Hyp	Ref	Expression
1		cnvps 18666	. 2 ⊢ (𝑅 ∈ PosetRel → ◡𝑅 ∈ PosetRel)
2		cnvps 18666	. . 3 ⊢ (◡𝑅 ∈ PosetRel → ◡◡𝑅 ∈ PosetRel)
3		dfrel2 6182	. . . 4 ⊢ (Rel 𝑅 ↔ ◡◡𝑅 = 𝑅)
4		eleq1 2848	. . . . 5 ⊢ (◡◡𝑅 = 𝑅 → (◡◡𝑅 ∈ PosetRel ↔ 𝑅 ∈ PosetRel))
5	4	biimpd 232	. . . 4 ⊢ (◡◡𝑅 = 𝑅 → (◡◡𝑅 ∈ PosetRel → 𝑅 ∈ PosetRel))
6	3, 5	sylbi 220	. . 3 ⊢ (Rel 𝑅 → (◡◡𝑅 ∈ PosetRel → 𝑅 ∈ PosetRel))
7	2, 6	syl5 35	. 2 ⊢ (Rel 𝑅 → (◡𝑅 ∈ PosetRel → 𝑅 ∈ PosetRel))
8	1, 7	impbid2 229	1 ⊢ (Rel 𝑅 → (𝑅 ∈ PosetRel ↔ ◡𝑅 ∈ PosetRel))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1570   ∈ wcel 2145  ^◡ccnv 5654  Rel wrel 5660  PosetRelcps 18652

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-pow 5330  ax-pr 5398  ax-un 7736

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-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-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ps 18654

This theorem is used by: (None)