Theorem tposrescnv 49956

Description: The transposition restricted to a converse is the transposition of the restricted class, with the empty set removed from the domain. Note that the right hand side is a more useful form of (tpos (𝐹 ↾ 𝑅) ↾ (V ∖ {∅})) by df-tpos 8236. (Contributed by Zhi Wang, 6-Oct-2025.)

Assertion

Ref	Expression
tposrescnv	⊢ (tpos 𝐹 ↾ ◡𝑅) = (𝐹 ∘ (𝑥 ∈ ◡dom (𝐹 ↾ 𝑅) ↦ ∪ ◡{𝑥}))

Distinct variable groups:   𝑥,𝐹   𝑥,𝑅

Proof of Theorem tposrescnv

Step	Hyp	Ref	Expression
1		df-tpos 8236	. . 3 ⊢ tpos 𝐹 = (𝐹 ∘ (𝑥 ∈ (◡dom 𝐹 ∪ {∅}) ↦ ∪ ◡{𝑥}))
2	1	reseq1i 5966	. 2 ⊢ (tpos 𝐹 ↾ ◡𝑅) = ((𝐹 ∘ (𝑥 ∈ (◡dom 𝐹 ∪ {∅}) ↦ ∪ ◡{𝑥})) ↾ ◡𝑅)
3		resco 6250	. 2 ⊢ ((𝐹 ∘ (𝑥 ∈ (◡dom 𝐹 ∪ {∅}) ↦ ∪ ◡{𝑥})) ↾ ◡𝑅) = (𝐹 ∘ ((𝑥 ∈ (◡dom 𝐹 ∪ {∅}) ↦ ∪ ◡{𝑥}) ↾ ◡𝑅))
4		resmpt3 6030	. . . 4 ⊢ ((𝑥 ∈ (◡dom 𝐹 ∪ {∅}) ↦ ∪ ◡{𝑥}) ↾ ◡𝑅) = (𝑥 ∈ ((◡dom 𝐹 ∪ {∅}) ∩ ◡𝑅) ↦ ∪ ◡{𝑥})
5		cnvin 6135	. . . . . 6 ⊢ ◡(𝑅 ∩ dom 𝐹) = (◡𝑅 ∩ ◡dom 𝐹)
6		dmres 6003	. . . . . . 7 ⊢ dom (𝐹 ↾ 𝑅) = (𝑅 ∩ dom 𝐹)
7	6	cnveqi 5852	. . . . . 6 ⊢ ◡dom (𝐹 ↾ 𝑅) = ◡(𝑅 ∩ dom 𝐹)
8		incom 4155	. . . . . . 7 ⊢ ((◡dom 𝐹 ∪ {∅}) ∩ ◡𝑅) = (◡𝑅 ∩ (◡dom 𝐹 ∪ {∅}))
9		indi 4230	. . . . . . 7 ⊢ (◡𝑅 ∩ (◡dom 𝐹 ∪ {∅})) = ((◡𝑅 ∩ ◡dom 𝐹) ∪ (◡𝑅 ∩ {∅}))
10		relcnv 6100	. . . . . . . . . . 11 ⊢ Rel ◡𝑅
11		0nelrel0 5711	. . . . . . . . . . 11 ⊢ (Rel ◡𝑅 → ¬ ∅ ∈ ◡𝑅)
12	10, 11	ax-mp 5	. . . . . . . . . 10 ⊢ ¬ ∅ ∈ ◡𝑅
13		disjsn 4672	. . . . . . . . . 10 ⊢ ((◡𝑅 ∩ {∅}) = ∅ ↔ ¬ ∅ ∈ ◡𝑅)
14	12, 13	mpbir 234	. . . . . . . . 9 ⊢ (◡𝑅 ∩ {∅}) = ∅
15	14	uneq2i 4112	. . . . . . . 8 ⊢ ((◡𝑅 ∩ ◡dom 𝐹) ∪ (◡𝑅 ∩ {∅})) = ((◡𝑅 ∩ ◡dom 𝐹) ∪ ∅)
16		un0 4344	. . . . . . . 8 ⊢ ((◡𝑅 ∩ ◡dom 𝐹) ∪ ∅) = (◡𝑅 ∩ ◡dom 𝐹)
17	15, 16	eqtri 2784	. . . . . . 7 ⊢ ((◡𝑅 ∩ ◡dom 𝐹) ∪ (◡𝑅 ∩ {∅})) = (◡𝑅 ∩ ◡dom 𝐹)
18	8, 9, 17	3eqtri 2788	. . . . . 6 ⊢ ((◡dom 𝐹 ∪ {∅}) ∩ ◡𝑅) = (◡𝑅 ∩ ◡dom 𝐹)
19	5, 7, 18	3eqtr4ri 2795	. . . . 5 ⊢ ((◡dom 𝐹 ∪ {∅}) ∩ ◡𝑅) = ◡dom (𝐹 ↾ 𝑅)
20	19	mpteq1i 5196	. . . 4 ⊢ (𝑥 ∈ ((◡dom 𝐹 ∪ {∅}) ∩ ◡𝑅) ↦ ∪ ◡{𝑥}) = (𝑥 ∈ ◡dom (𝐹 ↾ 𝑅) ↦ ∪ ◡{𝑥})
21	4, 20	eqtri 2784	. . 3 ⊢ ((𝑥 ∈ (◡dom 𝐹 ∪ {∅}) ↦ ∪ ◡{𝑥}) ↾ ◡𝑅) = (𝑥 ∈ ◡dom (𝐹 ↾ 𝑅) ↦ ∪ ◡{𝑥})
22	21	coeq2i 5838	. 2 ⊢ (𝐹 ∘ ((𝑥 ∈ (◡dom 𝐹 ∪ {∅}) ↦ ∪ ◡{𝑥}) ↾ ◡𝑅)) = (𝐹 ∘ (𝑥 ∈ ◡dom (𝐹 ↾ 𝑅) ↦ ∪ ◡{𝑥}))
23	2, 3, 22	3eqtri 2788	1 ⊢ (tpos 𝐹 ↾ ◡𝑅) = (𝐹 ∘ (𝑥 ∈ ◡dom (𝐹 ↾ 𝑅) ↦ ∪ ◡{𝑥}))

This proof depends on syntax axioms:  ¬ wn 3   = wceq 1570   ∈ wcel 2145   ∪ cun 3897   ∩ cin 3898  ∅c0 4279  {csn 4584  ∪ cuni 4867   ↦ cmpt 5186  ^◡ccnv 5650  dom cdm 5651   ↾ cres 5653   ∘ ccom 5655  Rel wrel 5656  tpos ctpos 8235

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-10 2178  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-pr 5391

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-nf 1817  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-br 5104  df-opab 5168  df-mpt 5187  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-res 5663  df-tpos 8236

This theorem is used by:  tposres3  49958