Theorem tposrescnv 49697

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 8231. (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 8231	. . 3 ⊢ tpos 𝐹 = (𝐹 ∘ (𝑥 ∈ (◡dom 𝐹 ∪ {∅}) ↦ ∪ ◡{𝑥}))
2	1	reseq1i 5979	. 2 ⊢ (tpos 𝐹 ↾ ◡𝑅) = ((𝐹 ∘ (𝑥 ∈ (◡dom 𝐹 ∪ {∅}) ↦ ∪ ◡{𝑥})) ↾ ◡𝑅)
3		resco 6256	. 2 ⊢ ((𝐹 ∘ (𝑥 ∈ (◡dom 𝐹 ∪ {∅}) ↦ ∪ ◡{𝑥})) ↾ ◡𝑅) = (𝐹 ∘ ((𝑥 ∈ (◡dom 𝐹 ∪ {∅}) ↦ ∪ ◡{𝑥}) ↾ ◡𝑅))
4		resmpt3 6045	. . . 4 ⊢ ((𝑥 ∈ (◡dom 𝐹 ∪ {∅}) ↦ ∪ ◡{𝑥}) ↾ ◡𝑅) = (𝑥 ∈ ((◡dom 𝐹 ∪ {∅}) ∩ ◡𝑅) ↦ ∪ ◡{𝑥})
5		cnvin 6146	. . . . . 6 ⊢ ◡(𝑅 ∩ dom 𝐹) = (◡𝑅 ∩ ◡dom 𝐹)
6		dmres 6016	. . . . . . 7 ⊢ dom (𝐹 ↾ 𝑅) = (𝑅 ∩ dom 𝐹)
7	6	cnveqi 5865	. . . . . 6 ⊢ ◡dom (𝐹 ↾ 𝑅) = ◡(𝑅 ∩ dom 𝐹)
8		incom 4165	. . . . . . 7 ⊢ ((◡dom 𝐹 ∪ {∅}) ∩ ◡𝑅) = (◡𝑅 ∩ (◡dom 𝐹 ∪ {∅}))
9		indi 4240	. . . . . . 7 ⊢ (◡𝑅 ∩ (◡dom 𝐹 ∪ {∅})) = ((◡𝑅 ∩ ◡dom 𝐹) ∪ (◡𝑅 ∩ {∅}))
10		relcnv 6111	. . . . . . . . . . 11 ⊢ Rel ◡𝑅
11		0nelrel0 5726	. . . . . . . . . . 11 ⊢ (Rel ◡𝑅 → ¬ ∅ ∈ ◡𝑅)
12	10, 11	ax-mp 5	. . . . . . . . . 10 ⊢ ¬ ∅ ∈ ◡𝑅
13		disjsn 4682	. . . . . . . . . 10 ⊢ ((◡𝑅 ∩ {∅}) = ∅ ↔ ¬ ∅ ∈ ◡𝑅)
14	12, 13	mpbir 234	. . . . . . . . 9 ⊢ (◡𝑅 ∩ {∅}) = ∅
15	14	uneq2i 4122	. . . . . . . 8 ⊢ ((◡𝑅 ∩ ◡dom 𝐹) ∪ (◡𝑅 ∩ {∅})) = ((◡𝑅 ∩ ◡dom 𝐹) ∪ ∅)
16		un0 4354	. . . . . . . 8 ⊢ ((◡𝑅 ∩ ◡dom 𝐹) ∪ ∅) = (◡𝑅 ∩ ◡dom 𝐹)
17	15, 16	eqtri 2789	. . . . . . 7 ⊢ ((◡𝑅 ∩ ◡dom 𝐹) ∪ (◡𝑅 ∩ {∅})) = (◡𝑅 ∩ ◡dom 𝐹)
18	8, 9, 17	3eqtri 2793	. . . . . 6 ⊢ ((◡dom 𝐹 ∪ {∅}) ∩ ◡𝑅) = (◡𝑅 ∩ ◡dom 𝐹)
19	5, 7, 18	3eqtr4ri 2800	. . . . 5 ⊢ ((◡dom 𝐹 ∪ {∅}) ∩ ◡𝑅) = ◡dom (𝐹 ↾ 𝑅)
20	19	mpteq1i 5207	. . . 4 ⊢ (𝑥 ∈ ((◡dom 𝐹 ∪ {∅}) ∩ ◡𝑅) ↦ ∪ ◡{𝑥}) = (𝑥 ∈ ◡dom (𝐹 ↾ 𝑅) ↦ ∪ ◡{𝑥})
21	4, 20	eqtri 2789	. . 3 ⊢ ((𝑥 ∈ (◡dom 𝐹 ∪ {∅}) ↦ ∪ ◡{𝑥}) ↾ ◡𝑅) = (𝑥 ∈ ◡dom (𝐹 ↾ 𝑅) ↦ ∪ ◡{𝑥})
22	21	coeq2i 5851	. 2 ⊢ (𝐹 ∘ ((𝑥 ∈ (◡dom 𝐹 ∪ {∅}) ↦ ∪ ◡{𝑥}) ↾ ◡𝑅)) = (𝐹 ∘ (𝑥 ∈ ◡dom (𝐹 ↾ 𝑅) ↦ ∪ ◡{𝑥}))
23	2, 3, 22	3eqtri 2793	1 ⊢ (tpos 𝐹 ↾ ◡𝑅) = (𝐹 ∘ (𝑥 ∈ ◡dom (𝐹 ↾ 𝑅) ↦ ∪ ◡{𝑥}))

This proof depends on syntax axioms:  ¬ wn 3   = wceq 1570   ∈ wcel 2146   ∪ cun 3906   ∩ cin 3907  ∅c0 4289  {csn 4594  ∪ cuni 4877   ↦ cmpt 5197  ^◡ccnv 5665  dom cdm 5666   ↾ cres 5668   ∘ ccom 5670  Rel wrel 5671  tpos ctpos 8230

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-10 2179  ax-12 2216  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-nf 1817  df-sb 2100  df-clab 2745  df-cleq 2758  df-clel 2841  df-ne 2962  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-mpt 5198  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-res 5678  df-tpos 8231

This theorem is used by:  tposres3  49699