Theorem sbthlemi9 7282

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

Hypotheses

Ref	Expression
sbthlem.1	⊢ 𝐴 ∈ V
sbthlem.2	⊢ 𝐷 = {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ (𝑔 “ (𝐵 ∖ (𝑓 “ 𝑥))) ⊆ (𝐴 ∖ 𝑥))}
sbthlem.3	⊢ 𝐻 = ((𝑓 ↾ ∪ 𝐷) ∪ (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷)))

Assertion

Ref	Expression
sbthlemi9	⊢ ((EXMID ∧ 𝑓:𝐴–1-1→𝐵 ∧ 𝑔:𝐵–1-1→𝐴) → 𝐻:𝐴–1-1-onto→𝐵)

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝐷   𝑥,𝑓   𝑥,𝑔   𝑥,𝐻

Allowed substitution hints:   𝐴(𝑓, 𝑔)   𝐵(𝑓, 𝑔)   𝐷(𝑓, 𝑔)   𝐻(𝑓, 𝑔)

Proof of Theorem sbthlemi9

Step	Hyp	Ref	Expression
1		simp2 1029	. . . . . . . . . 10 ⊢ ((EXMID ∧ 𝑓:𝐴–1-1→𝐵 ∧ 𝑔:𝐵–1-1→𝐴) → 𝑓:𝐴–1-1→𝐵)
2		df-f1 5382	. . . . . . . . . 10 ⊢ (𝑓:𝐴–1-1→𝐵 ↔ (𝑓:𝐴⟶𝐵 ∧ Fun ◡𝑓))
3	1, 2	sylib 122	. . . . . . . . 9 ⊢ ((EXMID ∧ 𝑓:𝐴–1-1→𝐵 ∧ 𝑔:𝐵–1-1→𝐴) → (𝑓:𝐴⟶𝐵 ∧ Fun ◡𝑓))
4	3	simpld 112	. . . . . . . 8 ⊢ ((EXMID ∧ 𝑓:𝐴–1-1→𝐵 ∧ 𝑔:𝐵–1-1→𝐴) → 𝑓:𝐴⟶𝐵)
5		df-f 5381	. . . . . . . 8 ⊢ (𝑓:𝐴⟶𝐵 ↔ (𝑓 Fn 𝐴 ∧ ran 𝑓 ⊆ 𝐵))
6	4, 5	sylib 122	. . . . . . 7 ⊢ ((EXMID ∧ 𝑓:𝐴–1-1→𝐵 ∧ 𝑔:𝐵–1-1→𝐴) → (𝑓 Fn 𝐴 ∧ ran 𝑓 ⊆ 𝐵))
7	6	simpld 112	. . . . . 6 ⊢ ((EXMID ∧ 𝑓:𝐴–1-1→𝐵 ∧ 𝑔:𝐵–1-1→𝐴) → 𝑓 Fn 𝐴)
8		df-fn 5380	. . . . . 6 ⊢ (𝑓 Fn 𝐴 ↔ (Fun 𝑓 ∧ dom 𝑓 = 𝐴))
9	7, 8	sylib 122	. . . . 5 ⊢ ((EXMID ∧ 𝑓:𝐴–1-1→𝐵 ∧ 𝑔:𝐵–1-1→𝐴) → (Fun 𝑓 ∧ dom 𝑓 = 𝐴))
10	9	simpld 112	. . . 4 ⊢ ((EXMID ∧ 𝑓:𝐴–1-1→𝐵 ∧ 𝑔:𝐵–1-1→𝐴) → Fun 𝑓)
11		simp3 1030	. . . . . 6 ⊢ ((EXMID ∧ 𝑓:𝐴–1-1→𝐵 ∧ 𝑔:𝐵–1-1→𝐴) → 𝑔:𝐵–1-1→𝐴)
12		df-f1 5382	. . . . . 6 ⊢ (𝑔:𝐵–1-1→𝐴 ↔ (𝑔:𝐵⟶𝐴 ∧ Fun ◡𝑔))
13	11, 12	sylib 122	. . . . 5 ⊢ ((EXMID ∧ 𝑓:𝐴–1-1→𝐵 ∧ 𝑔:𝐵–1-1→𝐴) → (𝑔:𝐵⟶𝐴 ∧ Fun ◡𝑔))
14	13	simprd 114	. . . 4 ⊢ ((EXMID ∧ 𝑓:𝐴–1-1→𝐵 ∧ 𝑔:𝐵–1-1→𝐴) → Fun ◡𝑔)
15		sbthlem.1	. . . . 5 ⊢ 𝐴 ∈ V
16		sbthlem.2	. . . . 5 ⊢ 𝐷 = {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ (𝑔 “ (𝐵 ∖ (𝑓 “ 𝑥))) ⊆ (𝐴 ∖ 𝑥))}
17		sbthlem.3	. . . . 5 ⊢ 𝐻 = ((𝑓 ↾ ∪ 𝐷) ∪ (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷)))
18	15, 16, 17	sbthlem7 7280	. . . 4 ⊢ ((Fun 𝑓 ∧ Fun ◡𝑔) → Fun 𝐻)
19	10, 14, 18	syl2anc 415	. . 3 ⊢ ((EXMID ∧ 𝑓:𝐴–1-1→𝐵 ∧ 𝑔:𝐵–1-1→𝐴) → Fun 𝐻)
20		simp1 1028	. . . 4 ⊢ ((EXMID ∧ 𝑓:𝐴–1-1→𝐵 ∧ 𝑔:𝐵–1-1→𝐴) → EXMID)
21	9	simprd 114	. . . 4 ⊢ ((EXMID ∧ 𝑓:𝐴–1-1→𝐵 ∧ 𝑔:𝐵–1-1→𝐴) → dom 𝑓 = 𝐴)
22	13	simpld 112	. . . . . 6 ⊢ ((EXMID ∧ 𝑓:𝐴–1-1→𝐵 ∧ 𝑔:𝐵–1-1→𝐴) → 𝑔:𝐵⟶𝐴)
23		df-f 5381	. . . . . 6 ⊢ (𝑔:𝐵⟶𝐴 ↔ (𝑔 Fn 𝐵 ∧ ran 𝑔 ⊆ 𝐴))
24	22, 23	sylib 122	. . . . 5 ⊢ ((EXMID ∧ 𝑓:𝐴–1-1→𝐵 ∧ 𝑔:𝐵–1-1→𝐴) → (𝑔 Fn 𝐵 ∧ ran 𝑔 ⊆ 𝐴))
25	24	simprd 114	. . . 4 ⊢ ((EXMID ∧ 𝑓:𝐴–1-1→𝐵 ∧ 𝑔:𝐵–1-1→𝐴) → ran 𝑔 ⊆ 𝐴)
26	15, 16, 17	sbthlemi5 7278	. . . 4 ⊢ ((EXMID ∧ (dom 𝑓 = 𝐴 ∧ ran 𝑔 ⊆ 𝐴)) → dom 𝐻 = 𝐴)
27	20, 21, 25, 26	syl12anc 1276	. . 3 ⊢ ((EXMID ∧ 𝑓:𝐴–1-1→𝐵 ∧ 𝑔:𝐵–1-1→𝐴) → dom 𝐻 = 𝐴)
28		df-fn 5380	. . 3 ⊢ (𝐻 Fn 𝐴 ↔ (Fun 𝐻 ∧ dom 𝐻 = 𝐴))
29	19, 27, 28	sylanbrc 421	. 2 ⊢ ((EXMID ∧ 𝑓:𝐴–1-1→𝐵 ∧ 𝑔:𝐵–1-1→𝐴) → 𝐻 Fn 𝐴)
30	3	simprd 114	. . . 4 ⊢ ((EXMID ∧ 𝑓:𝐴–1-1→𝐵 ∧ 𝑔:𝐵–1-1→𝐴) → Fun ◡𝑓)
31	24	simpld 112	. . . . . 6 ⊢ ((EXMID ∧ 𝑓:𝐴–1-1→𝐵 ∧ 𝑔:𝐵–1-1→𝐴) → 𝑔 Fn 𝐵)
32		df-fn 5380	. . . . . 6 ⊢ (𝑔 Fn 𝐵 ↔ (Fun 𝑔 ∧ dom 𝑔 = 𝐵))
33	31, 32	sylib 122	. . . . 5 ⊢ ((EXMID ∧ 𝑓:𝐴–1-1→𝐵 ∧ 𝑔:𝐵–1-1→𝐴) → (Fun 𝑔 ∧ dom 𝑔 = 𝐵))
34	33, 25	jca 306	. . . 4 ⊢ ((EXMID ∧ 𝑓:𝐴–1-1→𝐵 ∧ 𝑔:𝐵–1-1→𝐴) → ((Fun 𝑔 ∧ dom 𝑔 = 𝐵) ∧ ran 𝑔 ⊆ 𝐴))
35	15, 16, 17	sbthlemi8 7281	. . . 4 ⊢ (((EXMID ∧ Fun ◡𝑓) ∧ (((Fun 𝑔 ∧ dom 𝑔 = 𝐵) ∧ ran 𝑔 ⊆ 𝐴) ∧ Fun ◡𝑔)) → Fun ◡𝐻)
36	20, 30, 34, 14, 35	syl22anc 1279	. . 3 ⊢ ((EXMID ∧ 𝑓:𝐴–1-1→𝐵 ∧ 𝑔:𝐵–1-1→𝐴) → Fun ◡𝐻)
37	6	simprd 114	. . . 4 ⊢ ((EXMID ∧ 𝑓:𝐴–1-1→𝐵 ∧ 𝑔:𝐵–1-1→𝐴) → ran 𝑓 ⊆ 𝐵)
38	33	simprd 114	. . . . 5 ⊢ ((EXMID ∧ 𝑓:𝐴–1-1→𝐵 ∧ 𝑔:𝐵–1-1→𝐴) → dom 𝑔 = 𝐵)
39	38, 25	jca 306	. . . 4 ⊢ ((EXMID ∧ 𝑓:𝐴–1-1→𝐵 ∧ 𝑔:𝐵–1-1→𝐴) → (dom 𝑔 = 𝐵 ∧ ran 𝑔 ⊆ 𝐴))
40		df-rn 4785	. . . . 5 ⊢ ran 𝐻 = dom ◡𝐻
41	15, 16, 17	sbthlemi6 7279	. . . . 5 ⊢ (((EXMID ∧ ran 𝑓 ⊆ 𝐵) ∧ ((dom 𝑔 = 𝐵 ∧ ran 𝑔 ⊆ 𝐴) ∧ Fun ◡𝑔)) → ran 𝐻 = 𝐵)
42	40, 41	eqtr3id 2285	. . . 4 ⊢ (((EXMID ∧ ran 𝑓 ⊆ 𝐵) ∧ ((dom 𝑔 = 𝐵 ∧ ran 𝑔 ⊆ 𝐴) ∧ Fun ◡𝑔)) → dom ◡𝐻 = 𝐵)
43	20, 37, 39, 14, 42	syl22anc 1279	. . 3 ⊢ ((EXMID ∧ 𝑓:𝐴–1-1→𝐵 ∧ 𝑔:𝐵–1-1→𝐴) → dom ◡𝐻 = 𝐵)
44		df-fn 5380	. . 3 ⊢ (◡𝐻 Fn 𝐵 ↔ (Fun ◡𝐻 ∧ dom ◡𝐻 = 𝐵))
45	36, 43, 44	sylanbrc 421	. 2 ⊢ ((EXMID ∧ 𝑓:𝐴–1-1→𝐵 ∧ 𝑔:𝐵–1-1→𝐴) → ◡𝐻 Fn 𝐵)
46		dff1o4 5647	. 2 ⊢ (𝐻:𝐴–1-1-onto→𝐵 ↔ (𝐻 Fn 𝐴 ∧ ◡𝐻 Fn 𝐵))
47	29, 45, 46	sylanbrc 421	1 ⊢ ((EXMID ∧ 𝑓:𝐴–1-1→𝐵 ∧ 𝑔:𝐵–1-1→𝐴) → 𝐻:𝐴–1-1-onto→𝐵)

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ∧ w3a 1009   = wceq 1402   ∈ wcel 2209  {cab 2224  Vcvv 2821   ∖ cdif 3217   ∪ cun 3218   ⊆ wss 3220  ∪ cuni 3935  EXMIDwem 4331  ^◡ccnv 4773  dom cdm 4774  ran crn 4775   ↾ cres 4776   “ cima 4777  Fun wfun 5371   Fn wfn 5372  ⟶wf 5373  –1-1→wf1 5374  –1-1-onto→wf1o 5376

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346

This proof depends on definitions:  df-bi 117  df-stab 843  df-dc 847  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-exmid 4332  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384

This theorem is used by:  sbthlemi10  7283