Theorem cnvimassrndmOLD 6198

Description: Obsolete version of cnvimarndm 6080 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 4132	. 2 ⊢ (ran 𝐹 ⊆ 𝐴 ↔ (ran 𝐹 ∪ 𝐴) = 𝐴)
2		imaeq2 6048	. . . . 5 ⊢ (𝐴 = (ran 𝐹 ∪ 𝐴) → (◡𝐹 “ 𝐴) = (◡𝐹 “ (ran 𝐹 ∪ 𝐴)))
3		imaundi 6141	. . . . 5 ⊢ (◡𝐹 “ (ran 𝐹 ∪ 𝐴)) = ((◡𝐹 “ ran 𝐹) ∪ (◡𝐹 “ 𝐴))
4	2, 3	eqtrdi 2812	. . . 4 ⊢ (𝐴 = (ran 𝐹 ∪ 𝐴) → (◡𝐹 “ 𝐴) = ((◡𝐹 “ ran 𝐹) ∪ (◡𝐹 “ 𝐴)))
5		cnvimarndm 6080	. . . . . 6 ⊢ (◡𝐹 “ ran 𝐹) = dom 𝐹
6	5	uneq1i 4111	. . . . 5 ⊢ ((◡𝐹 “ ran 𝐹) ∪ (◡𝐹 “ 𝐴)) = (dom 𝐹 ∪ (◡𝐹 “ 𝐴))
7		cnvimass 6197	. . . . . 6 ⊢ (◡𝐹 “ 𝐴) ⊆ dom 𝐹
8		ssequn2 4135	. . . . . 6 ⊢ ((◡𝐹 “ 𝐴) ⊆ dom 𝐹 ↔ (dom 𝐹 ∪ (◡𝐹 “ 𝐴)) = dom 𝐹)
9	7, 8	mpbi 233	. . . . 5 ⊢ (dom 𝐹 ∪ (◡𝐹 “ 𝐴)) = dom 𝐹
10	6, 9	eqtri 2784	. . . 4 ⊢ ((◡𝐹 “ ran 𝐹) ∪ (◡𝐹 “ 𝐴)) = dom 𝐹
11	4, 10	eqtrdi 2812	. . 3 ⊢ (𝐴 = (ran 𝐹 ∪ 𝐴) → (◡𝐹 “ 𝐴) = dom 𝐹)
12	11	eqcoms 2769	. 2 ⊢ ((ran 𝐹 ∪ 𝐴) = 𝐴 → (◡𝐹 “ 𝐴) = dom 𝐹)
13	1, 12	sylbi 220	1 ⊢ (ran 𝐹 ⊆ 𝐴 → (◡𝐹 “ 𝐴) = dom 𝐹)

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∪ cun 3897   ⊆ wss 3899  ^◡ccnv 5650  dom cdm 5651  ran crn 5652   “ cima 5654

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 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-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  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-xp 5657  df-rel 5658  df-cnv 5659  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664

This theorem is used by: (None)