Theorem sbthlemi9 6958

Description: Lemma for isbth 6960. (Contributed by NM, 28-Mar-1998.)

Hypotheses

Ref	Expression
sbthlem.1	|- A e. _V
sbthlem.2	|- D = { x | ( x C_ A /\ ( g " ( B \ ( f " x ) ) ) C_ ( A \ x ) ) }
sbthlem.3	|- H = ( ( f |` U. D ) u. ( `' g |` ( A \ U. D ) ) )

Assertion

Ref	Expression
sbthlemi9	|- ( (EXMID /\ f : A -1-1-> B /\ g : B -1-1-> A ) -> H : A -1-1-onto-> B )

Distinct variable groups:   x, A   x, B   x, D   x, f   x, g   x, H

Allowed substitution hints:   A( f, g)   B( f, g)   D( f, g)   H( f, g)

Proof of Theorem sbthlemi9

Step	Hyp	Ref	Expression
1		simp2 998	. . . . . . . . . 10 |- ( (EXMID /\ f : A -1-1-> B /\ g : B -1-1-> A ) -> f : A -1-1-> B )
2		df-f1 5217	. . . . . . . . . 10 |- ( f : A -1-1-> B <-> ( f : A --> B /\ Fun `' f ) )
3	1, 2	sylib 122	. . . . . . . . 9 |- ( (EXMID /\ f : A -1-1-> B /\ g : B -1-1-> A ) -> ( f : A --> B /\ Fun `' f ) )
4	3	simpld 112	. . . . . . . 8 |- ( (EXMID /\ f : A -1-1-> B /\ g : B -1-1-> A ) -> f : A --> B )
5		df-f 5216	. . . . . . . 8 |- ( f : A --> B <-> ( f Fn A /\ ran f C_ B ) )
6	4, 5	sylib 122	. . . . . . 7 |- ( (EXMID /\ f : A -1-1-> B /\ g : B -1-1-> A ) -> ( f Fn A /\ ran f C_ B ) )
7	6	simpld 112	. . . . . 6 |- ( (EXMID /\ f : A -1-1-> B /\ g : B -1-1-> A ) -> f Fn A )
8		df-fn 5215	. . . . . 6 |- ( f Fn A <-> ( Fun f /\ dom f = A ) )
9	7, 8	sylib 122	. . . . 5 |- ( (EXMID /\ f : A -1-1-> B /\ g : B -1-1-> A ) -> ( Fun f /\ dom f = A ) )
10	9	simpld 112	. . . 4 |- ( (EXMID /\ f : A -1-1-> B /\ g : B -1-1-> A ) -> Fun f )
11		simp3 999	. . . . . 6 |- ( (EXMID /\ f : A -1-1-> B /\ g : B -1-1-> A ) -> g : B -1-1-> A )
12		df-f1 5217	. . . . . 6 |- ( g : B -1-1-> A <-> ( g : B --> A /\ Fun `' g ) )
13	11, 12	sylib 122	. . . . 5 |- ( (EXMID /\ f : A -1-1-> B /\ g : B -1-1-> A ) -> ( g : B --> A /\ Fun `' g ) )
14	13	simprd 114	. . . 4 |- ( (EXMID /\ f : A -1-1-> B /\ g : B -1-1-> A ) -> Fun `' g )
15		sbthlem.1	. . . . 5 |- A e. _V
16		sbthlem.2	. . . . 5 |- D = { x | ( x C_ A /\ ( g " ( B \ ( f " x ) ) ) C_ ( A \ x ) ) }
17		sbthlem.3	. . . . 5 |- H = ( ( f |` U. D ) u. ( `' g |` ( A \ U. D ) ) )
18	15, 16, 17	sbthlem7 6956	. . . 4 |- ( ( Fun f /\ Fun `' g ) -> Fun H )
19	10, 14, 18	syl2anc 411	. . 3 |- ( (EXMID /\ f : A -1-1-> B /\ g : B -1-1-> A ) -> Fun H )
20		simp1 997	. . . 4 |- ( (EXMID /\ f : A -1-1-> B /\ g : B -1-1-> A ) -> EXMID )
21	9	simprd 114	. . . 4 |- ( (EXMID /\ f : A -1-1-> B /\ g : B -1-1-> A ) -> dom f = A )
22	13	simpld 112	. . . . . 6 |- ( (EXMID /\ f : A -1-1-> B /\ g : B -1-1-> A ) -> g : B --> A )
23		df-f 5216	. . . . . 6 |- ( g : B --> A <-> ( g Fn B /\ ran g C_ A ) )
24	22, 23	sylib 122	. . . . 5 |- ( (EXMID /\ f : A -1-1-> B /\ g : B -1-1-> A ) -> ( g Fn B /\ ran g C_ A ) )
25	24	simprd 114	. . . 4 |- ( (EXMID /\ f : A -1-1-> B /\ g : B -1-1-> A ) -> ran g C_ A )
26	15, 16, 17	sbthlemi5 6954	. . . 4 |- ( (EXMID /\ ( dom f = A /\ ran g C_ A ) ) -> dom H = A )
27	20, 21, 25, 26	syl12anc 1236	. . 3 |- ( (EXMID /\ f : A -1-1-> B /\ g : B -1-1-> A ) -> dom H = A )
28		df-fn 5215	. . 3 |- ( H Fn A <-> ( Fun H /\ dom H = A ) )
29	19, 27, 28	sylanbrc 417	. 2 |- ( (EXMID /\ f : A -1-1-> B /\ g : B -1-1-> A ) -> H Fn A )
30	3	simprd 114	. . . 4 |- ( (EXMID /\ f : A -1-1-> B /\ g : B -1-1-> A ) -> Fun `' f )
31	24	simpld 112	. . . . . 6 |- ( (EXMID /\ f : A -1-1-> B /\ g : B -1-1-> A ) -> g Fn B )
32		df-fn 5215	. . . . . 6 |- ( g Fn B <-> ( Fun g /\ dom g = B ) )
33	31, 32	sylib 122	. . . . 5 |- ( (EXMID /\ f : A -1-1-> B /\ g : B -1-1-> A ) -> ( Fun g /\ dom g = B ) )
34	33, 25	jca 306	. . . 4 |- ( (EXMID /\ f : A -1-1-> B /\ g : B -1-1-> A ) -> ( ( Fun g /\ dom g = B ) /\ ran g C_ A ) )
35	15, 16, 17	sbthlemi8 6957	. . . 4 |- ( ( (EXMID /\ Fun `' f ) /\ ( ( ( Fun g /\ dom g = B ) /\ ran g C_ A ) /\ Fun `' g ) ) -> Fun `' H )
36	20, 30, 34, 14, 35	syl22anc 1239	. . 3 |- ( (EXMID /\ f : A -1-1-> B /\ g : B -1-1-> A ) -> Fun `' H )
37	6	simprd 114	. . . 4 |- ( (EXMID /\ f : A -1-1-> B /\ g : B -1-1-> A ) -> ran f C_ B )
38	33	simprd 114	. . . . 5 |- ( (EXMID /\ f : A -1-1-> B /\ g : B -1-1-> A ) -> dom g = B )
39	38, 25	jca 306	. . . 4 |- ( (EXMID /\ f : A -1-1-> B /\ g : B -1-1-> A ) -> ( dom g = B /\ ran g C_ A ) )
40		df-rn 4634	. . . . 5 |- ran H = dom `' H
41	15, 16, 17	sbthlemi6 6955	. . . . 5 |- ( ( (EXMID /\ ran f C_ B ) /\ ( ( dom g = B /\ ran g C_ A ) /\ Fun `' g ) ) -> ran H = B )
42	40, 41	eqtr3id 2224	. . . 4 |- ( ( (EXMID /\ ran f C_ B ) /\ ( ( dom g = B /\ ran g C_ A ) /\ Fun `' g ) ) -> dom `' H = B )
43	20, 37, 39, 14, 42	syl22anc 1239	. . 3 |- ( (EXMID /\ f : A -1-1-> B /\ g : B -1-1-> A ) -> dom `' H = B )
44		df-fn 5215	. . 3 |- ( `' H Fn B <-> ( Fun `' H /\ dom `' H = B ) )
45	36, 43, 44	sylanbrc 417	. 2 |- ( (EXMID /\ f : A -1-1-> B /\ g : B -1-1-> A ) -> `' H Fn B )
46		dff1o4 5465	. 2 |- ( H : A -1-1-onto-> B <-> ( H Fn A /\ `' H Fn B ) )
47	29, 45, 46	sylanbrc 417	1 |- ( (EXMID /\ f : A -1-1-> B /\ g : B -1-1-> A ) -> H : A -1-1-onto-> B )

Syntax hints:   -> wi 4   /\ wa 104   /\ w3a 978   = wceq 1353   e. wcel 2148   {cab 2163   _Vcvv 2737   \ cdif 3126   u. cun 3127   C_ wss 3129   U.cuni 3807  EXMIDwem 4191   `'ccnv 4622   dom cdm 4623   ran crn 4624   |` cres 4625   "cima 4626   Fun wfun 5206   Fn wfn 5207   -->wf 5208   -1-1->wf1 5209   -1-1-onto->wf1o 5211

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 614  ax-in2 615  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-14 2151  ax-ext 2159  ax-sep 4118  ax-nul 4126  ax-pow 4171  ax-pr 4206

This theorem depends on definitions:  df-bi 117  df-stab 831  df-dc 835  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-rab 2464  df-v 2739  df-dif 3131  df-un 3133  df-in 3135  df-ss 3142  df-nul 3423  df-pw 3576  df-sn 3597  df-pr 3598  df-op 3600  df-uni 3808  df-br 4001  df-opab 4062  df-exmid 4192  df-id 4290  df-xp 4629  df-rel 4630  df-cnv 4631  df-co 4632  df-dm 4633  df-rn 4634  df-res 4635  df-ima 4636  df-fun 5214  df-fn 5215  df-f 5216  df-f1 5217  df-fo 5218  df-f1o 5219

This theorem is referenced by:  sbthlemi10  6959