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

Theorem funssxp 3633
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 3538 . . . . . 6 |- (Fun F <-> F Fn dom F)
21biimp 151 . . . . 5 |- (Fun F -> F Fn dom F)
3 rnss 3338 . . . . . 6 |- (F (_ (A X. B) -> ran F (_ ran ( A X. B))
4 rnxpss 3470 . . . . . . 7 |- ran ( A X. B) (_ B
5 sstr 2069 . . . . . . 7 |- ((ran F (_ ran ( A X. B) /\ ran ( A X. B) (_ B) -> ran F (_ B)
64, 5mpan2 695 . . . . . 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 3190 . . . 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 3306 . . . . 5 |- (F (_ (A X. B) -> dom F (_ dom ( A X. B))
12 dmxpss 3469 . . . . . 6 |- dom ( A X. B) (_ A
13 sstr 2069 . . . . . 6 |- ((dom F (_ dom ( A X. B) /\ dom ( A X. B) (_ A) -> dom F (_ A)
1412, 13mpan2 695 . . . . 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 3625 . . . 4 |- (F:dom F-->B -> Fun F)
1918adantr 389 . . 3 |- ((F:dom F-->B /\ dom F (_ A) -> Fun F)
20 fssxp 3632 . . . 4 |- (F:dom F-->B -> F (_ (dom F X. B))
21 ssid 2077 . . . . 5 |- B (_ B
22 ssxp 3252 . . . . 5 |- ((dom F (_ A /\ B (_ B) -> (dom F X. B) (_ (A X. B))
2321, 22mpan2 695 . . . 4 |- (dom F (_ A -> (dom F X. B) (_ (A X. B))
2420, 23sylan9ss 2072 . . 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 2044   X. cxp 3164  dom cdm 3166  ran crn 3167  Fun wfun 3172   Fn wfn 3173  -->wf 3174
This theorem is referenced by:  elpm2 4330
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 961  ax-gen 962  ax-8 963  ax-9 964  ax-10 965  ax-11 966  ax-12 967  ax-13 968  ax-14 969  ax-17 970  ax-4 972  ax-5o 974  ax-6o 977  ax-9o 1122  ax-10o 1139  ax-16 1209  ax-11o 1217  ax-ext 1458  ax-sep 2699  ax-pow 2738  ax-pr 2775
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 980  df-sb 1171  df-eu 1381  df-mo 1382  df-clab 1463  df-cleq 1468  df-clel 1471  df-ne 1585  df-ral 1647  df-v 1809  df-dif 2046  df-un 2047  df-in 2048  df-ss 2050  df-nul 2278  df-pw 2399  df-sn 2409  df-pr 2410  df-op 2413  df-br 2616  df-opab 2663  df-xp 3180  df-rel 3181  df-cnv 3182  df-dm 3184  df-rn 3185  df-fun 3188  df-fn 3189  df-f 3190
Copyright terms: Public domain