Theorem elfir 7273

Description: Sufficient condition for an element of ( fi ` B ). (Contributed by Mario Carneiro, 24-Nov-2013.)

Assertion

Ref	Expression
elfir	|- ( ( B e. V /\ ( A C_ B /\ A =/= (/) /\ A e. Fin ) ) -> |^| A e. ( fi ` B ) )

Proof of Theorem elfir

Dummy variables x z are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		simp1 1024	. . . . . 6 |- ( ( A C_ B /\ A =/= (/) /\ A e. Fin ) -> A C_ B )
2		elpw2g 4273	. . . . . 6 |- ( B e. V -> ( A e. ~P B <-> A C_ B ) )
3	1, 2	imbitrrid 156	. . . . 5 |- ( B e. V -> ( ( A C_ B /\ A =/= (/) /\ A e. Fin ) -> A e. ~P B ) )
4	3	imp 124	. . . 4 |- ( ( B e. V /\ ( A C_ B /\ A =/= (/) /\ A e. Fin ) ) -> A e. ~P B )
5		simpr3 1032	. . . 4 |- ( ( B e. V /\ ( A C_ B /\ A =/= (/) /\ A e. Fin ) ) -> A e. Fin )
6	4, 5	elind 3408	. . 3 |- ( ( B e. V /\ ( A C_ B /\ A =/= (/) /\ A e. Fin ) ) -> A e. ( ~P B i^i Fin ) )
7		eqid 2234	. . 3 |- |^| A = |^| A
8		inteq 3957	. . . 4 |- ( x = A -> |^| x = |^| A )
9	8	rspceeqv 2942	. . 3 |- ( ( A e. ( ~P B i^i Fin ) /\ |^| A = |^| A ) -> E. x e. ( ~P B i^i Fin ) |^| A = |^| x )
10	6, 7, 9	sylancl 413	. 2 |- ( ( B e. V /\ ( A C_ B /\ A =/= (/) /\ A e. Fin ) ) -> E. x e. ( ~P B i^i Fin ) |^| A = |^| x )
11		simp2 1025	. . . . 5 |- ( ( A C_ B /\ A =/= (/) /\ A e. Fin ) -> A =/= (/) )
12		fin0 7155	. . . . . 6 |- ( A e. Fin -> ( A =/= (/) <-> E. z z e. A ) )
13	12	3ad2ant3 1047	. . . . 5 |- ( ( A C_ B /\ A =/= (/) /\ A e. Fin ) -> ( A =/= (/) <-> E. z z e. A ) )
14	11, 13	mpbid 147	. . . 4 |- ( ( A C_ B /\ A =/= (/) /\ A e. Fin ) -> E. z z e. A )
15		inteximm 4266	. . . 4 |- ( E. z z e. A -> |^| A e. _V )
16	14, 15	syl 14	. . 3 |- ( ( A C_ B /\ A =/= (/) /\ A e. Fin ) -> |^| A e. _V )
17		id 19	. . 3 |- ( B e. V -> B e. V )
18		elfi 7271	. . 3 |- ( ( |^| A e. _V /\ B e. V ) -> ( |^| A e. ( fi ` B ) <-> E. x e. ( ~P B i^i Fin ) |^| A = |^| x ) )
19	16, 17, 18	syl2anr 290	. 2 |- ( ( B e. V /\ ( A C_ B /\ A =/= (/) /\ A e. Fin ) ) -> ( |^| A e. ( fi ` B ) <-> E. x e. ( ~P B i^i Fin ) |^| A = |^| x ) )
20	10, 19	mpbird 167	1 |- ( ( B e. V /\ ( A C_ B /\ A =/= (/) /\ A e. Fin ) ) -> |^| A e. ( fi ` B ) )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   /\ w3a 1005   = wceq 1398   E.wex 1541   e. wcel 2205   =/= wne 2414   E.wrex 2523   _Vcvv 2815   i^i cin 3213   C_ wss 3214   (/)c0 3512   ~Pcpw 3674   |^|cint 3954   ` cfv 5357   Fincfn 6988   ficfi 7268

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-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-nul 4241  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-iinf 4715

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-ral 2527  df-rex 2528  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-br 4115  df-opab 4177  df-mpt 4178  df-id 4419  df-suc 4497  df-iom 4718  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-er 6780  df-en 6989  df-fin 6991  df-fi 7269

This theorem is referenced by:  ssfii  7274