Theorem sbthlem9 9109

Description: Lemma for sbth 9111. (Contributed by NM, 28-Mar-1998.)

Hypotheses

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

Assertion

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

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

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

Proof of Theorem sbthlem9

Step	Hyp	Ref	Expression
1		sbthlem.1	. . . . . . . 8 ⊢ 𝐴 ∈ V
2		sbthlem.2	. . . . . . . 8 ⊢ 𝐷 = {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ (𝑔 “ (𝐵 ∖ (𝑓 “ 𝑥))) ⊆ (𝐴 ∖ 𝑥))}
3		sbthlem.3	. . . . . . . 8 ⊢ 𝐻 = ((𝑓 ↾ ∪ 𝐷) ∪ (◡𝑔 ↾ (𝐴 ∖ ∪ 𝐷)))
4	1, 2, 3	sbthlem7 9107	. . . . . . 7 ⊢ ((Fun 𝑓 ∧ Fun ◡𝑔) → Fun 𝐻)
5	1, 2, 3	sbthlem5 9105	. . . . . . . 8 ⊢ ((dom 𝑓 = 𝐴 ∧ ran 𝑔 ⊆ 𝐴) → dom 𝐻 = 𝐴)
6	5	adantrl 715	. . . . . . 7 ⊢ ((dom 𝑓 = 𝐴 ∧ ((Fun 𝑔 ∧ dom 𝑔 = 𝐵) ∧ ran 𝑔 ⊆ 𝐴)) → dom 𝐻 = 𝐴)
7	4, 6	anim12i 612	. . . . . 6 ⊢ (((Fun 𝑓 ∧ Fun ◡𝑔) ∧ (dom 𝑓 = 𝐴 ∧ ((Fun 𝑔 ∧ dom 𝑔 = 𝐵) ∧ ran 𝑔 ⊆ 𝐴))) → (Fun 𝐻 ∧ dom 𝐻 = 𝐴))
8	7	an42s 660	. . . . 5 ⊢ (((Fun 𝑓 ∧ dom 𝑓 = 𝐴) ∧ (((Fun 𝑔 ∧ dom 𝑔 = 𝐵) ∧ ran 𝑔 ⊆ 𝐴) ∧ Fun ◡𝑔)) → (Fun 𝐻 ∧ dom 𝐻 = 𝐴))
9	8	adantlr 714	. . . 4 ⊢ ((((Fun 𝑓 ∧ dom 𝑓 = 𝐴) ∧ ran 𝑓 ⊆ 𝐵) ∧ (((Fun 𝑔 ∧ dom 𝑔 = 𝐵) ∧ ran 𝑔 ⊆ 𝐴) ∧ Fun ◡𝑔)) → (Fun 𝐻 ∧ dom 𝐻 = 𝐴))
10	9	adantlr 714	. . 3 ⊢ (((((Fun 𝑓 ∧ dom 𝑓 = 𝐴) ∧ ran 𝑓 ⊆ 𝐵) ∧ Fun ◡𝑓) ∧ (((Fun 𝑔 ∧ dom 𝑔 = 𝐵) ∧ ran 𝑔 ⊆ 𝐴) ∧ Fun ◡𝑔)) → (Fun 𝐻 ∧ dom 𝐻 = 𝐴))
11	1, 2, 3	sbthlem8 9108	. . . 4 ⊢ ((Fun ◡𝑓 ∧ (((Fun 𝑔 ∧ dom 𝑔 = 𝐵) ∧ ran 𝑔 ⊆ 𝐴) ∧ Fun ◡𝑔)) → Fun ◡𝐻)
12	11	adantll 713	. . 3 ⊢ (((((Fun 𝑓 ∧ dom 𝑓 = 𝐴) ∧ ran 𝑓 ⊆ 𝐵) ∧ Fun ◡𝑓) ∧ (((Fun 𝑔 ∧ dom 𝑔 = 𝐵) ∧ ran 𝑔 ⊆ 𝐴) ∧ Fun ◡𝑔)) → Fun ◡𝐻)
13		simpr 484	. . . . . . 7 ⊢ ((Fun 𝑔 ∧ dom 𝑔 = 𝐵) → dom 𝑔 = 𝐵)
14	13	anim1i 614	. . . . . 6 ⊢ (((Fun 𝑔 ∧ dom 𝑔 = 𝐵) ∧ ran 𝑔 ⊆ 𝐴) → (dom 𝑔 = 𝐵 ∧ ran 𝑔 ⊆ 𝐴))
15		df-rn 5683	. . . . . . 7 ⊢ ran 𝐻 = dom ◡𝐻
16	1, 2, 3	sbthlem6 9106	. . . . . . 7 ⊢ ((ran 𝑓 ⊆ 𝐵 ∧ ((dom 𝑔 = 𝐵 ∧ ran 𝑔 ⊆ 𝐴) ∧ Fun ◡𝑔)) → ran 𝐻 = 𝐵)
17	15, 16	eqtr3id 2781	. . . . . 6 ⊢ ((ran 𝑓 ⊆ 𝐵 ∧ ((dom 𝑔 = 𝐵 ∧ ran 𝑔 ⊆ 𝐴) ∧ Fun ◡𝑔)) → dom ◡𝐻 = 𝐵)
18	14, 17	sylanr1 681	. . . . 5 ⊢ ((ran 𝑓 ⊆ 𝐵 ∧ (((Fun 𝑔 ∧ dom 𝑔 = 𝐵) ∧ ran 𝑔 ⊆ 𝐴) ∧ Fun ◡𝑔)) → dom ◡𝐻 = 𝐵)
19	18	adantll 713	. . . 4 ⊢ ((((Fun 𝑓 ∧ dom 𝑓 = 𝐴) ∧ ran 𝑓 ⊆ 𝐵) ∧ (((Fun 𝑔 ∧ dom 𝑔 = 𝐵) ∧ ran 𝑔 ⊆ 𝐴) ∧ Fun ◡𝑔)) → dom ◡𝐻 = 𝐵)
20	19	adantlr 714	. . 3 ⊢ (((((Fun 𝑓 ∧ dom 𝑓 = 𝐴) ∧ ran 𝑓 ⊆ 𝐵) ∧ Fun ◡𝑓) ∧ (((Fun 𝑔 ∧ dom 𝑔 = 𝐵) ∧ ran 𝑔 ⊆ 𝐴) ∧ Fun ◡𝑔)) → dom ◡𝐻 = 𝐵)
21	10, 12, 20	jca32 515	. 2 ⊢ (((((Fun 𝑓 ∧ dom 𝑓 = 𝐴) ∧ ran 𝑓 ⊆ 𝐵) ∧ Fun ◡𝑓) ∧ (((Fun 𝑔 ∧ dom 𝑔 = 𝐵) ∧ ran 𝑔 ⊆ 𝐴) ∧ Fun ◡𝑔)) → ((Fun 𝐻 ∧ dom 𝐻 = 𝐴) ∧ (Fun ◡𝐻 ∧ dom ◡𝐻 = 𝐵)))
22		df-f1 6547	. . . 4 ⊢ (𝑓:𝐴–1-1→𝐵 ↔ (𝑓:𝐴⟶𝐵 ∧ Fun ◡𝑓))
23		df-f 6546	. . . . . 6 ⊢ (𝑓:𝐴⟶𝐵 ↔ (𝑓 Fn 𝐴 ∧ ran 𝑓 ⊆ 𝐵))
24		df-fn 6545	. . . . . . 7 ⊢ (𝑓 Fn 𝐴 ↔ (Fun 𝑓 ∧ dom 𝑓 = 𝐴))
25	24	anbi1i 623	. . . . . 6 ⊢ ((𝑓 Fn 𝐴 ∧ ran 𝑓 ⊆ 𝐵) ↔ ((Fun 𝑓 ∧ dom 𝑓 = 𝐴) ∧ ran 𝑓 ⊆ 𝐵))
26	23, 25	bitri 275	. . . . 5 ⊢ (𝑓:𝐴⟶𝐵 ↔ ((Fun 𝑓 ∧ dom 𝑓 = 𝐴) ∧ ran 𝑓 ⊆ 𝐵))
27	26	anbi1i 623	. . . 4 ⊢ ((𝑓:𝐴⟶𝐵 ∧ Fun ◡𝑓) ↔ (((Fun 𝑓 ∧ dom 𝑓 = 𝐴) ∧ ran 𝑓 ⊆ 𝐵) ∧ Fun ◡𝑓))
28	22, 27	bitri 275	. . 3 ⊢ (𝑓:𝐴–1-1→𝐵 ↔ (((Fun 𝑓 ∧ dom 𝑓 = 𝐴) ∧ ran 𝑓 ⊆ 𝐵) ∧ Fun ◡𝑓))
29		df-f1 6547	. . . 4 ⊢ (𝑔:𝐵–1-1→𝐴 ↔ (𝑔:𝐵⟶𝐴 ∧ Fun ◡𝑔))
30		df-f 6546	. . . . . 6 ⊢ (𝑔:𝐵⟶𝐴 ↔ (𝑔 Fn 𝐵 ∧ ran 𝑔 ⊆ 𝐴))
31		df-fn 6545	. . . . . . 7 ⊢ (𝑔 Fn 𝐵 ↔ (Fun 𝑔 ∧ dom 𝑔 = 𝐵))
32	31	anbi1i 623	. . . . . 6 ⊢ ((𝑔 Fn 𝐵 ∧ ran 𝑔 ⊆ 𝐴) ↔ ((Fun 𝑔 ∧ dom 𝑔 = 𝐵) ∧ ran 𝑔 ⊆ 𝐴))
33	30, 32	bitri 275	. . . . 5 ⊢ (𝑔:𝐵⟶𝐴 ↔ ((Fun 𝑔 ∧ dom 𝑔 = 𝐵) ∧ ran 𝑔 ⊆ 𝐴))
34	33	anbi1i 623	. . . 4 ⊢ ((𝑔:𝐵⟶𝐴 ∧ Fun ◡𝑔) ↔ (((Fun 𝑔 ∧ dom 𝑔 = 𝐵) ∧ ran 𝑔 ⊆ 𝐴) ∧ Fun ◡𝑔))
35	29, 34	bitri 275	. . 3 ⊢ (𝑔:𝐵–1-1→𝐴 ↔ (((Fun 𝑔 ∧ dom 𝑔 = 𝐵) ∧ ran 𝑔 ⊆ 𝐴) ∧ Fun ◡𝑔))
36	28, 35	anbi12i 626	. 2 ⊢ ((𝑓:𝐴–1-1→𝐵 ∧ 𝑔:𝐵–1-1→𝐴) ↔ ((((Fun 𝑓 ∧ dom 𝑓 = 𝐴) ∧ ran 𝑓 ⊆ 𝐵) ∧ Fun ◡𝑓) ∧ (((Fun 𝑔 ∧ dom 𝑔 = 𝐵) ∧ ran 𝑔 ⊆ 𝐴) ∧ Fun ◡𝑔)))
37		dff1o4 6841	. . 3 ⊢ (𝐻:𝐴–1-1-onto→𝐵 ↔ (𝐻 Fn 𝐴 ∧ ◡𝐻 Fn 𝐵))
38		df-fn 6545	. . . 4 ⊢ (𝐻 Fn 𝐴 ↔ (Fun 𝐻 ∧ dom 𝐻 = 𝐴))
39		df-fn 6545	. . . 4 ⊢ (◡𝐻 Fn 𝐵 ↔ (Fun ◡𝐻 ∧ dom ◡𝐻 = 𝐵))
40	38, 39	anbi12i 626	. . 3 ⊢ ((𝐻 Fn 𝐴 ∧ ◡𝐻 Fn 𝐵) ↔ ((Fun 𝐻 ∧ dom 𝐻 = 𝐴) ∧ (Fun ◡𝐻 ∧ dom ◡𝐻 = 𝐵)))
41	37, 40	bitri 275	. 2 ⊢ (𝐻:𝐴–1-1-onto→𝐵 ↔ ((Fun 𝐻 ∧ dom 𝐻 = 𝐴) ∧ (Fun ◡𝐻 ∧ dom ◡𝐻 = 𝐵)))
42	21, 36, 41	3imtr4i 292	1 ⊢ ((𝑓:𝐴–1-1→𝐵 ∧ 𝑔:𝐵–1-1→𝐴) → 𝐻:𝐴–1-1-onto→𝐵)

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1534   ∈ wcel 2099  {cab 2704  Vcvv 3469   ∖ cdif 3941   ∪ cun 3942   ⊆ wss 3944  ∪ cuni 4903  ^◡ccnv 5671  dom cdm 5672  ran crn 5673   ↾ cres 5674   “ cima 5675  Fun wfun 6536   Fn wfn 6537  ⟶wf 6538  –1-1→wf1 6539  –1-1-onto→wf1o 6541

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2101  ax-9 2109  ax-10 2130  ax-12 2164  ax-ext 2698  ax-sep 5293  ax-nul 5300  ax-pr 5423

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 847  df-3an 1087  df-tru 1537  df-fal 1547  df-ex 1775  df-nf 1779  df-sb 2061  df-mo 2529  df-eu 2558  df-clab 2705  df-cleq 2719  df-clel 2805  df-ral 3057  df-rex 3066  df-rab 3428  df-v 3471  df-dif 3947  df-un 3949  df-in 3951  df-ss 3961  df-nul 4319  df-if 4525  df-sn 4625  df-pr 4627  df-op 4631  df-uni 4904  df-br 5143  df-opab 5205  df-id 5570  df-xp 5678  df-rel 5679  df-cnv 5680  df-co 5681  df-dm 5682  df-rn 5683  df-res 5684  df-ima 5685  df-fun 6544  df-fn 6545  df-f 6546  df-f1 6547  df-fo 6548  df-f1o 6549

This theorem is referenced by:  sbthlem10  9110  sbthfilem  9219