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

Theorem funssxp 3623
Description: Two ways of specifying a partial function from A to B.
Assertion
Ref Expression
funssxp |- ((Fun F /\ F (_ (A X. B)) <-> (F:dom F-->B /\ dom F (_ A))

Proof of Theorem funssxp
StepHypRef Expression
1 funfn 3528 . . . . . 6 |- (Fun F <-> F Fn dom F)
21biimp 151 . . . . 5 |- (Fun F -> F Fn dom F)
3 rnss 3331 . . . . . 6 |- (F (_ (A X. B) -> ran F (_ ran ( A X. B))
4 rnxpss 3460 . . . . . . 7 |- ran ( A X. B) (_ B
5 sstr 2062 . . . . . . 7 |- ((ran F (_ ran ( A X. B) /\ ran ( A X. B) (_ B) -> ran F (_ B)
64, 5mpan2 694 . . . . . 6 |- (ran F (_ ran ( A X. B) -> ran F (_ B)
73, 6syl 10 . . . . 5 |- (F (_ (A X. B) -> ran F (_ B)
82, 7anim12i 333 . . . 4 |- ((Fun F /\ F (_ (A X. B)) -> (F Fn dom F /\ ran F (_ B))
9 df-f 3184 . . . 4 |- (F:dom F-->B <-> (F Fn dom F /\ ran F (_ B))
108, 9sylibr 200 . . 3 |- ((Fun F /\ F (_ (A X. B)) -> F:dom F-->B)
11 dmss 3299 . . . . 5 |- (F (_ (A X. B) -> dom F (_ dom ( A X. B))
12 dmxpss 3459 . . . . . 6 |- dom ( A X. B) (_ A
13 sstr 2062 . . . . . 6 |- ((dom F (_ dom ( A X. B) /\ dom ( A X. B) (_ A) -> dom F (_ A)
1412, 13mpan2 694 . . . . 5 |- (dom F (_ dom ( A X. B) -> dom F (_ A)
1511, 14syl 10 . . . 4 |- (F (_ (A X. B) -> dom F (_ A)
1615adantl 388 . . 3 |- ((Fun F /\ F (_ (A X. B)) -> dom F (_ A)
1710, 16jca 288 . 2 |- ((Fun F /\ F (_ (A X. B)) -> (F:dom F-->B /\ dom F (_ A))
18 ffun 3615 . . . 4 |- (F:dom F-->B -> Fun F)
1918adantr 389 . . 3 |- ((F:dom F-->B /\ dom F (_ A) -> Fun F)
20 fssxp 3622 . . . 4 |- (F:dom F-->B -> F (_ (dom F X. B))
21 ssid 2070 . . . . 5 |- B (_ B
22 ssxp 3246 . . . . 5 |- ((dom F (_ A /\ B (_ B) -> (dom F X. B) (_ (A X. B))
2321, 22mpan2 694 . . . 4 |- (dom F (_ A -> (dom F X. B) (_ (A X. B))
2420, 23sylan9ss 2065 . . 3 |- ((F:dom F-->B /\ dom F (_ A) -> F (_ (A X. B))
2519, 24jca 288 . 2 |- ((F:dom F-->B /\ dom F (_ A) -> (Fun F /\ F (_ (A X. B)))
2617, 25impbi 157 1 |- ((Fun F /\ F (_ (A X. B)) <-> (F:dom F-->B /\ dom F (_ A))
Colors of variables: wff set class
Syntax hints:   <-> wb 146   /\ wa 223   (_ wss 2037   X. cxp 3158  dom cdm 3160  ran crn 3161  Fun wfun 3166   Fn wfn 3167  -->wf 3168
This theorem is referenced by:  elpm2 4321
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 959  ax-gen 960  ax-8 961  ax-9 962  ax-10 963  ax-11 964  ax-12 965  ax-13 966  ax-14 967  ax-17 968  ax-4 970  ax-5o 972  ax-6o 975  ax-9o 1119  ax-10o 1136  ax-16 1206  ax-11o 1213  ax-ext 1452  ax-sep 2693  ax-pow 2732  ax-pr 2769
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 978  df-sb 1168  df-eu 1375  df-mo 1376  df-clab 1457  df-cleq 1462  df-clel 1465  df-ne 1579  df-ral 1641  df-v 1803  df-dif 2039  df-un 2040  df-in 2041  df-ss 2043  df-nul 2271  df-pw 2392  df-sn 2402  df-pr 2403  df-op 2406  df-br 2610  df-opab 2657  df-xp 3174  df-rel 3175  df-cnv 3176  df-dm 3178  df-rn 3179  df-fun 3182  df-fn 3183  df-f 3184
Copyright terms: Public domain