Theorem funrnfi 6940

Description: The range of a finite relation is finite if its converse is a function. (Contributed by Jim Kingdon, 5-Feb-2022.)

Assertion

Ref	Expression
funrnfi	|- ( ( Rel A /\ Fun `' A /\ A e. Fin ) -> ran A e. Fin )

Proof of Theorem funrnfi

Step	Hyp	Ref	Expression
1		df-rn 4637	. 2 |- ran A = dom `' A
2		relcnvfi 6939	. . . 4 |- ( ( Rel A /\ A e. Fin ) -> `' A e. Fin )
3	2	3adant2 1016	. . 3 |- ( ( Rel A /\ Fun `' A /\ A e. Fin ) -> `' A e. Fin )
4		simp2 998	. . 3 |- ( ( Rel A /\ Fun `' A /\ A e. Fin ) -> Fun `' A )
5		fundmfi 6936	. . 3 |- ( ( `' A e. Fin /\ Fun `' A ) -> dom `' A e. Fin )
6	3, 4, 5	syl2anc 411	. 2 |- ( ( Rel A /\ Fun `' A /\ A e. Fin ) -> dom `' A e. Fin )
7	1, 6	eqeltrid 2264	1 |- ( ( Rel A /\ Fun `' A /\ A e. Fin ) -> ran A e. Fin )

Syntax hints:   -> wi 4   /\ w3a 978   e. wcel 2148   `'ccnv 4625   dom cdm 4626   ran crn 4627   Rel wrel 4631   Fun wfun 5210   Fincfn 6739

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-sep 4121  ax-pow 4174  ax-pr 4209  ax-un 4433

This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-v 2739  df-sbc 2963  df-un 3133  df-in 3135  df-ss 3142  df-pw 3577  df-sn 3598  df-pr 3599  df-op 3601  df-uni 3810  df-int 3845  df-br 4004  df-opab 4065  df-mpt 4066  df-id 4293  df-xp 4632  df-rel 4633  df-cnv 4634  df-co 4635  df-dm 4636  df-rn 4637  df-res 4638  df-ima 4639  df-iota 5178  df-fun 5218  df-fn 5219  df-f 5220  df-f1 5221  df-fo 5222  df-f1o 5223  df-fv 5224  df-1st 6140  df-2nd 6141  df-er 6534  df-en 6740  df-fin 6742

This theorem is referenced by:  f1dmvrnfibi  6942