HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
GIF version

Theorem sbthlem8 3356
Description: Lemma for Schroeder-Bernstein Theorem.
Hypotheses
Ref Expression
sbthlem.1 AV
sbthlem.2 D = {x∣(xA ∧ (g “ (B ∖ (fx))) ⊆ (Ax))}
sbthlem.3 H = ((fD) ∪ (g ↾ (AD)))
Assertion
Ref Expression
sbthlem8 ((Fun f ∧ (((Fun g ∧ dom g = B) ∧ ran gA) ∧ Fun g)) → Fun H)
Distinct variable group(s):   x,A   x,B   x,D   x,f   x,g   x,H

Proof of Theorem sbthlem8
StepHypRef Expression
1 funun 2700 . . 3 (((Fun (fD) ∧ Fun (g ↾ (AD))) ∧ (dom (fD) ∩ dom (g ↾ (AD))) = ∅) → Fun ((fD) ∪ (g ↾ (AD))))
2 funres11 2709 . . . 4 (Fun f → Fun (fD))
3 funcnvcnv 2701 . . . . . . 7 (Fun g → Fun g)
4 funres11 2709 . . . . . . 7 (Fun g → Fun (g ↾ (AD)))
53, 4syl 12 . . . . . 6 (Fun g → Fun (g ↾ (AD)))
65adantr 306 . . . . 5 ((Fun g ∧ dom g = B) → Fun (g ↾ (AD)))
76ad2antll 320 . . . 4 ((((Fun g ∧ dom g = B) ∧ ran gA) ∧ Fun g) → Fun (g ↾ (AD)))
82, 7anim12i 268 . . 3 ((Fun f ∧ (((Fun g ∧ dom g = B) ∧ ran gA) ∧ Fun g)) → (Fun (fD) ∧ Fun (g ↾ (AD))))
9 sbthlem.1 . . . . . . . . . 10 AV
10 sbthlem.2 . . . . . . . . . 10 D = {x∣(xA ∧ (g “ (B ∖ (fx))) ⊆ (Ax))}
119, 10sbthlem4 3352 . . . . . . . . 9 (((dom g = B ∧ ran gA) ∧ Fun g) → (g “ (AD)) = (B ∖ (fD)))
12 df-ima 2431 . . . . . . . . . 10 (g “ (AD)) = ran (g ↾ (AD))
13 df-rn 2429 . . . . . . . . . 10 ran (g ↾ (AD)) = dom (g ↾ (AD))
1412, 13eqtr 1119 . . . . . . . . 9 (g “ (AD)) = dom (g ↾ (AD))
1511, 14syl5eqr 1138 . . . . . . . 8 (((dom g = B ∧ ran gA) ∧ Fun g) → dom (g ↾ (AD)) = (B ∖ (fD)))
16 df-ima 2431 . . . . . . . . 9 (fD) = ran (fD)
17 df-rn 2429 . . . . . . . . 9 ran (fD) = dom (fD)
1816, 17eqtr2 1120 . . . . . . . 8 dom (fD) = (fD)
1915, 18jctil 240 . . . . . . 7 (((dom g = B ∧ ran gA) ∧ Fun g) → (dom (fD) = (fD) ∧ dom (g ↾ (AD)) = (B ∖ (fD))))
20 ineq12 1640 . . . . . . 7 ((dom (fD) = (fD) ∧ dom (g ↾ (AD)) = (B ∖ (fD))) → (dom (fD) ∩ dom (g ↾ (AD))) = ((fD) ∩ (B ∖ (fD))))
2119, 20syl 12 . . . . . 6 (((dom g = B ∧ ran gA) ∧ Fun g) → (dom (fD) ∩ dom (g ↾ (AD))) = ((fD) ∩ (B ∖ (fD))))
22 difdisj 1758 . . . . . 6 ((fD) ∩ (B ∖ (fD))) = ∅
2321, 22syl6eq 1140 . . . . 5 (((dom g = B ∧ ran gA) ∧ Fun g) → (dom (fD) ∩ dom (g ↾ (AD))) = ∅)
2423adantlll 313 . . . 4 ((((Fun g ∧ dom g = B) ∧ ran gA) ∧ Fun g) → (dom (fD) ∩ dom (g ↾ (AD))) = ∅)
2524adantl 305 . . 3 ((Fun f ∧ (((Fun g ∧ dom g = B) ∧ ran gA) ∧ Fun g)) → (dom (fD) ∩ dom (g ↾ (AD))) = ∅)
261, 8, 25sylanc 361 . 2 ((Fun f ∧ (((Fun g ∧ dom g = B) ∧ ran gA) ∧ Fun g)) → Fun ((fD) ∪ (g ↾ (AD))))
27 sbthlem.3 . . . . 5 H = ((fD) ∪ (g ↾ (AD)))
28 cnveq 2513 . . . . 5 (H = ((fD) ∪ (g ↾ (AD))) → H = ((fD) ∪ (g ↾ (AD))))
2927, 28ax-mp 6 . . . 4 H = ((fD) ∪ (g ↾ (AD)))
30 cnvun 2642 . . . 4 ((fD) ∪ (g ↾ (AD))) = ((fD) ∪ (g ↾ (AD)))
3129, 30eqtr 1119 . . 3 H = ((fD) ∪ (g ↾ (AD)))
32 funeq 2683 . . 3 (H = ((fD) ∪ (g ↾ (AD))) → (Fun H ↔ Fun ((fD) ∪ (g ↾ (AD)))))
3331, 32ax-mp 6 . 2 (Fun H ↔ Fun ((fD) ∪ (g ↾ (AD))))
3426, 33sylibr 175 1 ((Fun f ∧ (((Fun g ∧ dom g = B) ∧ ran gA) ∧ Fun g)) → Fun H)
Colors of variables: wff set class
Syntax hints:   → wi 2   ↔ wb 127   ∧ wa 196  {cab 1090   = wceq 1091   ∈ wcel 1092  Vcvv 1348   ∖ cdif 1484   ∪ cun 1485   ∩ cin 1486   ⊆ wss 1487  ∅c0 1707  cuni 1919  ccnv 2409  dom cdm 2410  ran crn 2411   ↾ cres 2412   “ cima 2413  Fun wfun 2416
This theorem is referenced by:  sbthlem9 3357
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-13 804  ax-14 805  ax-16 922  ax-17 925  ax-ext 1074  ax-rep 1075  ax-pow 1077
This theorem depends on definitions:  df-bi 128  df-or 197  df-an 198  df-ex 679  df-sb 853  df-eu 1009  df-mo 1010  df-clab 1093  df-cleq 1097  df-clel 1099  df-ral 1205  df-rex 1206  df-v 1349  df-dif 1489  df-un 1490  df-in 1491  df-ss 1492  df-nul 1708  df-pw 1799  df-sn 1811  df-pr 1812  df-op 1815  df-uni 1920  df-br 2063  df-opab 2098  df-id 2125  df-xp 2424  df-rel 2425  df-cnv 2426  df-co 2427  df-dm 2428  df-rn 2429  df-res 2430  df-ima 2431  df-fun 2432
metamath.org