Theorem cnvimassrndmOLD 6201

Description: Obsolete version of cnvimarndm 6081 as of 29-Sep-2026. (Contributed by AV, 18-Sep-2024.) (Proof modification is discouraged.) (New usage is discouraged.)

Assertion

Ref	Expression
cnvimassrndmOLD	⊢ (ran 𝐹 ⊆ 𝐴 → (◡𝐹 “ 𝐴) = dom 𝐹)

Proof of Theorem cnvimassrndmOLD

Step	Hyp	Ref	Expression
1		ssequn1 4183	. 2 ⊢ (ran 𝐹 ⊆ 𝐴 ↔ (ran 𝐹 ∪ 𝐴) = 𝐴)
2		imaeq2 6049	. . . . 5 ⊢ (𝐴 = (ran 𝐹 ∪ 𝐴) → (◡𝐹 “ 𝐴) = (◡𝐹 “ (ran 𝐹 ∪ 𝐴)))
3		imaundi 6142	. . . . 5 ⊢ (◡𝐹 “ (ran 𝐹 ∪ 𝐴)) = ((◡𝐹 “ ran 𝐹) ∪ (◡𝐹 “ 𝐴))
4	2, 3	eqtrdi 2811	. . . 4 ⊢ (𝐴 = (ran 𝐹 ∪ 𝐴) → (◡𝐹 “ 𝐴) = ((◡𝐹 “ ran 𝐹) ∪ (◡𝐹 “ 𝐴)))
5		cnvimarndm 6081	. . . . . 6 ⊢ (◡𝐹 “ ran 𝐹) = dom 𝐹
6	5	uneq1i 4162	. . . . 5 ⊢ ((◡𝐹 “ ran 𝐹) ∪ (◡𝐹 “ 𝐴)) = (dom 𝐹 ∪ (◡𝐹 “ 𝐴))
7		cnvimass 6200	. . . . . 6 ⊢ (◡𝐹 “ 𝐴) ⊆ dom 𝐹
8		ssequn2 4186	. . . . . 6 ⊢ ((◡𝐹 “ 𝐴) ⊆ dom 𝐹 ↔ (dom 𝐹 ∪ (◡𝐹 “ 𝐴)) = dom 𝐹)
9	7, 8	mpbi 233	. . . . 5 ⊢ (dom 𝐹 ∪ (◡𝐹 “ 𝐴)) = dom 𝐹
10	6, 9	eqtri 2783	. . . 4 ⊢ ((◡𝐹 “ ran 𝐹) ∪ (◡𝐹 “ 𝐴)) = dom 𝐹
11	4, 10	eqtrdi 2811	. . 3 ⊢ (𝐴 = (ran 𝐹 ∪ 𝐴) → (◡𝐹 “ 𝐴) = dom 𝐹)
12	11	eqcoms 2768	. 2 ⊢ ((ran 𝐹 ∪ 𝐴) = 𝐴 → (◡𝐹 “ 𝐴) = dom 𝐹)
13	1, 12	sylbi 220	1 ⊢ (ran 𝐹 ⊆ 𝐴 → (◡𝐹 “ 𝐴) = dom 𝐹)

This proof depends on syntax axioms:   → wi 4   = wceq 1569   ⊆ wss 3896   ∪ cun 4148  ^◡ccnv 5649  dom cdm 5650  ran crn 5651   “ cima 5653

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732  ax-sep 5248  ax-pr 5390

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-br 5103  df-opab 5167  df-xp 5656  df-rel 5657  df-cnv 5658  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663

This theorem is used by: (None)