Theorem fimacnvOLD 6948

Description: Obsolete version of fimacnv 6622 as of 20-Sep-2024. (Contributed by FL, 25-Jan-2007.) (New usage is discouraged.) (Proof modification is discouraged.)

Assertion

Ref	Expression
fimacnvOLD	⊢ (𝐹:𝐴⟶𝐵 → (◡𝐹 “ 𝐵) = 𝐴)

Proof of Theorem fimacnvOLD

Step	Hyp	Ref	Expression
1		imassrn 5980	. . 3 ⊢ (◡𝐹 “ 𝐵) ⊆ ran ◡𝐹
2		dfdm4 5804	. . . 4 ⊢ dom 𝐹 = ran ◡𝐹
3		fdm 6609	. . . . 5 ⊢ (𝐹:𝐴⟶𝐵 → dom 𝐹 = 𝐴)
4		ssid 3943	. . . . 5 ⊢ 𝐴 ⊆ 𝐴
5	3, 4	eqsstrdi 3975	. . . 4 ⊢ (𝐹:𝐴⟶𝐵 → dom 𝐹 ⊆ 𝐴)
6	2, 5	eqsstrrid 3970	. . 3 ⊢ (𝐹:𝐴⟶𝐵 → ran ◡𝐹 ⊆ 𝐴)
7	1, 6	sstrid 3932	. 2 ⊢ (𝐹:𝐴⟶𝐵 → (◡𝐹 “ 𝐵) ⊆ 𝐴)
8		fimass 6621	. . 3 ⊢ (𝐹:𝐴⟶𝐵 → (𝐹 “ 𝐴) ⊆ 𝐵)
9		ffun 6603	. . . 4 ⊢ (𝐹:𝐴⟶𝐵 → Fun 𝐹)
10	4, 3	sseqtrrid 3974	. . . 4 ⊢ (𝐹:𝐴⟶𝐵 → 𝐴 ⊆ dom 𝐹)
11		funimass3 6931	. . . 4 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → ((𝐹 “ 𝐴) ⊆ 𝐵 ↔ 𝐴 ⊆ (◡𝐹 “ 𝐵)))
12	9, 10, 11	syl2anc 584	. . 3 ⊢ (𝐹:𝐴⟶𝐵 → ((𝐹 “ 𝐴) ⊆ 𝐵 ↔ 𝐴 ⊆ (◡𝐹 “ 𝐵)))
13	8, 12	mpbid 231	. 2 ⊢ (𝐹:𝐴⟶𝐵 → 𝐴 ⊆ (◡𝐹 “ 𝐵))
14	7, 13	eqssd 3938	1 ⊢ (𝐹:𝐴⟶𝐵 → (◡𝐹 “ 𝐵) = 𝐴)

Syntax hints:   → wi 4   ↔ wb 205   = wceq 1539   ⊆ wss 3887  ^◡ccnv 5588  dom cdm 5589  ran crn 5590   “ cima 5592  Fun wfun 6427  ⟶wf 6429

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pr 5352

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-br 5075  df-opab 5137  df-id 5489  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-fv 6441

This theorem is referenced by: (None)