Theorem fndmeng 8968

Description: A function is equinumerate to its domain. (Contributed by Paul Chapman, 22-Jun-2011.)

Assertion

Ref	Expression
fndmeng	⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝐶) → 𝐴 ≈ 𝐹)

Proof of Theorem fndmeng

Step	Hyp	Ref	Expression
1		fnex 7160	. . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝐶) → 𝐹 ∈ V)
2		fnfun 6589	. . . 4 ⊢ (𝐹 Fn 𝐴 → Fun 𝐹)
3	2	adantr 480	. . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝐶) → Fun 𝐹)
4		fundmeng 8965	. . 3 ⊢ ((𝐹 ∈ V ∧ Fun 𝐹) → dom 𝐹 ≈ 𝐹)
5	1, 3, 4	syl2anc 584	. 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝐶) → dom 𝐹 ≈ 𝐹)
6		fndm 6592	. . . 4 ⊢ (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴)
7	6	breq1d 5105	. . 3 ⊢ (𝐹 Fn 𝐴 → (dom 𝐹 ≈ 𝐹 ↔ 𝐴 ≈ 𝐹))
8	7	adantr 480	. 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝐶) → (dom 𝐹 ≈ 𝐹 ↔ 𝐴 ≈ 𝐹))
9	5, 8	mpbid 232	1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝐶) → 𝐴 ≈ 𝐹)

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∈ wcel 2113  Vcvv 3437   class class class wbr 5095  dom cdm 5621  Fun wfun 6483   Fn wfn 6484   ≈ cen 8876

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2705  ax-rep 5221  ax-sep 5238  ax-nul 5248  ax-pow 5307  ax-pr 5374  ax-un 7677

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2725  df-clel 2808  df-nfc 2882  df-ne 2930  df-ral 3049  df-rex 3058  df-reu 3348  df-rab 3397  df-v 3439  df-sbc 3738  df-csb 3847  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4283  df-if 4477  df-pw 4553  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4861  df-int 4900  df-iun 4945  df-br 5096  df-opab 5158  df-mpt 5177  df-id 5516  df-xp 5627  df-rel 5628  df-cnv 5629  df-co 5630  df-dm 5631  df-rn 5632  df-res 5633  df-ima 5634  df-iota 6445  df-fun 6491  df-fn 6492  df-f 6493  df-f1 6494  df-fo 6495  df-f1o 6496  df-fv 6497  df-en 8880

This theorem is referenced by:  tskcard  10683  hashfn  14289