Theorem fndmeng 9010

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 7196	. . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝐶) → 𝐹 ∈ V)
2		fnfun 6616	. . . 4 ⊢ (𝐹 Fn 𝐴 → Fun 𝐹)
3	2	adantr 484	. . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝐶) → Fun 𝐹)
4		fundmeng 9007	. . 3 ⊢ ((𝐹 ∈ V ∧ Fun 𝐹) → dom 𝐹 ≈ 𝐹)
5	1, 3, 4	syl2anc 593	. 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝐶) → dom 𝐹 ≈ 𝐹)
6		fndm 6619	. . . 4 ⊢ (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴)
7	6	breq1d 5107	. . 3 ⊢ (𝐹 Fn 𝐴 → (dom 𝐹 ≈ 𝐹 ↔ 𝐴 ≈ 𝐹))
8	7	adantr 484	. 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝐶) → (dom 𝐹 ≈ 𝐹 ↔ 𝐴 ≈ 𝐹))
9	5, 8	mpbid 234	1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝐶) → 𝐴 ≈ 𝐹)

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 399   ∈ wcel 2141  Vcvv 3453   class class class wbr 5097  dom cdm 5643  Fun wfun 6510   Fn wfn 6511   ≈ cen 8918

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-rep 5224  ax-sep 5243  ax-nul 5253  ax-pow 5319  ax-pr 5387  ax-un 7713

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3076  df-rex 3086  df-reu 3367  df-rab 3414  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4863  df-int 4903  df-iun 4948  df-br 5098  df-opab 5160  df-mpt 5179  df-id 5538  df-xp 5649  df-rel 5650  df-cnv 5651  df-co 5652  df-dm 5653  df-rn 5654  df-res 5655  df-ima 5656  df-iota 6472  df-fun 6518  df-fn 6519  df-f 6520  df-f1 6521  df-fo 6522  df-f1o 6523  df-fv 6524  df-en 8922

This theorem is referenced by:  tskcard  10733  hashfn  14382