Theorem fimacnvOLD 7072

Description: Obsolete version of fimacnv 6739 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 6070	. . 3 ⊢ (◡𝐹 “ 𝐵) ⊆ ran ◡𝐹
2		dfdm4 5895	. . . 4 ⊢ dom 𝐹 = ran ◡𝐹
3		fdm 6726	. . . . 5 ⊢ (𝐹:𝐴⟶𝐵 → dom 𝐹 = 𝐴)
4		ssid 4004	. . . . 5 ⊢ 𝐴 ⊆ 𝐴
5	3, 4	eqsstrdi 4036	. . . 4 ⊢ (𝐹:𝐴⟶𝐵 → dom 𝐹 ⊆ 𝐴)
6	2, 5	eqsstrrid 4031	. . 3 ⊢ (𝐹:𝐴⟶𝐵 → ran ◡𝐹 ⊆ 𝐴)
7	1, 6	sstrid 3993	. 2 ⊢ (𝐹:𝐴⟶𝐵 → (◡𝐹 “ 𝐵) ⊆ 𝐴)
8		fimass 6738	. . 3 ⊢ (𝐹:𝐴⟶𝐵 → (𝐹 “ 𝐴) ⊆ 𝐵)
9		ffun 6720	. . . 4 ⊢ (𝐹:𝐴⟶𝐵 → Fun 𝐹)
10	4, 3	sseqtrrid 4035	. . . 4 ⊢ (𝐹:𝐴⟶𝐵 → 𝐴 ⊆ dom 𝐹)
11		funimass3 7055	. . . 4 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → ((𝐹 “ 𝐴) ⊆ 𝐵 ↔ 𝐴 ⊆ (◡𝐹 “ 𝐵)))
12	9, 10, 11	syl2anc 584	. . 3 ⊢ (𝐹:𝐴⟶𝐵 → ((𝐹 “ 𝐴) ⊆ 𝐵 ↔ 𝐴 ⊆ (◡𝐹 “ 𝐵)))
13	8, 12	mpbid 231	. 2 ⊢ (𝐹:𝐴⟶𝐵 → 𝐴 ⊆ (◡𝐹 “ 𝐵))
14	7, 13	eqssd 3999	1 ⊢ (𝐹:𝐴⟶𝐵 → (◡𝐹 “ 𝐵) = 𝐴)

Syntax hints:   → wi 4   ↔ wb 205   = wceq 1541   ⊆ wss 3948  ^◡ccnv 5675  dom cdm 5676  ran crn 5677   “ cima 5679  Fun wfun 6537  ⟶wf 6539

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  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 2703  ax-sep 5299  ax-nul 5306  ax-pr 5427

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2534  df-eu 2563  df-clab 2710  df-cleq 2724  df-clel 2810  df-ne 2941  df-ral 3062  df-rex 3071  df-rab 3433  df-v 3476  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-nul 4323  df-if 4529  df-sn 4629  df-pr 4631  df-op 4635  df-uni 4909  df-br 5149  df-opab 5211  df-id 5574  df-xp 5682  df-rel 5683  df-cnv 5684  df-co 5685  df-dm 5686  df-rn 5687  df-res 5688  df-ima 5689  df-iota 6495  df-fun 6545  df-fn 6546  df-f 6547  df-fv 6551

This theorem is referenced by: (None)